Abstract
The minmax regret robust shortest path problem is a combinatorial optimization problem that can be defined over networks where costs are assigned to arcs under a given scenario. This model can be continuous or discrete, depending on whether costs vary within intervals or within discrete sets of values. The problem consists in finding a path that minimizes the maximum deviation from the shortest paths over all scenarios. This work focuses on designing tools to reduce the network, in order to make easier the search for an optimum solution. With this purpose, methods to identify useless nodes to be removed and to detect arcs that surely belong to the optimum solution are developed. Two known algorithms for the robust shortest path problem are tested on random networks with and without these preprocessing rules.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs (1993)
Catanzaro, D., Labbé, M., Salazar-Neumann, M.: Reduction approaches for robust shortest path problems. Comput. Oper. Res. 38, 1610–1619 (2011)
Karasan, O.E., Pinar, M.C., Yaman, H.: The robust shortest path problem with interval data. Technical Report, Bilkent University, Ankara (2001)
Montemanni, R., Gambardella, L.: An exact algorithm for the robust shortest path problem with interval data. Comput. Oper. Res. 31, 1667–1680 (2004)
Montemanni, R., Gambardella, L.: The robust shortest path problem with interval data via Benders decomposition. 4OR: Q. J. Belg. Fr. Ital. Oper. Res. Soc. 3, 315–328 (2005)
Montemanni, R., Gambardella, L., Donati, V.: A branch and bound algorithm for the robust shortest path problem with interval data. Oper. Res. Lett. 32, 225–232 (2004)
Murthy, I., Her, S.-S.: Solving min-max shortest path problems on a network. Nav. Res. Logist. 39, 669–683 (1992)
Pascoal, M., Resende, M.: Minmax regret robust shortest path problem in a finite multi-scenario model. Appl. Math. Comput. 241, 88–111 (2014)
Yu, G., Yang, J.: On the robust shortest path problem. Comput. Oper. Res. 25, 457–468 (1998)
Acknowledgements
This work has been partially supported by the Portuguese Foundation for Science and Technology under project grants PEst-OE/ EEI/UI308/2014 and SFRH/BD/51169/2010.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Pascoal, M.M.B., Resende, M. (2015). Reducing the Minmax Regret Robust Shortest Path Problem with Finite Multi-scenarios. In: Bourguignon, JP., Jeltsch, R., Pinto, A., Viana, M. (eds) Mathematics of Energy and Climate Change. CIM Series in Mathematical Sciences, vol 2. Springer, Cham. https://doi.org/10.1007/978-3-319-16121-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-16121-1_11
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-16120-4
Online ISBN: 978-3-319-16121-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)