Neighborhood Search Methods Designed For Split Delivery Vehicle Routing Problems

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

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: 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	95	检视/开启

在CHUR中所有的数据项都受到原著作权保护.