Robust Bi-objective Shortest Path Problem in Real Road Networks
Road journeys are one of our most frequent daily tasks. Despite we need them, these trips have some associated costs: time, money, pollution, etc. One of the usual ways of modeling the road network is as a graph. The shortest path problem consists in finding the path in a graph that minimizes a certain cost function. However, in real world applications, more than one objective must be optimized simultaneously (e.g. time and pollution) and the data used in the optimization is not precise: it contains errors. In this paper we propose a new mathematical model for the robust bi-objective shortest path problem. In addition, some empirical studies are included to illustrate the utility of our formulation.
KeywordsRobustness Traffic road network Bi-objective shortest path Multi-objective optimization
This research was partially funded by the University of Málaga, Andalucía Tech, and the Spanish Ministry of Economy and Competitiveness and FEDER (grant TIN2014-57341-R).
- 3.Cintrano, C., Stolfi, D.H., Toutouh, J., Chicano, F., Alba, E.: CTPATH: a real world system to enable green transportation by optimizing environmentaly friendly routing paths. In: Alba, E., Chicano, F., Luque, G. (eds.) Smart-CT 2016. LNCS, vol. 9704, pp. 63–75. Springer, Cham (2016). doi: 10.1007/978-3-319-39595-1_7 Google Scholar
- 11.Ehrgott, M., Ide, J., Schöbel, A.: Minmax robustness for multi-objective optimization problems. Eur. J. Oper. Res. (1), 17–31Google Scholar