Efficient algorithm for finding k shortest paths based on re-optimization technique

Bi Yu Chen; Xiaowei Chen; Hui-Ping Chen; William H. K. Lam

doi:10.1016/j.tre.2019.11.013

ScienceGate Book Chapters

JOURNAL ARTICLE

Efficient algorithm for finding k shortest paths based on re-optimization technique

Bi Yu Chen Xiaowei Chen Hui-Ping Chen William H. K. Lam

Year: 2019 Journal: Transportation Research Part E Logistics and Transportation Review Vol: 133 Pages: 101819-101819 Publisher: Elsevier BV

DOI: 10.1016/j.tre.2019.11.013

Get Full-Text PDF Get Analytical Report

Keywords:

Constrained Shortest Path First Yen's algorithm Shortest path problem K shortest path routing Shortest Path Faster Algorithm Algorithm Node (physics) Path (computing) Computer science Mathematical optimization Floyd–Warshall algorithm Private Network-to-Network Interface Process (computing) Mathematics Dijkstra's algorithm Routing (electronic design automation) Link-state routing protocol Theoretical computer science Engineering

Metrics

Cited By

3.28

FWCI (Field Weighted Citation Impact)

Refs

0.93

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Data Management and Algorithms

Physical Sciences → Computer Science → Signal Processing

Transportation Planning and Optimization

Social Sciences → Social Sciences → Transportation

Traffic Prediction and Management Techniques

Physical Sciences → Engineering → Building and Construction

Efficient algorithm for finding k shortest paths based on re-optimization technique

Metrics

Citation History

Topics

Related Documents

Finding Multi-Objective Shortest Paths Using Memory-Efficient Stochastic Evolution Based Algorithm

An Efficient K-Shortest Paths Based Routing Algorithm

Genetic Algorithm for finding shortest paths Problem

Finding Shortest Paths

An efficient implementation of an algorithm for finding K shortest simple paths