Finding K shortest looping paths with waiting time in a time-window network

NCUIR > School of Management at National Central University > Graduate Institute of Information Management > journal & Dissertation > Item 987654321/31542

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

Title:	Finding K shortest looping paths with waiting time in a time-window network
Authors:	Hsu-Hao Yang,Yen-Liang Chen
Contributors:	資訊管理研究所
Keywords:	VEHICLE-ROUTING PROBLEM;TRAFFIC-LIGHT NETWORK;OPTIMIZATION ALGORITHM;HEURISTICS;RANKING
Date:	2006
Issue Date:	2010-07-06 17:50:30 (UTC+8)
Publisher:	中央大學
Abstract:	A time-constrained shortest path problem is a shortest path problem including time constraints that are commonly modeled by the form of time windows. Finding K shortest paths are suitable for the problem associated with constraints that are difficult to d
Relation:	APPLIED MATHEMATICAL MODELLING
Appears in Collections:	[Graduate Institute of Information Management] journal & Dissertation

Files in This Item:

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

社群 sharing