The Linehaul-Feeder Vehicle Routing Problem with Virtual Depots and Time Windows

NCU Institutional Repository > 工學院 > 土木工程學系 > 期刊論文 > Item 987654321/49839

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/49839

题名:	The Linehaul-Feeder Vehicle Routing Problem with Virtual Depots and Time Windows
作者:	Chen,HK;Chou,HW;Hsu,CY
贡献者:	土木工程學系
关键词:	CROSS-DOCKING;SUPPLY CHAIN;TRUCK
日期:	2011
上传时间:	2012-03-27 16:18:19 (UTC+8)
出版者:	國立中央大學
摘要:	This paper addresses the linehaul-feeder vehicle routing problem with virtual depots and time windows (LFVRPTW). Small and large vehicles deliver services to customers within time constraints; small vehicles en route may reload commodities from either the physical depot or from the larger vehicle at a virtual depot before continuing onward. A two-stage solution heuristic involving Tabu search is proposed to solve this problem. The test results show that the LFVRPTW performs better than the vehicle routing problem with time windows in terms of both objective value and the number of small vehicles dispatched.
關聯:	MATHEMATICAL PROBLEMS IN ENGINEERING
显示于类别:	[土木工程學系 ] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	499	检视/开启

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

社群 sharing