Skip to main content
Springer Nature Link
Log in

Co-operation Schemes for the Parallel Memetic Algorithm

  • Conference paper
  • First Online:
Parallel Processing and Applied Mathematics (PPAM 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8384))

Abstract

This paper presents a study of co-operation schemes for the parallel memetic algorithm to solve the vehicle routing problem with time windows. In the parallel co-operative search algorithms the processes communicate to exchange the up-to-date solutions, which may guide the search and improve the results. The interactions between processes are defined by the content of the exchanged data, timing, connectivity and mode. We show how co-operation schemes influence the search convergence and solutions quality. The quality of a solution is defined as its proximity to the best, currently-known one. We present the experimental study for the well-known Gehring and Homberger’s benchmark. The new world’s best solutions obtained in the study confirm that the co-operation scheme has a strong impact on the quality of final solutions.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    We distinguish the process \(P_{1}\) as the master process.

  2. 2.

    More details can be found at: http://www.task.gda.pl/english/hpc

  3. 3.

    The best-known solutions of the GH tests are published at: http://www.sintef.no/Projectweb/TOP/VRPTW/Homberger-benchmark/; reference date: April 27, 2013.

  4. 4.

    These were: C1_4_8, C2_4_3, C2_4_4, C2_4_10, RC2_4_1, RC2_4_2, RC2_4_5, RC2_4_6.

References

  1. Blocho, M.: A parallel memetic algorithm for the vehicle routing problem with time windows. Ph.D. thesis, Silesian University of Technology (2013) (in Polish)

    Google Scholar 

  2. Blocho, M., Czech, Z.J.: An improved route minimization algorithm for the vehicle routing problem with time windows. Stud. Informatica 32(99), 5–19 (2010)

    Google Scholar 

  3. Blocho, M., Czech, Z.J.: A parallel EAX-based algorithm for minimizing the number of routes in the vehicle routing problem with time windows. In: Proceedings of the IEEE HPCC-ICESS, pp. 1239–1246 (2012)

    Google Scholar 

  4. Bräysy, O., Gendreau, M.: Vehicle routing problem with time windows, part I: route construction and local search algorithms. Trans. Sc. 39(1), 104–118 (2005)

    Article  Google Scholar 

  5. Kallehauge, B.: Formulations and exact algorithms for the vehicle routing problem with time windows. Comput. Oper. Res. 35(7), 2307–2330 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  6. Mester, D., Bräysy, O.: Active guided evolution strategies for large-scale vehicle routing problems with time windows. Comput. Oper. Res. 32(6), 1593–1614 (2005)

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  8. Nagata, Y., Bräysy, O., Dullaert, W.: A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Comput. Oper. Res. 37(4), 724–737 (2010)

    Article  MATH  Google Scholar 

  9. Nalepa, J., Czech, Z.J.: A parallel heuristic algorithm to solve the vehicle routing problem with time windows. Stud. Informatica 33(1), 91–106 (2012)

    Google Scholar 

  10. Nalepa, J., Czech, Z.J.: New selection schemes in a memetic algorithm for the vehicle routing problem with time windows. In: Tomassini, M., Antonioni, A., Daolio, F., Buesser, P. (eds.) ICANNGA 2013. LNCS, vol. 7824, pp. 396–405. Springer, Heidelberg (2013)

    Google Scholar 

  11. Russell, R.: Hybrid heuristics for the vehicle routing problem with time windows. Trans. Sc. 29(2), 156 (1995)

    Article  MATH  Google Scholar 

  12. Thompson, P.M., Psaraftis, H.N.: Cyclic transfer algorithms for multivehicle routing and scheduling problems. Oper. Res. 41(5), 935–946 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  13. Ursani, Z., Essam, D., Cornforth, D., Stocker, R.: Localized genetic algorithm for VRPTW. Appl. Soft Comput. 11(8), 5375–5390 (2011)

    Article  Google Scholar 

  14. Zhong, Y., Pan, X.: A hybrid optimization solution to VRPTW based on simulated annealing. In: Proceedings of the IEEE ICAL, pp. 3113–3117 (2007)

    Google Scholar 

Download references

Acknowledgments

We thank the following computing centers where the computations of our project were carried out: Academic Computer Centre in Gdańsk TASK, Academic Computer Centre CYFRONET AGH, Kraków, Interdisciplinary Centre for Mathematical and Computational Modeling, Warsaw University, Wrocław Centre for Networking and Supercomputing.

Author information

Authors and Affiliations

  1. Silesian University of Technology, Gliwice, Poland

    Jakub Nalepa, Miroslaw Blocho & Zbigniew J. Czech

  2. ABB ISDC, Krakow, Poland

    Miroslaw Blocho

  3. University of Silesia, Sosnowiec, Poland

    Zbigniew J. Czech

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

  3. Zbigniew J. Czech
    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. Institute of Computer and Information Science, Czestochowa University of Technology, Czestochowa, Poland

    Roman Wyrzykowski

  2. University of Tennessee, Department of Computer Science, Knoxville, Tennessee, USA

    Jack Dongarra

  3. Institute of Computer and Information Science, Czestochowa University of Technology, Czestochowa, Poland

    Konrad Karczewski

  4. Technical University of Denmark Informatics and Mathematical Modelling, Kongens Lyngby, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nalepa, J., Blocho, M., Czech, Z.J. (2014). Co-operation Schemes for the Parallel Memetic Algorithm. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2013. Lecture Notes in Computer Science(), vol 8384. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55224-3_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-55224-3_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-55223-6

  • Online ISBN: 978-3-642-55224-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics