Skip to main content

2019 | OriginalPaper | Buchkapitel

CVRPTW Model for Cargo Collection with Heterogeneous Capacity-Fleet

verfasst von : Jorge Ivan Romero-Gelvez, William Camilo Gonzales-Cogua, Jorge Aurelio Herrera-Cuartas

Erschienen in: Applied Informatics

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
3.
Zurück zum Zitat 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) 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)
4.
Zurück zum Zitat 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 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
5.
Zurück zum Zitat 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)MathSciNetCrossRef 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)MathSciNetCrossRef
6.
Zurück zum Zitat 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) 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)
7.
Zurück zum Zitat 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) 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)
8.
Zurück zum Zitat 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)MathSciNetCrossRef 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)MathSciNetCrossRef
9.
Zurück zum Zitat Christofides, N., Mingozzi, A., Toth, P.: State-space relaxation procedures for the computation of bounds to routing problems. Networks 11(2), 145–164 (1981)MathSciNetCrossRef Christofides, N., Mingozzi, A., Toth, P.: State-space relaxation procedures for the computation of bounds to routing problems. Networks 11(2), 145–164 (1981)MathSciNetCrossRef
10.
Zurück zum Zitat 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)CrossRef 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)CrossRef
12.
Zurück zum Zitat 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) 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)
14.
Zurück zum Zitat 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)MathSciNetCrossRef 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)MathSciNetCrossRef
15.
Zurück zum Zitat Gendreau, M., Hertz, A., Laporte, G.: A tabu search heuristic for the vehicle routing problem. Manag. Sci. 40(10), 1276–1290 (1994)CrossRef Gendreau, M., Hertz, A., Laporte, G.: A tabu search heuristic for the vehicle routing problem. Manag. Sci. 40(10), 1276–1290 (1994)CrossRef
16.
Zurück zum Zitat Ghiani, G., Laporte, G., Musmanno, R.: Introduction to Logistics Systems Planning and Control. John Wiley & Sons, Hoboken (2004) Ghiani, G., Laporte, G., Musmanno, R.: Introduction to Logistics Systems Planning and Control. John Wiley & Sons, Hoboken (2004)
17.
Zurück zum Zitat 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)CrossRef 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)CrossRef
19.
Zurück zum Zitat Laporte, G., Desrochers, M., Nobert, Y.: Two exact algorithms for the distance-constrained vehicle routing problem. Networks 14(1), 161–172 (1984)CrossRef Laporte, G., Desrochers, M., Nobert, Y.: Two exact algorithms for the distance-constrained vehicle routing problem. Networks 14(1), 161–172 (1984)CrossRef
20.
Zurück zum Zitat Laporte, G., Toth, P., Vigo, D.: Vehicle routing: historical perspective and recent contributions (2013)CrossRef Laporte, G., Toth, P., Vigo, D.: Vehicle routing: historical perspective and recent contributions (2013)CrossRef
21.
Zurück zum Zitat Lenis, S., Rivera, J.: A metaheuristic approach for the cumulative capacitated arc routing problem. Commun. Comput. Inf. Sci. 916, 96–107 (2018) Lenis, S., Rivera, J.: A metaheuristic approach for the cumulative capacitated arc routing problem. Commun. Comput. Inf. Sci. 916, 96–107 (2018)
22.
Zurück zum Zitat 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) 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)
23.
Zurück zum Zitat Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8), 2403–2435 (2007)MathSciNetCrossRef Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8), 2403–2435 (2007)MathSciNetCrossRef
24.
Zurück zum Zitat 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)CrossRef 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)CrossRef
25.
Zurück zum Zitat 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)MathSciNetCrossRef 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)MathSciNetCrossRef
26.
Zurück zum Zitat 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) 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)
27.
Zurück zum Zitat 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)CrossRef 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)CrossRef
28.
Zurück zum Zitat Taillard, É.: Parallel iterative search methods for vehicle routing problems. Networks 23(8), 661–673 (1993)CrossRef Taillard, É.: Parallel iterative search methods for vehicle routing problems. Networks 23(8), 661–673 (1993)CrossRef
29.
Zurück zum Zitat 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)CrossRef 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)CrossRef
30.
Zurück zum Zitat Toth, P., Vigo, D.: Models, relaxations and exact approaches for the capacitated vehicle routing problem. Dis. Appl. Math. 123(1–3), 487–512 (2002)MathSciNetCrossRef Toth, P., Vigo, D.: Models, relaxations and exact approaches for the capacitated vehicle routing problem. Dis. Appl. Math. 123(1–3), 487–512 (2002)MathSciNetCrossRef
31.
Zurück zum Zitat Toth, P., Vigo, D.: The Vehicle Routing Problem. SIAM, Philadelphia (2002)CrossRef Toth, P., Vigo, D.: The Vehicle Routing Problem. SIAM, Philadelphia (2002)CrossRef
32.
Zurück zum Zitat Toth, P., Vigo, D.: The granular tabu search and its application to the vehicle-routing problem. Informs J. Comput. 15(4), 333–346 (2003)MathSciNetCrossRef Toth, P., Vigo, D.: The granular tabu search and its application to the vehicle-routing problem. Informs J. Comput. 15(4), 333–346 (2003)MathSciNetCrossRef
33.
Zurück zum Zitat Toth, P., Vigo, D.: Vehicle Routing: Problems, Methods, and Applications. SIAM, Philadelphia (2014)CrossRef Toth, P., Vigo, D.: Vehicle Routing: Problems, Methods, and Applications. SIAM, Philadelphia (2014)CrossRef
Metadaten
Titel
CVRPTW Model for Cargo Collection with Heterogeneous Capacity-Fleet
verfasst von
Jorge Ivan Romero-Gelvez
William Camilo Gonzales-Cogua
Jorge Aurelio Herrera-Cuartas
Copyright-Jahr
2019
DOI
https://doi.org/10.1007/978-3-030-32475-9_13

Premium Partner