Skip to main content

2016 | OriginalPaper | Buchkapitel

A Decision Support System Based on Hybrid Metaheuristic for Solving the Constrained Capacitated Vehicle Routing Problem: The Tunisian Case

verfasst von : Marwa Harzi, Saoussen Krichen

Erschienen in: Artificial Intelligence and Soft Computing

Verlag: Springer International Publishing

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

search-config
loading …

Abstract

Various metaheuristic approaches have emerged in recent years to solve the capacitated vehicle routing problem (CVRP), a well-known \(\mathcal {NP}-\) hard problem in routing. In CVRP, the objective is to design the route set at a lower cost for a homogenous fleet of vehicles, starting from and going back to the depot, to meet the needs and expectations of all the customers. In this paper, we propose an ILS-VND approach which is a hybrid of Iterated Local Search (ILS) and Variable Neighborhood Descent (VND) approaches. Although both ILS and VND approaches, independently provide good solutions, we found that the hybrid approach gives better solutions than either approach independently. We demonstrate the effectiveness of our approach through experiments carried out on widely used benchmark instances. Numerical experiments show that the proposed method outperforms other local searches and metaheuristics. We also, propose a Decision Support System (DSS) that integrates a Geographical Information System (GIS) to solve the problem under scrutiny. In order to demonstrate the performance of the proposed DSS in terms of solution quality, we apply it for a real case on the city of Jendouba in the north west of Tunisia. The results are then highlighted in a cartographic format using Google Maps.

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
2.
Zurück zum Zitat Alba, E., Dorronsoro, B.: Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm. Inform. Process. Lett. 6, 225–230 (2006)MathSciNetCrossRefMATH Alba, E., Dorronsoro, B.: Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm. Inform. Process. Lett. 6, 225–230 (2006)MathSciNetCrossRefMATH
3.
Zurück zum Zitat Roberto, B., Aristide, M., Roberto, R.: Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. Eur. J. Oper. Res. 218, 1–6 (2012)MathSciNetCrossRefMATH Roberto, B., Aristide, M., Roberto, R.: Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. Eur. J. Oper. Res. 218, 1–6 (2012)MathSciNetCrossRefMATH
4.
Zurück zum Zitat Claudio, C., Rafael, M.: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discrete Optim. 12, 129–146 (2014)MathSciNetCrossRefMATH Claudio, C., Rafael, M.: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discrete Optim. 12, 129–146 (2014)MathSciNetCrossRefMATH
5.
Zurück zum Zitat Juan, C.R., Afsar, H.M., Christian, P.: Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem. Eur. J. Oper. Res. 249, 93–104 (2016)MathSciNetCrossRef Juan, C.R., Afsar, H.M., Christian, P.: Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem. Eur. J. Oper. Res. 249, 93–104 (2016)MathSciNetCrossRef
6.
Zurück zum Zitat Leonardo, J., Reinaldo, M.: Heuristic algorithms for a three-dimensional loading capacitated vehicle routing problem in a carrier. Comput. Indus. Eng. 88, 110–130 (2015)CrossRef Leonardo, J., Reinaldo, M.: Heuristic algorithms for a three-dimensional loading capacitated vehicle routing problem in a carrier. Comput. Indus. Eng. 88, 110–130 (2015)CrossRef
7.
Zurück zum Zitat Thibaut, V., Teodor, G.C., Michel, G., Christian, P.: Heuristics for multi-attribute vehicle routing problems: a survey and synthesis. Eur. J. Oper. Res. 231, 1–21 (2013)MathSciNetCrossRefMATH Thibaut, V., Teodor, G.C., Michel, G., Christian, P.: Heuristics for multi-attribute vehicle routing problems: a survey and synthesis. Eur. J. Oper. Res. 231, 1–21 (2013)MathSciNetCrossRefMATH
8.
Zurück zum Zitat Augerat, P., Belenguer, J.M., Benavent, E., Corbern, A., Naddef, D.: Separating capacity constraints in the CVRP using tabu search. Eur. J. Oper. Res. 106, 546–557 (1998)CrossRefMATH Augerat, P., Belenguer, J.M., Benavent, E., Corbern, A., Naddef, D.: Separating capacity constraints in the CVRP using tabu search. Eur. J. Oper. Res. 106, 546–557 (1998)CrossRefMATH
9.
Zurück zum Zitat Yi, T., Fan, W.: An effective tabu search approach with improved loading algorithms for the 3L-CVRP. Comput. Oper. Res. 55, 127–140 (2015)MathSciNetCrossRef Yi, T., Fan, W.: An effective tabu search approach with improved loading algorithms for the 3L-CVRP. Comput. Oper. Res. 55, 127–140 (2015)MathSciNetCrossRef
10.
Zurück zum Zitat Lijun, W., Zhenzhen, Z., Defu, Z., Andrew, L.: A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints. Eur. J. Oper. Res. 243, 798–814 (2015)CrossRef Lijun, W., Zhenzhen, Z., Defu, Z., Andrew, L.: A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints. Eur. J. Oper. Res. 243, 798–814 (2015)CrossRef
11.
Zurück zum Zitat Diego, C., Nabil, A., Dominique, F., Daniele, V.: An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows. Comput. Oper. Res. 51, 257–267 (2014) Diego, C., Nabil, A., Dominique, F., Daniele, V.: An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows. Comput. Oper. Res. 51, 257–267 (2014)
12.
Zurück zum Zitat Sandra, U.N., Christian, P., Roberto, W.C.: An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 37, 1877–1885 (2010)MathSciNetCrossRefMATH Sandra, U.N., Christian, P., Roberto, W.C.: An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 37, 1877–1885 (2010)MathSciNetCrossRefMATH
13.
Zurück zum Zitat Silvia, M., Irene, L.: An ant colony algorithm for the capacitated vehicle routing. Electron. Disc. Math. 18, 181–186 (2014)MathSciNetMATH Silvia, M., Irene, L.: An ant colony algorithm for the capacitated vehicle routing. Electron. Disc. Math. 18, 181–186 (2014)MathSciNetMATH
14.
Zurück zum Zitat Lourenco, H.R., Martin, O., Stutzle, T.: Iterated Local Search. Kluwer Academic Publishers, Norwell, pp. 321–353 (2002) Lourenco, H.R., Martin, O., Stutzle, T.: Iterated Local Search. Kluwer Academic Publishers, Norwell, pp. 321–353 (2002)
15.
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, 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, 568–581 (1964)CrossRef
16.
Zurück zum Zitat Li, F., Golden, B.L., Wasil, E.A.: Very large-scale vehicle routing: new test problems. Comput. Oper. Res. 32, 1165–1179 (2005)CrossRefMATH Li, F., Golden, B.L., Wasil, E.A.: Very large-scale vehicle routing: new test problems. Comput. Oper. Res. 32, 1165–1179 (2005)CrossRefMATH
17.
18.
Zurück zum Zitat Groer, C., Golden, B.L., Wasil, E.A.: A parallel algorithm for the vehicle routing problems. INFORMS J. Comput. 23, 315–330 (2011)MathSciNetCrossRefMATH Groer, C., Golden, B.L., Wasil, E.A.: A parallel algorithm for the vehicle routing problems. INFORMS J. Comput. 23, 315–330 (2011)MathSciNetCrossRefMATH
Metadaten
Titel
A Decision Support System Based on Hybrid Metaheuristic for Solving the Constrained Capacitated Vehicle Routing Problem: The Tunisian Case
verfasst von
Marwa Harzi
Saoussen Krichen
Copyright-Jahr
2016
DOI
https://doi.org/10.1007/978-3-319-39378-0_59

Premium Partner