On-line vehicle routing with time windows - Optimization-based heuristics approach for freight demands requested in real-time

NCUIR > Engineering College > Graduate Institute of Civil Engineering > journal & Dissertation > Item 987654321/26361

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

Title:	On-line vehicle routing with time windows - Optimization-based heuristics approach for freight demands requested in real-time
Authors:	Shieh,HM;May,MD
Contributors:	土木工程研究所
Keywords:	SYSTEMS
Date:	1998
Issue Date:	2010-06-29 17:21:38 (UTC+8)
Publisher:	中央大學
Abstract:	The problem of the on-line version of the vehicle routing problem with time windows (VRPTW) differs from the traditional off-line problem in the dynamical arrival of requests and the execution of the partial tour during the run time. The study develops an on-line optimization-based heuristic that combined the concepts of the "on-line algorithm," "anytime algorithm," and local search heuristics to solve the on-line version of VRPTW. The solution heuristic is evaluated with modified Solomon's problems. By comparing with these benchmark problems, the different results between on-line and off-line algorithms are indicated.
Relation:	LAND USE AND TRANSPORTATION PLANNING AND PROGRAMMING APPLICATIONS
Appears in Collections:	[Graduate Institute of Civil Engineering] journal & Dissertation

Files in This Item:

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

社群 sharing