An exact bidirectional pulse algorithm for the constrained shortest path

A constrained shortest path is a minimum‐cost sequence of arcs on a directed network that satisfies knapsack‐type constraints on the resource consumption over the arcs. We propose an exact method based on a recursive depth‐first search procedure known as the pulse algorithm (PA). One of the key cont...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Networks 2020-09, Vol.76 (2), p.128-146
Hauptverfasser:	Cabrera, Nicolás, Medaglia, Andrés L., Lozano, Leonardo, Duque, Daniel
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms bidirectional search constrained shortest path Constraints large‐scale networks Recursive methods Roads Shortest-path problems
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!