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

NCUIR > Engineering College > Department of Civil Engineering > journal & Dissertation > Item 987654321/49839

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/49839

Title:	The Linehaul-Feeder Vehicle Routing Problem with Virtual Depots and Time Windows
Authors:	Chen,HK;Chou,HW;Hsu,CY
Contributors:	土木工程學系
Keywords:	CROSS-DOCKING;SUPPLY CHAIN;TRUCK
Date:	2011
Issue Date:	2012-03-27 16:18:19 (UTC+8)
Publisher:	國立中央大學
Abstract:	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.
Relation:	MATHEMATICAL PROBLEMS IN ENGINEERING
Appears in Collections:	[Department of Civil Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	456	View/Open

社群 sharing