Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Memetic Computing
Erschienen in: Memetic Computing 3/2018

22.04.2017 | Regular Research Paper

A co-evolutionary approach using information about future requests for dynamic vehicle routing problem with soft time windows

verfasst von: Mohamed Barkaoui

Erschienen in: Memetic Computing | Ausgabe 3/2018

Einloggen

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

search-config
loading …

Abstract

This paper presents a technique for integrating information about future customer requests to improve decision making for dynamic vehicle routing. We use a co-evolutionary approach to generate better waiting strategies such that the expected number of late-request customers who are served is maximized. An empirical evaluation of the proposed approach is performed within a previously reported hybrid genetic algorithm for the dynamic vehicle routing problem with time windows. Comparisons with other heuristic methods demonstrate the potential improvement that can be obtained through the application of the proposed approach.
Vorheriger Artikel Finding attractive technical patterns in cryptocurrency markets
Nächster Artikel A novel recommendation system in location-based social networks using distributed ELM

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!

Jetzt informieren

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!

Jetzt informieren

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!

Jetzt informieren
Literatur
1.
Barkaoui M, Gendreau M (2013) An adaptive evolutionary approach for real-time vehicle routing and dispatching. J Comput Oper Res 40(7):1766–1776MathSciNetCrossRefMATH
2.
Bent R, Van Hentenryck P (2004) Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Oper Res 52:977–987CrossRefMATH
3.
Bent R, Van Hentenryck P (2007) Waiting and relocation strategies in online stochastic vehicle routing. In: International joint conference on artificial intelligence, pp 1816–1821
4.
Branke J, Middendorf M, Noeth G, Dessouky M (2005) Waiting strategies for dynamic vehicle routing. Transp Sci INFORMS 39(3):298–312CrossRef
5.
Dondo R, Cerda J (2006) An MILP framework for dynamic vehicle routing problems with time windows. Lat Am Appl Res 36(4):255–261MATH
6.
Gendreau M, Guertin F, Potvin J-Y, Taillard ÉD (1999) Parallel tabu search for real-time vehicle routing and dispatching. Transp Sci 33(4):381–390CrossRefMATH
7.
Gendreau M, Jabali O, Rei W (2016) 50th anniversary invited article—future research directions in stochastic vehicle routing. Transp Sci 50(4):1163–1173CrossRef
8.
Ghiani G, Laporte G, Manni E, Musmanno R (2008) Waiting strategies for the dynamic and stochastic traveling salesman problem. Int J Oper Res 5:233–241MathSciNet
9.
Ghiani G, Manni E, Quaranta A, Triki C (2009) Anticipatory algorithms for same-day courier dispatching. Transp Res Part E 45:96–106CrossRef
10.
Herrera F, Lozano M, Verdegay JL (1998) Tackling real-coded genetic algorithms: operators and tools for behavioural analysis. Artif Intell Rev 12(4):265–319CrossRefMATH
11.
Hvattum LM, Løkketangen A, Laporte G (2006) Solving a dynamic and stochastic vehicle routing problem with a sample scenario hedging heuristic. Transp Sci 40(4):421–438CrossRef
12.
Ichoua S, Gendreau M, Potvin JY (2006) Exploiting knowledge about future demands for real-time vehicle dispatching. Transp Sci 40:211–225CrossRef
13.
Larsen A, Madsen O, Solomon MM (2002) Partially dynamic vehicle routing—models and algorithms. J Oper Res Soc 53:637–646CrossRefMATH
14.
Larsen A, Madsen OBG, Solomon MM (2004) The a priori dynamic traveling salesman problem with time windows. Transp Sci 38:459–472CrossRef
15.
Li H, Wang L, Hei X, Li W, Jiang Q (2017) A decomposition-based chemical reaction optimization for multi-objective vehicle routing problem for simultaneous delivery and pickup with time windows. Memet Comput. doi:10.​1007/​s12293-016-0222-1
16.
Meisel S (2011) Anticipatory optimization for dynamic decision making volume 51 of operations research/computer science interfaces series. Springer, New YorkCrossRef
17.
Mitrovic-Minic S, Krishnamurti R, Laporte G (2004) Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Transp Res Part B 38:669–685CrossRef
18.
Mitrovic-Minic S, Laporte G (2004) Waiting strategies for the dynamic pickup and delivery problem with time windows. Transp Res Part B 38:635–655CrossRef
19.
Pillac V, Gendreau M, Guéret C, Medaglia AL (2013) A review of dynamic vehicle routing problems. Eur J Oper Res 225(1):1–11MathSciNetCrossRefMATH
20.
Pureza V, Laporte G (2008) Waiting and buffering strategies for the dynamic pickup and delivery problem with time windows. INFOR 46:165–175
21.
Thomas BW (2007) Waiting strategies for anticipating service requests from known customer locations. Transp Sci 41(3):319–331CrossRef
22.
Tonda A, Lutton E, Squillero G (2012) A benchmark for cooperative coevolution. Memet Comput 4(4):263–277CrossRef
23.
Ulmer MW, Mattfeld DC, Köster F (2015a) Budgeting time for dynamic vehicle routing with stochastic customer requests, (Working paper)
24.
Ulmer MW, Mattfeld DC, Hennig M, Goodson JC (2015b) A rollout algorithm for vehicle routing with stochastic customer requests, logistics management, Mattfeld DC, Spengler TS, Brinkmann J, Grunewald M (Eds.), Lecture notes in logistics (LNL), Springer
25.
Van Hemert JI, La Poutré JA (2004) Dynamic routing with fruitful regions: models and evolutionary computation. Yao X, Burke E, Lozano JA, Smith J, Merelo-Guervos JJ, Bullinaria JA, Rowe J, Tino P, Kabaan A, Schwefel HP, (eds.) Parallel problem solving from nature VIII, Springer-Verlag, 690–699
26.
Wang J-Q, Tong X-N, Li Z-M (2007) An improved evolutionary algorithm for dynamic vehicle routing problem with time windows. Comput Sci ICCS 4490:1147–1154
27.
Yu X, Tang K, Chen T, Yao X (2009) Empirical analysis of evolutionary algorithms with immigrants schemes for dynamic optimization. Memet Comput 1(1):3–24CrossRef
Metadaten
Titel
A co-evolutionary approach using information about future requests for dynamic vehicle routing problem with soft time windows
verfasst von
Mohamed Barkaoui
Publikationsdatum
22.04.2017
Verlag
Springer Berlin Heidelberg
Erschienen in
Memetic Computing / Ausgabe 3/2018
Print ISSN: 1865-9284
Elektronische ISSN: 1865-9292
DOI
https://doi.org/10.1007/s12293-017-0231-8

Weitere Artikel der Ausgabe 3/2018

Memetic Computing 3/2018 Zur Ausgabe

Regular Research Paper

A novel recommendation system in location-based social networks using distributed ELM

Regular Research Paper

Finding attractive technical patterns in cryptocurrency markets

Regular Research Paper

Combining data augmentation, EDAs and grammatical evolution for blood glucose forecasting

Regular Research Paper

EB-GLS: an improved guided local search based on the big valley structure

Editorial

Editorial

Regular Research Paper

DICE: exploiting all bivariate dependencies in binary and multary search spaces