Neighborhood Search Methods Designed For Split Delivery Vehicle Routing Problems

Chung-Hua University Repository > 管理學院 > 運輸科技與物流管理學系 > 研討會論文 > Item 987654321/29961

請使用永久網址來引用或連結此文件: http://chur.chu.edu.tw/handle/987654321/29961

題名:	Neighborhood Search Methods Designed For Split Delivery Vehicle Routing Problems
作者:	卓裕仁 Cho, Yuh-Jen
貢獻者:	運輸科技與物流管理學系 Transportation Technology and Logistics Management
關鍵詞:	Split delivery;Vehicle routing problem;Ejection-chain;Variable neighborhood descent
日期:	2011
上傳時間:	2014-06-27 00:45:24 (UTC+8)
摘要:	Split delivery vehicle routing problem (SDVRP), which allows the demand of a customer to be split and delivered by multiple vehicles, is a variant of conventional vehicle routing problem (VRP). The potential savings due to the split delivery has proved to
顯示於類別:	[運輸科技與物流管理學系] 研討會論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
s_m620_0210.pdf		28Kb	Adobe PDF	91	檢視/開啟

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