Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Temporally Adaptive Co-operation Schemes

  • Conference paper
  • First Online:
Advances on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC 2016)

Part of the book series: Lecture Notes on Data Engineering and Communications Technologies ((LNDECT,volume 1))

Abstract

Selecting an appropriate co-operation scheme in parallel evolutionary algorithms is an important task and it should be undertaken with care. In this paper, we introduce the temporally adaptive schemes, and apply them in our parallel memetic algorithm for solving the vehicle routing problem with time windows. The experimental results revealed that this approach allows for retrieving better solutions in much shorter time compared with other cooperation schemes. The analysis is backed up with the statistical tests, which gave the clear evidence that the results are important. We report one new world’s best solution to the benchmark problem obtained using our adaptive co-operation scheme.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Baldacci, A. Mingozzi, and R. Roberti. New route relaxation and pricing strategies for the vehicle routing problem. Operations Research, 59(5):1269–1283, 2011

    Google Scholar 

  2. R. Baldacci, A. Mingozzi, and R. Roberti. Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. European J. of Op. Research, 218(1):1 – 6, 2012

    Google Scholar 

  3. R. Banos, J. Ortega, C. Gil, A. L. Márquez, and F. de Toro. A hybrid meta-heuristic for multi-objective vehicle routing problems with time windows. Computers & Industrial Engineering, 65(2):286 – 296, 2013

    Google Scholar 

  4. M. Blocho and J. Nalepa. A parallel algorithm for minimizing the fleet size in the pickup and delivery problem with time windows. In Proc. EuroMPI, pages 15:1–15:2, New York, USA, 2015. ACM

    Google Scholar 

  5. O. Bräysy and M. Gendreau. Vehicle routing problem with time windows, part II: Metaheuristics. Transportation Science, 39(1):119–139, 2005

    Google Scholar 

  6. J. Caceres-Cruz, P. Arias, D. Guimarans, D. Riera, and A. A. Juan. Rich vehicle routing problem: Survey. ACM Computing Surveys, 47(2):32:1–32:28, 2014

    Google Scholar 

  7. D. Coltorti and A. E. Rizzoli. Ant colony optimization for real-world vehicle routing problems. SIGEVOlution, 2(2):2–9, 2007

    Google Scholar 

  8. N. A. El-Sherbeny. Vehicle routing with time windows: An overview of exact, heuristic and metaheuristic methods. J. of King Saud University, 22(3):123 – 131, 2010

    Google Scholar 

  9. W. Hu, H. Liang, C. Peng, B. Du, and Q. Hu. A hybrid chaos-particle swarm optimization algorithm for the vehicle routing problem with time window. Entropy, 15(4):1247–1270, 2013

    Google Scholar 

  10. B. Jarboui, A. Sifaleras, A. Rebai, M. Bruglieri, F. Pezzella, O. Pisacane, and S. Suraci. A variable neighborhood search branching for the electric vehicle routing problem with time windows. Electronic Notes in Discrete Mathematics, 47:221 – 228, 2015

    Google Scholar 

  11. Y. Nagata and O. Bräysy. A powerful route minimization heuristic for the vehicle routing problem with time windows. Operations Res. Letters, 37(5):333 – 338, 2009

    Google Scholar 

  12. Y. Nagata, O. Bräysy, and W. Dullaert. A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Computers & Operations Research, 37(4):724 – 737, 2010

    Google Scholar 

  13. Y. Nagata and S. Kobayashi. A Memetic Algorithm for Pickup and Delivery with Time Windows Using Selective Exchange Crossover, pages 536–545. Springer, 2010

    Google Scholar 

  14. J. Nalepa and M. Blocho. Co-operation in the parallel memetic algorithm. International Journal of Parallel Programming, 43(5):812–839, 2015

    Google Scholar 

  15. J. Nalepa and M. Blocho. A parallel algorithm with the search space partition for the pickup and delivery with time windows. In Proc. 3PGCIC, pages 92–99, 2015

    Google Scholar 

  16. J. Nalepa and M. Blocho. Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows. Soft Computing, 20(6):2309–2327, 2016

    Google Scholar 

  17. J. Nalepa and M. Kawulok. Adaptive memetic algorithm enhanced with data geometry analysis to select training data for SVMs. Neurocomputing, 185:113 – 132, 2016

    Google Scholar 

  18. S. U. Ngueveu, C. Prins, and R. W. Calvo. An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Computers & Operations Research, 37(11):1877 – 1885, 2010. Metaheuristics for Logistics and Vehicle Routing

    Google Scholar 

  19. E. Osaba, X.-S. Yang, F. Diaz, E. Onieva, A. D. Masegosa, and A. Perallos. A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy. Soft Computing, pages 1–14, 2016

    Google Scholar 

  20. K.-W. Pang. An adaptive parallel route construction heuristic for the vehicle routing problem with time windows. Exp. Sys. with App., 38(9):11939 – 11946, 2011

    Google Scholar 

  21. P. Repoussis, C. Tarantilis, and G. Ioannou. Arc-guided evolutionary algorithm for vehicle routing problem with time windows. Evol. Comp., IEEE Trans. on, 13(3):624–647, 2009

    Google Scholar 

  22. T. Vidal, T. G. Crainic, M. Gendreau, and C. Prins. A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Computers & Operations Research, 40(1):475 – 489, 2013

    Google Scholar 

  23. S. Wrona and M. Pawelczyk. Controllability-oriented placement of actuators for active noise-vibration control of rectangular plates using a memetic algorithm. Archives of Acoustics, 38(4):529–536, 2013

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, Silesian University of Technology, Akademicka 16, 44-100, Gliwice, Poland

    Jakub Nalepa & Miroslaw Blocho

Authors
  1. Jakub Nalepa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Miroslaw Blocho
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jakub Nalepa .

Editor information

Editors and Affiliations

  1. Campus Nord,Ed. Omega (Room 109), Technical University of Catalonia Campus Nord,Ed. Omega (Room 109), Barcelona, Spain

    Fatos Xhafa

  2. Fukuoka Institute of Technology , Fukuoka, Japan

    Leonard Barolli

  3. Federico II, UniversitĂ  degli Studi di Napoli Federico II, Napoli, Italy

    Flora Amato

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Nalepa, J., Blocho, M. (2017). Temporally Adaptive Co-operation Schemes. In: Xhafa, F., Barolli, L., Amato, F. (eds) Advances on P2P, Parallel, Grid, Cloud and Internet Computing. 3PGCIC 2016. Lecture Notes on Data Engineering and Communications Technologies, vol 1. Springer, Cham. https://doi.org/10.1007/978-3-319-49109-7_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-49109-7_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49108-0

  • Online ISBN: 978-3-319-49109-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation