Abstract
We address the problem of finding sets of K paths, \(K\in \mathbb {N}\), which simultaneously considers two criteria: the minimization of the total paths’ cost and the maximization of their dissimilarity. The purpose of these objectives is to find cheap solutions fairly different from one another, which are relevant considerations in applications that range from hazardous materials transportation to cash collection, where aspects like the safety or the reliability of the solutions are concerns.Two approaches are used to measure the dissimilarity of a set of paths: the extent of the overlap of the paths, in terms of the number of times that each arc appears in more than one of them; and the number of times that the arcs shared by two or more paths appear in that solution. The bi-objective problems resulting from each of these approaches are modeled in terms of integer linear programs, and an \(\varepsilon \)-constraint method is then designed to solve them. Computational results are presented for the two approaches in terms of the time efficiency, the quality of the sets of solutions obtained, and the dissimilarity of the efficient solutions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Akgün, V., Erkut, E., Batta, R.: On finding dissimilar paths. Eur. J. Oper. Res. 121, 232–246 (2000)
Bandyopadhyay, S., Pal, S., Aruna, B.: Multiobjective gas, quantitative indices, and pattern classification. IEEE Trans. Syst. Man Cybern. Part B: Cybern. 34(5), 2088–2099 (2004)
Carotenuto, P., Giordani, S., Ricciardelli, S.: Finding minimum and equitable risk routes for hazmat shipments. Comput. Oper. Res. 34(5), 1304–1327 (2007)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6, 182–197 (2002)
Dell’Olmo, P., Gentili, M., Scozzari, A.: On finding dissimilar Pareto-optimal paths. Eur. J. Oper. Res. 162, 70–82 (2005)
Erkut, E., Verter, V.: Modeling of transport risk for hazardous materials. Oper. Res. 46, 625–642 (1998)
Gouveia, L.: A 2n constraint formulation for the capacitated minimal spanning tree problem. Oper. Res. 43(1), 130–141 (1995)
Haimes, Y., Lasdon, L., Wismer, D.: On a bicriterion formulation of the problems of integrated system identification and system optimization. IEEE Trans. Syst. Man Cybernet. SMC-1:296–297 (1971)
Johnson, P.E., Joy, D.S., Clarke, D.: Highway 3.01, an enhancement routing model: program, description, methodology and revised user’s manual. Working Paper, Oak Ridge National Laboratories, Washington, DC (1992)
Kuby, M., Zhongyi, X., **aodong, X.: A minimax method for finding the \(k\) best “differentiated’’ paths. Geogr. Anal. 29, 298–313 (1997)
Martí, R., González-Velarde, J., Duarte, A.: Heuristics for the bi-objective path dissimilarity problem. Comput. Oper. Res. 36, 2905–2912 (2009)
Moghanni, A., Pascoal, M., Godinho, M.T.: Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations. Comput. Oper. Res. 147, 105939 (2022)
Moghanni, A., Pascoal, M., Godinho, M.T.: Finding dissimilar paths using integer linear formulations. Technical report 21–33, Department of Mathematics, University of Coimbra (2021)
Moghanni, A., Pascoal, M., Godinho, M.T.: Finding \(K\) shortest and dissimilar paths. Int. Trans. Oper. Res. 29, 1573–1601 (2021)
Thyagarajan, K., Batta, R., Karwan, M., Szczerba, R.: Planning dissimilar paths for military units. Mil. Oper. Res. 10, 25–42 (2005)
Acknowledgements
The work of MP and AM was partially financially supported by the Portuguese Foundation for Science and Technology (FCT) under project grants UID/MAT/00324/2020 and UID/MULTI/00308/2020.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Pascoal, M., Godinho, M.T., Moghanni, A. (2023). New Models for Finding K Short and Dissimilar Paths. In: Almeida, J.P., Geraldes, C.S., Lopes, I.C., Moniz, S., Oliveira, J.F., Pinto, A.A. (eds) Operational Research. IO 2021. Springer Proceedings in Mathematics & Statistics, vol 411. Springer, Cham. https://doi.org/10.1007/978-3-031-20788-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-031-20788-4_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-20787-7
Online ISBN: 978-3-031-20788-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)