Finding K shortest looping paths in a traffic-light network

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

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

Title:	Finding K shortest looping paths in a traffic-light network
Authors:	Yang,HH;Chen,YL
Contributors:	資訊管理研究所
Keywords:	VEHICLE-ROUTING PROBLEM;TIME WINDOWS;OPTIMIZATION ALGORITHM;RANKING
Date:	2005
Issue Date:	2010-07-06 17:51:32 (UTC+8)
Publisher:	中央大學
Abstract:	In this paper we consider a traffic-light network where every node in the network is associated with the constraint consisting of a repeated sequence of time windows. The constraint aims to simulate the operations of traffic-light control in an intersecti
Relation:	COMPUTERS & OPERATIONS RESEARCH
Appears in Collections:	[Graduate Institute of Information Management] journal & Dissertation

Files in This Item:

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

社群 sharing