Skip to main content

Advertisement

SpringerLink
Log in

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

  • Regular Research Paper
  • Published:
Memetic Computing Aims and scope Submit manuscript

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.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Barkaoui M, Gendreau M (2013) An adaptive evolutionary approach for real-time vehicle routing and dispatching. J Comput Oper Res 40(7):1766–1776

    Article  MathSciNet  MATH  Google Scholar 

  2. Bent R, Van Hentenryck P (2004) Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Oper Res 52:977–987

    Article  MATH  Google Scholar 

  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–312

    Article  Google Scholar 

  5. Dondo R, Cerda J (2006) An MILP framework for dynamic vehicle routing problems with time windows. Lat Am Appl Res 36(4):255–261

    MATH  Google Scholar 

  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–390

    Article  MATH  Google Scholar 

  7. Gendreau M, Jabali O, Rei W (2016) 50th anniversary invited article—future research directions in stochastic vehicle routing. Transp Sci 50(4):1163–1173

    Article  Google Scholar 

  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–241

    MathSciNet  Google Scholar 

  9. Ghiani G, Manni E, Quaranta A, Triki C (2009) Anticipatory algorithms for same-day courier dispatching. Transp Res Part E 45:96–106

    Article  Google Scholar 

  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–319

    Article  MATH  Google Scholar 

  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–438

    Article  Google Scholar 

  12. Ichoua S, Gendreau M, Potvin JY (2006) Exploiting knowledge about future demands for real-time vehicle dispatching. Transp Sci 40:211–225

    Article  Google Scholar 

  13. Larsen A, Madsen O, Solomon MM (2002) Partially dynamic vehicle routing—models and algorithms. J Oper Res Soc 53:637–646

    Article  MATH  Google Scholar 

  14. Larsen A, Madsen OBG, Solomon MM (2004) The a priori dynamic traveling salesman problem with time windows. Transp Sci 38:459–472

    Article  Google Scholar 

  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 York

    Book  Google Scholar 

  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–685

    Article  Google Scholar 

  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–655

    Article  Google Scholar 

  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–11

    Article  MathSciNet  MATH  Google Scholar 

  20. Pureza V, Laporte G (2008) Waiting and buffering strategies for the dynamic pickup and delivery problem with time windows. INFOR 46:165–175

    Google Scholar 

  21. Thomas BW (2007) Waiting strategies for anticipating service requests from known customer locations. Transp Sci 41(3):319–331

    Article  Google Scholar 

  22. Tonda A, Lutton E, Squillero G (2012) A benchmark for cooperative coevolution. Memet Comput 4(4):263–277

    Article  Google Scholar 

  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

    Google Scholar 

  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–24

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département d’informatique et de génie logiciel, Université Laval 1065, av. de la Médecine, Québec, G1V 0A6, Canada

    Mohamed Barkaoui

Authors
  1. Mohamed Barkaoui
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohamed Barkaoui.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Barkaoui, M. A co-evolutionary approach using information about future requests for dynamic vehicle routing problem with soft time windows. Memetic Comp. 10, 307–319 (2018). https://doi.org/10.1007/s12293-017-0231-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12293-017-0231-8

Keywords

Search

Navigation