Abstract
This paper addresses a novel capacitated vehicle routing problem with time-dependent demands (CVRP-TDD) arising in a relief distribution situation in a region struck by the disaster. The locations closest to the epicenter are the ones hit hardest and the natural reaction of survivors is to flee from these points, called critical nodes. Lacks or delays in relief distribution amplify this behavior. To reduce this phenomenon, we aim to maximize the demand satisfied at the critical nodes. We present an optimal splitting procedure and a metaheuristic framework that can execute four different methods, by changing only three parameters. The results shows the good performance of two methods and highlight the efficiency of the splitting procedure.
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Akbari, V., Salman, F.S.: Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity. European Journal of Operational Research 257(2), 625–640 (2017)
Beasley, J.E.: Route first—cluster second methods for vehicle routing. Omega 11(4), 403–408 (1983)
Cattaruzza, D., Absi, N., Feillet, D., Vidal, T.: A memetic algorithm for the multi trip vehicle routing problem. European Journal of Operational Research 236(3), 833–848 (2014)
Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. Wiley, Chichester (1979)
Coppola, D.P.: The management of disasters. In: Coppola, D.P. (ed.) Introduction to International Disaster Management, 3rd edn. Butterworth-Heinemann (2015)
Cozzolino, A.: Humanitarian logistics and supply chain management. In: Humanitarian Logistics. Springer Briefs in Business, pp. 5–16. Springer, Heidelberg (2012)
Duque, P.A.M., Dolinskaya, I.S., Sörensen, K.: Network repair crew scheduling and routing for emergency relief distribution problem. European Journal of Operational Research 248(1), 272–285 (2016). http://www.sciencedirect.com/science/article/pii/S0377221715005408
Glover, F.: Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Applied Mathematics 65(13), 223–253 (1996)
Guha-Sapir, D., Hoyois, P., Below, R.: Annual disaster statistical review 2015: The numbers and trends (2016)
Gutjahr, W.J., Dzubur, N.: Bi-objective bilevel optimization of distribution center locations considering user equilibria. Transportation Research Part E: Logistics and Transportation Review 85, 1–22 (2016)
Lacomme, P., Prins, C., Prodhon, C., Ren, L.: A multi-start split based path relinking (msspr) approach for the vehicle routing problem with route balancing. Engineering Applications of Artificial Intelligence 38, 237–251 (2015)
Lourenço, H.R., Martin, O.C., Stützle, T.: Iterated local search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, International Series in Operations Research & Management Science, vol. 57, pp. 320–353. Springer, US (2003)
Lu, C.C., Ying, K.C., Chen, H.J.: Real-time relief distribution in the aftermath of disasters-a rolling horizon approach. Transportation research part E: logistics and transportation review 93, 1–20 (2016)
Lysgaard, J., Wøhlk, S.: A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem. European Journal of Operational Research 236(3), 800–810 (2014)
Moshref-Javadi, M., Lee, S.: The customer-centric, multi-commodity vehicle routing problem with split delivery. Expert Systems with Applications 56, 335–348 (2016)
Ngueveu, S.U., Prins, C., Calvo, R.W.: An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Computers & Operations Research 37(11), 1877–1885 (2010)
Pillac, V., Hentenryck, P.V., Even, C.: A conflict-based path-generation heuristic for evacuation planning. Transportation Research Part B: Methodological 83, 136–150 (2016)
Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research 31(12), 1985–2002 (2004)
Prins, C.: Two memetic algorithms for heterogeneous fleet vehicle routing problems. Engineering Applications of Artificial Intelligence 22(6), 916–928 (2009)
Prins, C., Lacomme, P., Prodhon, C.: Order-first split-second methods for vehicle routing problems: A review. Transportation Research Part C: Emerging Technologies 40, 179–200 (2014)
Rivera, J.C., Afsar, H.M., Prins, C.: A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem. Computational Optimization and Applications 61(1), 159–187 (2015)
Rivera, J.C., Afsar, H.M., Prins, C.: Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem. European Journal of Operational Research 249(1), 93–104 (2016)
Silva, M.M., Subramanian, A., Vidal, T., Ochi, L.S.: A simple and effective metaheuristic for the minimum latency problem. European Journal of Operational Research 221(3), 513–520 (2012)
Thomas, A.S., Kopczak, L.R.: From logistics to supply chain management: the path forward in the humanitarian sector. Fritz Institute 15, 1–15 (2005)
Uchoa, E., Pecin, D., Pessoa, A., Poggi, M., Vidal, T., Subramanian, A.: New benchmark instances for the capacitated vehicle routing problem. European Journal of Operational Research 257(3), 845–858 (2017)
Victoria, J.F., Afsar, H.M., Prins, C.: Column generation based heuristic for the vehicle routing problem with time-dependent demand. IFAC-PapersOnLine 49(12), 526–531 (2016)
Vidal, T.: Technical note: Split algorithm in o (n) for the capacitated vehicle routing problem. Computers & Operations Research 69, 40–47 (2016)
Wolf, S., Merz, P.: Evolutionary local search for the super-peer selection problem and the p-hub median problem. In: Bartz-Beielstein, T., Blesa Aguilera, M.J., Blum, C., Naujoks, B., Roli, A., Rudolph, G., Sampels, M. (eds.) HM 2007. LNCS, vol. 4771, pp. 1–15. Springer, Heidelberg (2007). doi:10.1007/978-3-540-75514-2_1
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Victoria, J.F., Afsar, H.M., Prins, C. (2017). Metaheuristic Framework for a Disaster Logistics Problem with Time-Dependent Demands. In: Bektaş, T., Coniglio, S., Martinez-Sykora, A., Voß, S. (eds) Computational Logistics. ICCL 2017. Lecture Notes in Computer Science(), vol 10572. Springer, Cham. https://doi.org/10.1007/978-3-319-68496-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-68496-3_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-68495-6
Online ISBN: 978-3-319-68496-3
eBook Packages: Computer ScienceComputer Science (R0)