Minimization of travel time and weighted number of stops in a traffic-light network

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

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

Title:	Minimization of travel time and weighted number of stops in a traffic-light network
Authors:	Chen,YL;Yang,HH
Contributors:	資訊管理研究所
Keywords:	VEHICLE-ROUTING PROBLEM;SALESMAN PROBLEM;SHORTEST PATHS;WINDOWS;ALGORITHMS;HEURISTICS
Date:	2003
Issue Date:	2010-07-06 17:52:48 (UTC+8)
Publisher:	中央大學
Abstract:	The time-constrained shortest path problem is an important generalization of the shortest path problem. Recently, a model called traffic-light control model was introduced by Chen and Yang [Transport. Res. B 34 (2000) 241] to simulate the operations of tr
Relation:	EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Appears in Collections:	[Graduate Institute of Information Management] journal & Dissertation

Files in This Item:

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

社群 sharing