Skip to main content

CVRPTW Model for Cargo Collection with Heterogeneous Capacity-Fleet

  • Conference paper
  • First Online:
Applied Informatics (ICAI 2019)

Abstract

This work shows the application of the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) to collect different cargo-demand in several locations with low time disponibility to attend any vehicle. The objective of the model is to reduce the routing time in a problem with mixed vehicle-fleet. The initial step is the creation of a distance matrix by using the Google Maps API, then cargo capacities for every vehicle and time-windows for every demand point are included in the model. The problem is solved with Google-OR tools using as firt solution aproximated algoritm and as second solution one metaheuristic algorithm for local search.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Clients map - google’s maps api. https://drive.google.com/open?id=1_MxV75hs_qlFENsXIhh0HJDYZkcu7pJ-&usp=sharing

  2. Google’s or-tools. https://developers.google.com/optimization/

  3. Aguirre-Gonzalez, E., Villegas, J.: A two-phase heuristic for the collection of waste animal tissue in a colombian rendering company. Commun. Comput. Inf. Sci. 742, 511–521 (2017)

    Google Scholar 

  4. Arenas, I.G.P., Sánchez, A.G., Armando, C., Solano, L., Medina, L.B.R.: Cvrptw model applied to the collection of food donations

    Google Scholar 

  5. Baldacci, R., Christofides, N., Mingozzi, A.: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Program. 115(2), 351–385 (2008)

    Article  MathSciNet  Google Scholar 

  6. Bernal, J., Escobar, J., Paz, J., Linfati, R., Gatica, G.: A probabilistic granular tabu search for the distance constrained capacitated vehicle routing problem. Int. J. Ind. Syst. Eng. 29(4), 453–477 (2018)

    Google Scholar 

  7. Carrillo, M., Felipe, A.: Modelo de ruteo de vehículos para la distribución de las empresas laboratorios veterland, Laboratorios Callbest y Cosméticos Marlioü París. B.S. thesis, Facultad de Ingeniería (2014)

    Google Scholar 

  8. Christofides, N., Mingozzi, A., Toth, P.: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math. Program. 20(1), 255–282 (1981)

    Article  MathSciNet  Google Scholar 

  9. Christofides, N., Mingozzi, A., Toth, P.: State-space relaxation procedures for the computation of bounds to routing problems. Networks 11(2), 145–164 (1981)

    Article  MathSciNet  Google Scholar 

  10. Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4), 568–581 (1964)

    Article  Google Scholar 

  11. Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6(1), 80–91 (1959)

    Article  MathSciNet  Google Scholar 

  12. Escobar-Falcon, L., Alvarez-Martinez, D., Granada-Echeverri, M., Willmer-Escobar, J., Romero-Lazaro, R.: A matheuristic algorithm for the three-dimensional loading capacitated vehicle routing problem (3l-cvrp). Rev. Fac. de Ing. 2016(78), 9–20 (2016)

    Google Scholar 

  13. Flood, M.M.: The traveling-salesman problem. Oper. Res. 4(1), 61–75 (1956)

    Article  MathSciNet  Google Scholar 

  14. Fukasawa, R., Longo, H., Lysgaard, J., de Aragão, M.P., Reis, M., Uchoa, E., Werneck, R.F.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Program. 106(3), 491–511 (2006)

    Article  MathSciNet  Google Scholar 

  15. Gendreau, M., Hertz, A., Laporte, G.: A tabu search heuristic for the vehicle routing problem. Manag. Sci. 40(10), 1276–1290 (1994)

    Article  Google Scholar 

  16. Ghiani, G., Laporte, G., Musmanno, R.: Introduction to Logistics Systems Planning and Control. John Wiley & Sons, Hoboken (2004)

    Google Scholar 

  17. Herazo-Padilla, N., Montoya-Torres, J., Nieto Isaza, S., Alvarado-Valencia, J.: Simulation-optimization approach for the stochastic location-routing problem. J. Simul. 9(4), 296–311 (2015)

    Article  Google Scholar 

  18. Jacobo-Cabrera, M., Caballero-Morales, S.-O., Martínez-Flores, J.-L., Cano-Olivos, P.: Decision model for the pharmaceutical distribution of insulin. In: Florez, H., Diaz, C., Chavarriaga, J. (eds.) ICAI 2018. CCIS, vol. 942, pp. 75–89. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-01535-0_6

    Chapter  Google Scholar 

  19. Laporte, G., Desrochers, M., Nobert, Y.: Two exact algorithms for the distance-constrained vehicle routing problem. Networks 14(1), 161–172 (1984)

    Article  Google Scholar 

  20. Laporte, G., Toth, P., Vigo, D.: Vehicle routing: historical perspective and recent contributions (2013)

    Article  Google Scholar 

  21. Lenis, S., Rivera, J.: A metaheuristic approach for the cumulative capacitated arc routing problem. Commun. Comput. Inf. Sci. 916, 96–107 (2018)

    Google Scholar 

  22. Lopez-Santana, E., Mendez-Giraldo, G., Franco-Franco, C.: A hybrid scatter search algorithm to solve the capacitated arc routing problem with refill points. Lect. Notes Comput. Sci. (including Subseries Lect. Notes Artif. Intell. Lect. Notes Bioinform.) 9772, 3–15 (2016)

    Google Scholar 

  23. Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8), 2403–2435 (2007)

    Article  MathSciNet  Google Scholar 

  24. Quintero-Araujo, C., Bernaus, A., Juan, A., Travesset-Baro, O., Jozefowiez, N.: Planning freight delivery routes in mountainous regions. Lect. Notes Bus. Inf. Process. 254, 123–132 (2016)

    Article  Google Scholar 

  25. Rivera, J., Murat Afsar, H., 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)

    Article  MathSciNet  Google Scholar 

  26. Santana, L., Ramiro, E., Carvajal, J.D.J.: A hybrid column generation and clustering approach to the school bus routing problem with time windows. Ingeniería 20(1), 101–117 (2015)

    Google Scholar 

  27. Solano-Charris, E., Prins, C., Santos, A.: Local search based metaheuristics for the robust vehicle routing problem with discrete scenarios. Appl. Soft Comput. J. 32, 518–531 (2015)

    Article  Google Scholar 

  28. Taillard, É.: Parallel iterative search methods for vehicle routing problems. Networks 23(8), 661–673 (1993)

    Article  Google Scholar 

  29. Toro, E., Franco, J., Echeverri, M., Guimaraes, F.: A multi-objective model for the green capacitated location-routing problem considering environmental impact. Comput. Ind. Eng. 110, 114–125 (2017)

    Article  Google Scholar 

  30. Toth, P., Vigo, D.: Models, relaxations and exact approaches for the capacitated vehicle routing problem. Dis. Appl. Math. 123(1–3), 487–512 (2002)

    Article  MathSciNet  Google Scholar 

  31. Toth, P., Vigo, D.: The Vehicle Routing Problem. SIAM, Philadelphia (2002)

    Book  Google Scholar 

  32. Toth, P., Vigo, D.: The granular tabu search and its application to the vehicle-routing problem. Informs J. Comput. 15(4), 333–346 (2003)

    Article  MathSciNet  Google Scholar 

  33. Toth, P., Vigo, D.: Vehicle Routing: Problems, Methods, and Applications. SIAM, Philadelphia (2014)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jorge Ivan Romero-Gelvez .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Romero-Gelvez, J.I., Gonzales-Cogua, W.C., Herrera-Cuartas, J.A. (2019). CVRPTW Model for Cargo Collection with Heterogeneous Capacity-Fleet. In: Florez, H., Leon, M., Diaz-Nafria, J., Belli, S. (eds) Applied Informatics. ICAI 2019. Communications in Computer and Information Science, vol 1051. Springer, Cham. https://doi.org/10.1007/978-3-030-32475-9_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-32475-9_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-32474-2

  • Online ISBN: 978-3-030-32475-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics