Work

A Constrained Time-Dependent K Shortest Paths Algorithm Addressing Overlap and Travel Time Deviation

Year: 2015

Type: article

Abstract: Theoretical research often assumes all users are homogeneous in their route choice decision and will always pick the route with the shortest travel cost, which is not necessarily the case in reality. This paper documents the research effort in developing a Constrained Time-Dependent K Shortest Paths Algorithm in order to find K Shortest Paths between two given locations. The goal of this research is to provide sound route options to travelers in order to assist their route choice decision process, during which the overlap and travel time deviation issues between the K paths will be considered. The proposed algorithm balancing overlap and travel time deviation is developed in this research. A numerical analysis is conducted on the Tucson I-10 network, the outcome of the case study shows that our proposed algorithm is able to find different shortest paths with a reasonable degree of similarity and close travel time, which indicates that the result of the proposed algorithm is satisfactory.

Source: International Journal of Transportation Science and Technology

DOI: 10.1016/s2046-0430(16)30169-1

Authors: Xianbiao Hu, Yi-Chang Chiu

Institution: University of Arizona

Language: English

Topic: Transportation Planning and Optimization

Subfield: Transportation

Field: Social Sciences

Domain: Social Sciences

SDGs: Sustainable cities and communities, Industry, innovation and infrastructure

Open Access status: diamond

OpenAlex ID: W2564037751

FWCI: 1.267

Cites: 36

Cited by: 10

Related to: 10