An outer approximation algorithm for the robust shortest path problem

•We model the weighted mean standard deviation robust shortest path problem.•A conic integer programming formulation is provided.•Problem is solved using the outer approximation algorithm.•The algorithm delivers the optimal solution for four real world transportation networks.•The algorithm outperfo...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Transportation research. Part E, Logistics and transportation review Jg. 58; S. 52 - 66
Hauptverfasser:	Shahabi, Mehrdad, Unnikrishnan, Avinash, Boyles, Stephen D.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Exeter Elsevier India Pvt Ltd 01.11.2013 Elsevier Sequoia S.A
Schlagworte:	Algorithms Approximation Costs Integer programming Mathematical problems Mean – standard deviation objective Outer approximation Robust shortest path Shortest path algorithms Stochastic models Studies Mean – standard deviation objective Robust shortest path Outer approximation
ISSN:	1366-5545, 1878-5794
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!