Skip to main content

2014 | OriginalPaper | Buchkapitel

An Iterated Local Search Platform for Transportation Logistics

verfasst von : Takwa Tlili, Saoussen Krichen

Erschienen in: Information Sciences and Systems 2014

Verlag: Springer International Publishing

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

search-config
loading …

Abstract

Recent technological advances in optimization and transportation have enabled the development of efficient tools that support the decision-making process of logistic managers. The aim of this paper is to present a decision support system (DSS) that integrates an Iterated Local Search (ILS) for solving the Vehicle Routing Problem (VRP). Its clear design allows an efficient exploration of the solution by the decision-maker. The computational experiments show that the ILS is very competitive in comparison to state-of-the-art algorithms.

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
1.
Zurück zum Zitat T.J. Ai, V. Kachitvichyanukul, Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem. Comput. Ind. Eng. 56, 380–387 (2009)CrossRef T.J. Ai, V. Kachitvichyanukul, Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem. Comput. Ind. Eng. 56, 380–387 (2009)CrossRef
2.
Zurück zum Zitat C. Alabas-Uslu, B. Dengiz, A self-adaptive local search algorithm for the classical vehicle routing problem. Expert Syst. Appl. 38, 8990–8998 (2011)CrossRef C. Alabas-Uslu, B. Dengiz, A self-adaptive local search algorithm for the classical vehicle routing problem. Expert Syst. Appl. 38, 8990–8998 (2011)CrossRef
3.
Zurück zum Zitat S. Almoustafa, S. Hanafi, N. Mladenovic, New exact method for large asymmetric distance-constrained vehicle routing problem. Eur. J. Oper. Res. 226, 386–394 (2013)CrossRefMATHMathSciNet S. Almoustafa, S. Hanafi, N. Mladenovic, New exact method for large asymmetric distance-constrained vehicle routing problem. Eur. J. Oper. Res. 226, 386–394 (2013)CrossRefMATHMathSciNet
4.
Zurück zum Zitat C. Archetti, N. Bianchessi, M.G. Speranza, Branch-and-cut algorithms for the split delivery vehicle routing problem. Eur. J. Oper. Res. 238, 685–698 (2014)CrossRefMathSciNet C. Archetti, N. Bianchessi, M.G. Speranza, Branch-and-cut algorithms for the split delivery vehicle routing problem. Eur. J. Oper. Res. 238, 685–698 (2014)CrossRefMathSciNet
5.
Zurück zum Zitat P. Augerat, Approche Polyhédrale du Problème de Tournées de Véhicules Ph.D. Dissertation, Institut Polytechnique de Grenoble (1995) P. Augerat, Approche Polyhédrale du Problème de Tournées de Véhicules Ph.D. Dissertation, Institut Polytechnique de Grenoble (1995)
6.
Zurück zum Zitat D. Cattaruzza, N. Absi, D. Feillet, T. Vidal, A memetic algorithm for the multi trip vehicle routing problem. Eur. J. Oper. Res. 236, 833–848 (2014)CrossRefMathSciNet D. Cattaruzza, N. Absi, D. Feillet, T. Vidal, A memetic algorithm for the multi trip vehicle routing problem. Eur. J. Oper. Res. 236, 833–848 (2014)CrossRefMathSciNet
7.
Zurück zum Zitat S. Dahl, U. Derigs, Cooperative planning in express carrier networks? an empirical study on the effectiveness of a real-time decision support system. Decis. Support Syst. 51, 620–626 (2011)CrossRef S. Dahl, U. Derigs, Cooperative planning in express carrier networks? an empirical study on the effectiveness of a real-time decision support system. Decis. Support Syst. 51, 620–626 (2011)CrossRef
8.
Zurück zum Zitat C. Erbao, L. Mingyong, Y. Hongming, Open vehicle routing problem with demand uncertainty and its robust strategies. Expert Syst. Appl. 41, 3569–3575 (2014)CrossRef C. Erbao, L. Mingyong, Y. Hongming, Open vehicle routing problem with demand uncertainty and its robust strategies. Expert Syst. Appl. 41, 3569–3575 (2014)CrossRef
9.
Zurück zum Zitat N. Ghaffari-Nasab, S.G. Ahari, M. Ghazanfari, A hybrid simulated annealing based heuristic for solving the location-routing problem with fuzzy demands. Sci. Iranica 20, 919–930 (2013) N. Ghaffari-Nasab, S.G. Ahari, M. Ghazanfari, A hybrid simulated annealing based heuristic for solving the location-routing problem with fuzzy demands. Sci. Iranica 20, 919–930 (2013)
10.
Zurück zum Zitat A. Grosso, A. Jamali, M. Locatelli, Finding maximin latin hypercube designs by iterated local search heuristics. Eur. J. Oper. Res. 197, 541–547 (2009)CrossRefMATH A. Grosso, A. Jamali, M. Locatelli, Finding maximin latin hypercube designs by iterated local search heuristics. Eur. J. Oper. Res. 197, 541–547 (2009)CrossRefMATH
11.
Zurück zum Zitat J. Lenstra, A. Kan, Complexity of vehicle routing and scheduling problems. Networks 11, 221–227 (1981)CrossRef J. Lenstra, A. Kan, Complexity of vehicle routing and scheduling problems. Networks 11, 221–227 (1981)CrossRef
12.
Zurück zum Zitat H. Lourenço, O. Martin, T. Stutzle, Iterated local search, Handbook of Metaheuristics of International Series in Operations Research & Management Science (Kluwer Academic, Dordrecht, 2003), pp. 321–353 H. Lourenço, O. Martin, T. Stutzle, Iterated local search, Handbook of Metaheuristics of International Series in Operations Research & Management Science (Kluwer Academic, Dordrecht, 2003), pp. 321–353
13.
Zurück zum Zitat R. Manzini, A top-down approach and a decision support system for the design and management of logistic networks. Transp. Res. Part E 48, 1185–1204 (2012)CrossRef R. Manzini, A top-down approach and a decision support system for the design and management of logistic networks. Transp. Res. Part E 48, 1185–1204 (2012)CrossRef
14.
Zurück zum Zitat Y. Marinakis, M. Marinaki, A bumble bees mating optimization algorithm for the open vehicle routing problem. Swarm Evol. Comput. 15, 80–94 (2014)CrossRef Y. Marinakis, M. Marinaki, A bumble bees mating optimization algorithm for the open vehicle routing problem. Swarm Evol. Comput. 15, 80–94 (2014)CrossRef
15.
Zurück zum Zitat Y. Marinakis, M. Marinaki, G. Dounias, A hybrid particle swarm optimization algorithm for the vehicle routing problem. Eng. Appl. Artif. Intell. 23, 463–472 (2010)CrossRef Y. Marinakis, M. Marinaki, G. Dounias, A hybrid particle swarm optimization algorithm for the vehicle routing problem. Eng. Appl. Artif. Intell. 23, 463–472 (2010)CrossRef
16.
Zurück zum Zitat J.E. Mendoza, A.L. Medaglia, N. Velasco, An evolutionary-based decision support system for vehicle routing: the case of a public utility. Decis. Support Syst. 46, 730–742 (2009)CrossRef J.E. Mendoza, A.L. Medaglia, N. Velasco, An evolutionary-based decision support system for vehicle routing: the case of a public utility. Decis. Support Syst. 46, 730–742 (2009)CrossRef
17.
Zurück zum Zitat S. MirHassani, N. Abolghasemi, A particle swarm optimization algorithm for open vehicle routing problem. Expert Syst. Appl. 38, 11547–11551 (2011)CrossRef S. MirHassani, N. Abolghasemi, A particle swarm optimization algorithm for open vehicle routing problem. Expert Syst. Appl. 38, 11547–11551 (2011)CrossRef
18.
Zurück zum Zitat P.C. Pop, O. Matei, C.P. Sitar, An improved hybrid algorithm for solving the generalized vehicle routing problem. Neurocomputing 109, 76–83 (2013)CrossRef P.C. Pop, O. Matei, C.P. Sitar, An improved hybrid algorithm for solving the generalized vehicle routing problem. Neurocomputing 109, 76–83 (2013)CrossRef
19.
Zurück zum Zitat W. Szeto, Y. Wu, S.C. Ho, An artificial bee colony algorithm for the capacitated vehicle routing problem. Eur. J. Oper. Res. 215, 126–135 (2011)CrossRef W. Szeto, Y. Wu, S.C. Ho, An artificial bee colony algorithm for the capacitated vehicle routing problem. Eur. J. Oper. Res. 215, 126–135 (2011)CrossRef
20.
Zurück zum Zitat A.S. Tasan, M. Gen, A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries. Comput. Ind. Eng. 62, 755–761 (2012)CrossRef A.S. Tasan, M. Gen, A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries. Comput. Ind. Eng. 62, 755–761 (2012)CrossRef
21.
Zurück zum Zitat W. Tu, Z. Fang, Q. Li, S.-L. Shaw, B. Chen, A bi-level voronoi diagram-based metaheuristic for a large-scale multi-depot vehicle routing problem. Transp. Res. Part E 61, 84–97 (2014)CrossRef W. Tu, Z. Fang, Q. Li, S.-L. Shaw, B. Chen, A bi-level voronoi diagram-based metaheuristic for a large-scale multi-depot vehicle routing problem. Transp. Res. Part E 61, 84–97 (2014)CrossRef
22.
Zurück zum Zitat J. Wy, B.-I. Kim, A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem. Comput. Oper. Res. 40, 1947–1952 (2013)CrossRef J. Wy, B.-I. Kim, A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem. Comput. Oper. Res. 40, 1947–1952 (2013)CrossRef
Metadaten
Titel
An Iterated Local Search Platform for Transportation Logistics
verfasst von
Takwa Tlili
Saoussen Krichen
Copyright-Jahr
2014
DOI
https://doi.org/10.1007/978-3-319-09465-6_9