An exact method for the biobjective shortest path problem for large-scale road networks

•Recursive exact algorithm that implicitly enumerates all solutions.•Fast method that works well on graphs of up to 1.2 million nodes and 2.8 million arcs.•Consistently outperformed a top-performer benchmark algorithm for real road networks.•Easily extensible to the multiobjective shortest path prob...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	European journal of operational research Jg. 242; H. 3; S. 788 - 797
Hauptverfasser:	Duque, Daniel, Lozano, Leonardo, Medaglia, Andrés L.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 01.05.2015 Elsevier Sequoia S.A
Schlagworte:	Algorithms Biobjective shortest path Enumeration Handles Mathematical functions Multiobjective combinatorial optimization (MOCO) Multiobjective shortest path Network flow problem Networks Operational research Pulse algorithm Recursive methods Roads Roads & highways Routing Shortest path algorithms Shortest-path problems Studies Multiobjective combinatorial optimization (MOCO) Routing Biobjective shortest path Multiobjective shortest path Pulse algorithm
ISSN:	0377-2217, 1872-6860
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!