An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem

Antonio Sedeño-Noda and Sergio Alonso-Rodríguez

Applied Mathematics and Computation, 2015, vol. 265, issue C, 602-618

Abstract: We propose an exact method to solve the constrained shortest path (CSP) problem. The new approach takes advantage of the binary partition strategy of a recent K shortest paths (K-SP) algorithm that allows posing numerous additional path constraints in the model without extra difficulty. We adapt and incorporate several pruning strategies from the literature on the CSP problem in this scheme and obtain a robust and scalable algorithm. The method is compared with the current best algorithm to solve the CSP problem and produces significant speedups in a wide range of network configurations. An example is given where the CSP problem is solved in road networks containing a million nodes and arcs.

Keywords: Constrained shortest paths; Shortest path algorithms; Ranking best solutions (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300315007407
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:265:y:2015:i:c:p:602-618

DOI: 10.1016/j.amc.2015.05.109

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().