TRB Pubsindex
Text Size:
x

« Prev Next »

Return to Results | New Search

Bookmark and Share

Title:

Finding the Constrained Shortest Path Using Random Walk

Accession Number:

01157021

Record Type:

Component

Availability:

Transportation Research Board Business Office

500 Fifth Street, NW
Washington, DC 20001 United States

Abstract:

In this paper, the author proposes an improved walk search strategy to solve the constrained shortest path problem. The proposed search strategy is a local search algorithm which explores a network by walker navigating through the network. In order to analyze and evaluate the proposed search strategy, the author presents the results of two computational studies in which the proposed search algorithm is tested. Moreover, the author compares the proposed algorithm with the ant colony algorithm. The analysis and comparison results demonstrate that the proposed algorithm is an effective tool for solving the constrained shortest path problem. Not only it can be used to solve the optimization problem on a larger network, but also it is superior to the ant colony algorithm in terms of the solution time and optimal paths.

Monograph Accession #:

01147878

Report/Paper Numbers:

10-0122

Language:

English

Corporate Authors:

Transportation Research Board

500 Fifth Street, NW
Washington, DC 20001 United States

Authors:

Li, KePing

Pagination:

12p

Publication Date:

2010

Conference:

Transportation Research Board 89th Annual Meeting

Location: Washington DC, United States
Date: 2010-1-10 to 2010-1-14
Sponsors: Transportation Research Board

Media Type:

DVD

Features:

Figures (3) ; References (26) ; Tables (4)

Uncontrolled Terms:

Ant colony optimization; Search models

Subject Areas:

Pedestrians and Bicyclists; Planning and Forecasting; I72: Traffic and Transport Planning

Source Data:

Transportation Research Board Annual Meeting 2010 Paper #10-0122

Files:

TRIS, TRB

Created Date:

Jan 25 2010 10:08AM