Abstract
In this paper, a problem based on real-world situations in humanitarian logistics is considered, where the main characteristics are the lack of available vehicles and the imperative need of a quick evacuation of all the affected by a disaster, but within the minimum possible travel cost. These aspects will be considered within a Multi-objective Capacitated Vehicle Routing Problem with Multiple Trips, where the objectives under consideration are: minimization of the number of vehicles, of the total travel cost and of the maximum latency. We consider, in this situation, maximum latency to be more relevant than classic latency criteria since reduction of the waiting time of the last affected is crucial for survival when any disaster strikes. For the purpose of producing high-quality solutions, a Multi-start Algorithm with Intelligent Neighborhood Selection is specifically designed and then compared with one of the most competitive reference in the literature, NSGA-II, to prove its superiority.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
Let R be a reference set computed by merging all solutions found by all the different algorithms into one set and by storing all non-dominated solutions.
\(a\preceq b\) means that the solution a weakly dominates the solution b, i.e., a is not worse than b in any of the objectives.
References
Altay, N., Green, W.G.: OR/MS research in disaster operations management. Eur. J. Oper. Res. 175(1), 475–493 (2006). https://doi.org/10.1016/j.ejor.2005.05.016
Azi, N., Gendreau, M., Potvin, J.Y.: An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. Eur. J. Oper. Res. 202(3), 756–763 (2010)
Balcik, B., Beamon, B.M., Smilowitz, K.: Last mile distribution in humanitarian relief. J. Intell. Transp. Syst. 12(2), 51–63 (2008). https://doi.org/10.1080/15472450802023329
Battarra, M., Monaci, M., Vigo, D.: An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem. Comput. Oper. Res. 36(11), 3041–3050 (2009). https://doi.org/10.1016/j.cor.2009.02.008
Brandão, J., Mercer, A.: A tabu search algorithm for the multi-trip vehicle routing and scheduling problem. Eur. J. Oper. Res. 100(1), 180–191 (1997)
Campbell, A.M., Vandenbussche, D., Hermann, W.: Routing for relief efforts. Transp. Sci. 42(2), 127–145 (2008). https://doi.org/10.1287/trsc.1070.0209
Cattaruzza, D., Absi, N., Feillet, D., Vidal, T.: A memetic algorithm for the multi trip vehicle routing problem. Eur. J. Oper. Res. 236(3), 833–848 (2014). https://doi.org/10.1016/j.ejor.2013.06.012. Vehicle Routing and Distribution Logistics
Cattaruzza, D., Absi, N., Feillet, D.: Vehicle routing problems with multiple trips. 4OR 14(3), 223–259 (2016). 10.1007/s10288-016-0306-2
Christofides, N., Mingozzi, A., Toth, P.: The Vehicle Routing Problem, pp. 315–338. Wiley, Chichester (1979)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Trans. Evolut. Comput. 6(2), 182 (2002)
De la Torre, L.E., Dolinskaya, I., Smilowitz, K.R.: Disaster relief routing: integrating research and practice. Socio Econ. Plan. Sci. 46(1), 88–97 (2012). https://doi.org/10.1016/j.seps.2011.06.001. (Special Issue: Disaster Planning and Logistics: Part 1)
Fisher, M.L.: Optimal solution of vehicle routing problems using minimum k-trees. Oper. Res. 42(4), 626–642 (1994). https://doi.org/10.1287/opre.42.4.626
Galindo, G., Batta, R.: Review of recent developments in or/ms research in disaster operations management. Eur. J. Oper. Res. 230(2), 201–211 (2013). https://doi.org/10.1016/j.ejor.2013.01.039
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Norwell (1997)
Golden, B.L., Kovacs, A.A., Wasil, E.A.: Vehicle routing applications in disaster relief. In: Toth, P., Vigo, D. (eds.) Vehicle Routing problems, Methods, and Applications, chap. 14, pp. 409–436. MOS-SIAM Series on Optimization, Philadelphia (2014)
Huang, M., Smilowitz, K., Balcik, B.: Models for relief routing: equity, efficiency and efficacy. Transp. Res. Part E Logist. Transp. Rev. 48(1), 2–18 (2012). https://doi.org/10.1016/j.tre.2011.05.004. (Select Papers from the 19th International Symposium on Transportation and Traffic Theory)
Koc, C., Karaoglan, I.: A branch and cut algorithm for the vehicle routing problem with multiple use of vehicles. In: 41st International Conference on Computers and Industrial Engineering, pp. 554–559 (2011)
López-Sánchez, A.D., Hernández-Díaz, A.G., Vigo, D., Caballero, R., Molina, J.: A multi-start algorithm for a balanced real-world open vehicle routing problem. Eur. J. Oper. Res. 238(1), 104–113 (2014)
Macedo, R., Alves, C., Valério de Carvalho, J., Clautiaux, F., Hanafi, S.: Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model. Eur. J. Oper. Res. 214(3), 536–545 (2011)
Martínez-Salazar, I., Angel-Bello, F., Alvarez, A.: A customer-centric routing problem with multiple trips of a single vehicle. J. Oper. Res. Soc. 66(8), 1312–1323 (2015). https://doi.org/10.1057/jors.2014.92
Mingozzi, A., Roberti, R., Toth, P.: An exact algorithm for the multitrip vehicle routing problem. INFORMS J. Comput. 25(2), 193–207 (2013). https://doi.org/10.1287/ijoc.1110.0495
Molina, J., Laguna, M., Martí, R., Caballero, R.: SSPMO: a scatter tabu search procedure for non-linear multiobjective optimization. INFORMS J. Comput. 19(1), 91–100 (2007). https://doi.org/10.1287/ijoc.1050.0149
Olivera, A., Viera, O.: Adaptive memory programming for the vehicle routing problem with multiple trips. Comput. Oper. Res. 34(1), 28–47 (2007)
Petch, R., Salhi, S.: A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. Discrete Appl. Math. 133(1–3), 69–92 (2003)
Rivera, J.C., Afsar, H.M., Prins, C.: Springer International Publishing, pp. 129–141. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-11683-9_11
Rivera, J.C., Afsar, H.M., Prins, C.: Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem. Eur. J. Oper. Res. 249(1), 93–104 (2016). https://doi.org/10.1016/j.ejor.2015.08.067
Taillard, E.D., Laporte, G., Gendreau, M.: Vehicle routing with multiple use of vehicles. J. Oper. Res. Soc. 47(8), 1065–1070 (1995)
Vitoriano, B., Ortuo, M.T., Tirado, G., Montero, J.: A multi-criteria optimization model for humanitarian aid distribution. J. Global Optim. 51(2), 189–208 (2011)
Zitzler, E., Thiele, L.: Multiobjective optimization using evolutionary algorithms—a comparative case study. In: Proceedings of the 5th International Conference on Parallel Problem Solving from Nature, PPSN V, pp. 292–304. Springer, London (1998). URL http://dl.acm.org/citation.cfm?id=645824.668610
Zitzler, E.: Evolutionary algorithms for multiobjective optimization: methods and applications. Ph.D. thesis, Swiss Federal Institute of Technology (ETH) Zurich, Switzerland. TIK-Schriftenreihe Nr. 30, Diss ETH No. 13398, Shaker Verlag, Aachen, Germany (1999)
Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., da Fonseca, V.G.: Performance assessment of multiobjective optimizers: an analysis and review. Trans. Evolut. Comput. 7(2), 117–132 (2003). https://doi.org/10.1109/TEVC.2003.810758
Acknowledgements
A.G. Hernández-Díaz, A.D. López-Sánchez, and J. Molina acknowledge support from the Spanish Ministry of Science and Innovation through the Projects ECO2013-47129-C4-1-R and ECO2016-76567-C4-1-R.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Molina, J., López-Sánchez, A.D., Hernández-Díaz, A.G. et al. A Multi-start Algorithm with Intelligent Neighborhood Selection for solving multi-objective humanitarian vehicle routing problems. J Heuristics 24, 111–133 (2018). https://doi.org/10.1007/s10732-017-9360-y
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10732-017-9360-y