:::

詳目顯示

回上一頁
題名:宅配業車輛路線問題之研究
書刊名:運輸計劃
作者:林志鴻 引用關係許晉嘉
作者(外文):Lin, Chih-hungHsu, Chin-chia
出版日期:2006
卷期:35:4
頁次:頁443-473
主題關鍵詞:宅配業車輛路線規劃問題旅行銷售員問題Home delivery carrierVehicle routing problemTraveling salesman problem
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(1) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:1
  • 共同引用共同引用:5
  • 點閱點閱:74
近年來,國內宅配市場日趨受到重視,進而促使國內幾個大型企業相繼投入宅配市場之經營,亦帶動國內的傳統貨物運輸業者轉型進行宅配服務 (以下簡稱宅配業),而本研究主要是針對宅配業之車輛路線問題進行探討。經實地訪查了解,宅配業車輛路線問題之特性包括須同時考量收送貨、需求點具有動態性質、車輛起迄點相同、…等,屬旅行銷售員問題之變化,而本研究除深入探討此問題特性外,並依其特性直接構建相關數學模式,以及研提啟發式解法,且進一步進行實例研究,以了解本研究成果於實務上之適用性,依求解結果顯示,本研究所規劃之路線均符合問題特性,故本研究成果應可進一步作為後續研究或相關業者之參考。
In recent years, the development of computer networks and e-commerce has led to changes in freight transport supply and demand and to an increase in the demand of delivery goods to home, which many freight transport companies interested in. Generally speaking, the companies are called deli(are ) very-goods-to-home carriers (DHC), similar to less-than-truckload carriers. This paper explores the vehicle routing problem of DHC (or vehicle routing problem for home delivery (VRPHD)). Actuality, the VRPHD and traveling salesman problem (TSP) are similar, and the characteristics of VRPHD include pickup-delivery routing, order clustered customers, and real-time needs of certain customers. Therefore, the VRPHD is a dynamic pickup-delivery traveling salesman problem with backhauls (DPDTSPB). In this study, we have developed some models and a heuristics algorithm to solve the VRPHD. The empirical results suggest that the route design proposed in this study fits in well with the characteristics of VRPHD. Furthermore, this study also provides valuable suggestions for future studies and the DHC in Taiwan.
期刊論文
1.Laporte, Gilbert、Mitrović-Minić, Snežana、Krishnamurti, Ramesh(2004)。Double-horizon Based Heuristics for the Dynamic Pickup and Delivery Problem with Time Windows。Transportation Research Part B: Methodological,38(8),669-685。  new window
2.Mitrovic-Minic, S.、Laporte, Gilbert(2004)。Waiting Strategies for the Dynamic Pickup and Delivery Problem with Time Windows。Transportation Research Part B: Methodological,38(7),635-655。  new window
3.Mosheiov, G.(1994)。The traveling salesman problem with pick-up and delivery。European Journal of Operational Research,79(2),299-310。  new window
4.Gendreau, M.、Hertz, A.、Laporte, G.(1996)。The traveling salesman problem with backhauls。Computers and Operations Research,23(5),501-508。  new window
5.韓復華、王國琛(20020600)。巨集啟發式解法在求解大規模旅行推銷員問題之應用。運輸學刊,14(2),1-14。new window  延伸查詢new window
6.Gendreau, Michel、Laporte, Gilbert、Vigo, Daniele(1999)。Heuristics for the Traveling Salesman Problem with Pickup and Delivery。Computers & Operations Research,26(7),699-714。  new window
7.Jongens, Kees、Volgenant, Ton(1985)。The Symmetric Clustered Traveling Salesman Problem。European Journal of Operational Research,19(1),68-75。  new window
8.Anily, S.、Bramel, J.、Hertz, A.(1999)。A 5/3-Approximation Algorithm for the Clustered Traveling Salesman Tour and Path Problems。Operations Research Letters,24,29-35。  new window
9.Renaud, J.、Boctor, F. F.、Ouenniche, J.(2000)。A Heuristic for the Pickup and Delivery Traveling Salesman Problem。Computers & Operations Research,27,905-916。  new window
10.Savelsbergh, M. W. P.、Sol, M.(1995)。The General Pickup and Delivery Problem。Transportation Science,29(1),17-29。  new window
11.Anily, S.、Mosheiov, G.(1994)。The Traveling Salesman Problem with Delivery and Backhauls。Operations Research Letters,16,11-18。  new window
12.Dueck, G.、Scheuer, T.(1990)。Threshold Accepting: A General Purpose Optimizatiion Algorithm Appeared Superior to Simulated Annealing。Journal of Computation Physics,90,161-175。  new window
會議論文
1.蘇昭銘、張志鴻、莊子駿(2001)。應用GIS分析宅配業車輛路線排程作業之研究。0。411-420。  延伸查詢new window
圖書
1.Psaraftis, Harilaos N.(1988)。Dynamic Vehicle Routing Problems。Vehicle Routing: Methods and Studies。Amsterdam, Netherlands/ New York, NY。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE