The first K shortest unique-arc walks in a traffic-light network

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

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

Title:	The first K shortest unique-arc walks in a traffic-light network
Authors:	Yang,HH;Chen,YL
Contributors:	資訊管理研究所
Keywords:	VEHICLE-ROUTING PROBLEM;TIME WINDOWS;OPTIMIZATION ALGORITHM;PATH ALGORITHMS
Date:	2004
Issue Date:	2010-07-06 17:52:28 (UTC+8)
Publisher:	中央大學
Abstract:	In this article, we present an algorithm to find the first K shortest unique-arc walks in a traffic-light network. Each node of the present network is associated with a repeated sequence of different windows to model operations of traffic signals and inte
Relation:	MATHEMATICAL AND COMPUTER MODELLING
Appears in Collections:	[Graduate Institute of Information Management] journal & Dissertation

Files in This Item:

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

社群 sharing