The Linehaul-Feeder Vehicle Routing Problem With Virtual Depots

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

請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/49838

題名:	The Linehaul-Feeder Vehicle Routing Problem With Virtual Depots
作者:	Chen,HK;Chou,HW;Hsueh,CF;Ho,TY
貢獻者:	土木工程學系
關鍵詞:	HUB-AND-SPOKE;NETWORK DESIGN;CROSS-DOCKING;TRUCK;SELECTION;DELIVERY;SYSTEMS
日期:	2011
上傳時間:	2012-03-27 16:18:18 (UTC+8)
出版者:	國立中央大學
摘要:	The problem addressed in this paper-the linehaul- feeder vehicle routing problem with virtual depots (LFVRP-VD)-can be regarded as an extension of the vehicle routing problem. During delivery operation, one large vehicle departs from the physical depot (PD) and services all virtual depots (VDs). A set of small vehicles delivers to customers and, if necessary, reloads either from the PD or from the large vehicle at a VD before continuing work. The objective of the operation is to minimize the total travel and waiting costs for all vehicles. Two heuristics that embed the cost-sharing method and the threshold method are proposed for initial solution construction. Seventeen test problems are extensively examined. The results show that the cost-sharing method outperforms the threshold method in terms of several selected performance measures. In addition, the more candidates available a VD can choose, the better the obtained objective value. Note to Practitioners-Linehaul-feeder vehicle routing problem with virtual depots is practical to the logistics and transportation companies, especially in the urban area where local streets are too narrow or large vehicles are not allowed to enter. Note that the higher the customer demands, the better the benefit of the LFVRP-VD.
關聯:	IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING
顯示於類別:	[土木工程學系 ] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	408	檢視/開啟

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

社群 sharing

資料載入中.....