請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/58902完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 周擁強(Yon-Chun Chou) | |
| dc.contributor.author | Ariel Wardhana | en |
| dc.contributor.author | 溫帶榮 | zh_TW |
| dc.date.accessioned | 2021-06-16T08:37:44Z | - |
| dc.date.available | 2013-11-05 | |
| dc.date.copyright | 2013-11-05 | |
| dc.date.issued | 2013 | |
| dc.date.submitted | 2013-10-16 | |
| dc.identifier.citation | 1. Cortes, C.E., Matamala, M., and Contardo, C., (2009). The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method, European Journal of Operational Research, Vol. 200, pp. 711-724.
2. Cruijssen, F., Cools, M., and Dullaert, W., (2007). Horizontal cooperation in logistics: Opportunities and impediments, Transportation Research Part E: Logistics and Transportation Review, Vol. 43, No. 2, pp. 129–142. 3. Dai, B., and Chen, H.X., (2009). Mathematical Model and Solution Approach for Collaborative Logistics in Less Than Truckload (LTL) Transportation, International Conference on Computers & Industrial Engineering, 6-9 July 2009, pp. 767 – 772. 4. Desrosiers, J., Dumas, Y., Solomon, M., and Soumis, F., (1995). Time constrained routing and scheduling, Handbooks in Operations Research and Management Science, Vol. 8, pp. 35–139. 5. Juan, Z.C., Fu, Z.N., and Wu, F., (2006). Study on Methods of Interest Allocation for Participant Enterprises in Joint Distribution, IEEE International Conference on Service Operations and Logistics and Informatics, 21-23 June 2006, pp. 79 – 83. 6. Liu, R., Jiang, Z.B., Liu, X., and Chen, F., (2010). Task selection and routing problems in collaborative truckload transportation, Transportation Research Part E: Logistics and Transportation Review, Vol. 46, No. 6, pp. 1071–1085. 7. Mes, M., Heijden, M.V.D., and Schuur, P., (2010). Look-ahead strategies for dynamic pickup and delivery problems. Operations Research-Spektrum, Vol. 32, No. 2, pp. 395-421. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/58902 | - |
| dc.description.abstract | 取送貨路線問題已被廣泛得研究以及為了獲得最佳的路線問題解答各種演算法已經被研製. 實際上, 許多運輸相關企業為提供高服務質量在最短的時間內競爭完成顧客訂單, 同時他們力求花最少的取送貨路線成本. 然而,為處理大型服務區域和不穩的需求, 協同物流視為一個好的方法以提高服務質量. 協同物流是幾家企業合作團結起來取與送貨以提升物流效率. 在本研究取送貨區域分為某些地區而已指定的信使員負責每一個特定的地區. 此外, 轉運站設立作為所有各方信使員可以交換已取的貨或將要送的貨的一個地點.
有兩個相對的基準用來測量擬議的協同物流的質量. 第一個參數是取送貨服務企業的工作量也就是各方信使所走過的行駛距離. 第二個參數是客戶等候時間, 此時期是從顧客發布他們取送貨訂單開始到那特定的貨到達了目的地. 客戶訂單定期累積,而取送貨服務是在每個特定期間結束時執行. 此實驗執行兩個原始和協同的方法以比較與分析擬議方法的效力. 試驗結果顯示新的方法比原始的方法在彈性時期具有較好的效率. | zh_TW |
| dc.description.abstract | Pickup and Delivery (P&D) routing problems have been widely studied and various algorithms have been developed to get optimal routing solution. In practice, many transportation-related parties compete to provide high service quality by swiftly doing customer orders, while they try to spend the least expenditure on their P&D trips. However, to deal with large service area and changing demands, collaborative logistic is considered as a good strategy to increase service quality. Collaborative logistic is a cooperation of several enterprises which unite together to collect and deliver items in order to improve logistic efficiency. In this research, a P&D area is divided into multiple regions and a specified party is responsible for each particular region. Moreover, a hub transshipment is set up as a place for all parties to exchange any collected or to-be-delivered items.
Two opposed benchmarks are considered for measuring the quality of proposed collaborative service. The first parameter is the workload of the P&D service providers which is measured by travelled distance. The second parameter is the customer waiting time, which begins at the order release time and finishes when the specified items have arrived at requested destination. Customer orders are accumulated periodically, and the P&D service is performed at the end of every period. Experiments with both original policy and collaborative policy are performed in order to compare and evaluate the effectiveness of the proposed policy. Experiment results show that the proposed policy outperforms original policy in flexible time period. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-16T08:37:44Z (GMT). No. of bitstreams: 1 ntu-102-R00546033-1.pdf: 3795081 bytes, checksum: 2aa40b9f97e83162a119523bc36198e4 (MD5) Previous issue date: 2013 | en |
| dc.description.tableofcontents | THESIS DEFENCE COMMITTEE EXAMINATION REPORT……………………….i
ACKNOWLEDGEMENT ii ABSTRACT iii 摘要 iv TABLE OF CONTENTS v LIST OF FIGURES vii LIST OF TABLES ix Chapter 1 Introduction 1 1.1. Background 1 1.2. Research Objectives 5 1.3. Scope 5 1.4. Research Step 6 Chapter 2 Literature Review 8 2.1. The concept of Pickup and Delivery Problem 8 2.1.1 P&D Problem Constraints 8 2.2. Routing Heuristic and Algorithm 9 2.3. Transhipment in P&D Problem 9 2.4. Interest Allocation Method 10 2.4.1. The Evaluation Approach of Cooperation Game 11 2.5. Opportunities and Impediment of Collaborative P&D 15 Chapter 3 Collaborative Logistic Simulation 17 3.1. Determining P&D Points and Their Routing 17 3.2. Collaborative Logistic Classification 22 3.3. Full-Job Collaborative Logistic Example 24 3.4. Combined Collaborative Logistic Example 27 3.5. Transshipment and Collaboration of Courier 29 3.5.1. Policy 1 (Original Policy) 30 3.5.2. Policy 2 (Hub Transshipment) 30 3.6. Mathematical Model 32 3.7. Database System and Computation Platform 35 3.7.1. Importing Data to Microsoft Access 35 3.7.2. Creating Query in Microsoft Access 36 3.7.3. Macro in Microsoft Access 38 3.7.4. Form in Microsoft Access 39 3.7.5. Nodes Sequencing and Dispatch Rule 40 3.7.6. Generating Distance Matrix 41 3.7.7. LINGO Computation System 43 Chapter 4 Experiment and Analysis 45 4.1. Experiment Plan 45 4.2. Workload 48 4.3. Waiting Time 51 4.4. Result Comparison 53 4.4.1. Fixed Time Bucket Performance Result 53 4.4.2. Flexible Time Bucket Performance Result 54 Chapter 5 Conclusion & Future Research 56 5.1. Conclusion 56 5.2. Future Research 56 REFERENCE 58 | |
| dc.language.iso | en | |
| dc.subject | 兩個相對的基準 | zh_TW |
| dc.subject | 行駛距離 | zh_TW |
| dc.subject | 客戶等候時間 | zh_TW |
| dc.subject | 轉運站 | zh_TW |
| dc.subject | 協同政策 | zh_TW |
| dc.subject | 彈性時期 | zh_TW |
| dc.subject | Flexible Time Period | en |
| dc.subject | Transshipment Hub | en |
| dc.subject | Two Opposed Benchmark | en |
| dc.subject | Travelled Distance | en |
| dc.subject | Customer Waiting Time | en |
| dc.subject | Collaborative Policy | en |
| dc.title | 橫跨彈性時期取送貨轉運服務的效果分析 | zh_TW |
| dc.title | Effects of Pickup and Delivery Services
by Hub Transshipment across Flexible Time Period | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 102-1 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 巫木誠(Muh-Cherng Wu),楊烽正(Feng-Cheng Yang) | |
| dc.subject.keyword | 協同政策,轉運站,兩個相對的基準,行駛距離,客戶等候時間,彈性時期, | zh_TW |
| dc.subject.keyword | Collaborative Policy,Transshipment Hub,Two Opposed Benchmark,Travelled Distance,Customer Waiting Time,Flexible Time Period, | en |
| dc.relation.page | 95 | |
| dc.rights.note | 有償授權 | |
| dc.date.accepted | 2013-10-16 | |
| dc.contributor.author-college | 工學院 | zh_TW |
| dc.contributor.author-dept | 工業工程學研究所 | zh_TW |
| 顯示於系所單位: | 工業工程學研究所 | |
文件中的檔案:
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-102-1.pdf 未授權公開取用 | 3.71 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。
