Two Approaches for Solving the Multi-Depot Vehicle Routing Problem with Time Windows in a Time-Based Logistics Environment

ASIA unversity > 管理學院 > 經營管理學系 > 期刊論文 > Item 310904400/18350

請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/18350

題名:	Two Approaches for Solving the Multi-Depot Vehicle Routing Problem with Time Windows in a Time-Based Logistics Environment
作者:	邱煥能;Huan Neng Chiu;Yi Shyang Lee;Jen Huei Chang
貢獻者:	經營管理學系
關鍵詞:	Multi-depot vehicle routing problem with time windows;Two-phase heuristic method;Meta-heuristic method;Diverse and greedy strategy
日期:	2006-07
上傳時間:	2012-11-26 04:47:35 (UTC+0)
摘要:	This paper presents a two-phase heuristic method that can be used to efficiently solve the intractable multi-depot vehicle routing problem with time windows. The waiting time that was ignored by previous researchers is considered in this study. The necessity of this consideration is verified through an initial experiment. The results indicate that the waiting time has a significant impact on the total distribution time and the number of vehicles used when solving test problems with narrow time windows. In addition, to fairly evaluate the performance of the proposed heuristic method, a meta-heuristic method, which extends the unified tabu search of Cordeau et al., is proposed. The results of a second experiment reveal that the proposed heuristic method can obtain a better solution in the case of narrow time windows and a low capacity ratio, while the proposed meta-heuristic method outperforms the proposed heuristic method, provided that wide time windows and a high capacity ratio are assumed. Finally, a well-known logistics company in Taiwan is used to demonstrate the method, and a comparison is made, which shows that the proposed heuristic method is superior to the current method adopted by the case company.
關聯:	PRODUCTION PLANNING & CONTROL,17(5):480-493.
顯示於類別:	[經營管理學系 ] 期刊論文

文件中的檔案:

沒有與此文件相關的檔案.

在ASIAIR中所有的資料項目都受到原著作權保護.

資料載入中.....