Skip to main content
SpringerLink
Log in

Impact of Parallel Memetic Algorithm Parameters on Its Efficacy

  • Conference paper
Beyond Databases, Architectures and Structures (BDAS 2015)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 521))

  • 1522 Accesses

Abstract

The vehicle routing problem with time windows (VRPTW) is an NP-hard discrete optimization problem with two objectives—to minimize a number of vehicles serving a set of dispersed customers, and to minimize the total travel distance. Since real-life, commercially-available road network and address databases are very large and complex, approximate methods to tackle the VRPTW became a main stream of development. In this paper, we investigate the impact of selecting two crucial parameters of our parallel memetic algorithm—the population size and the number of children generated for each pair of parents—on its efficacy. Our experimental study performed on selected benchmark problems indicates that the improper selection of the parameters can easily jeopardize the search. We show that larger populations converge to high-quality solutions in a smaller number of consecutive generations, and creating more children helps exploit parents as best as possible.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Baldacci, R., Mingozzi, A., Roberti, R.: Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. European Journal of Operational Research 218(1), 1–6 (2012)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  3. Benlic, U., Hao, J.K.: Memetic search for the quadratic assignment problem. Expert Systems with Applications 42(1), 584–595 (2015)

    Article  Google Scholar 

  4. Blocho, M., Czech, Z.J.: A parallel memetic algorithm for the vehicle routing problem with time windows. In: Proceedings of the 2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, 3PGCIC 2013, pp. 144–151 (2013)

    Google Scholar 

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

    Article  Google Scholar 

  6. Chiang, W.C., Russell, R.A.: Simulated annealing metaheuristics for the vehicle routing problem with time windows. Annals of Operations Research 63(1), 3–27 (1996)

    Article  MATH  Google Scholar 

  7. Eiben, A.E., Hinterding, R., Michalewicz, Z.: Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation 3(2), 124–141 (1999)

    Article  Google Scholar 

  8. Ho, S.C., Haugland, D.: A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Computers & Operations Research 31(12), 1947–1964 (2004)

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  10. Irnich, S., Villeneuve, D.: The shortest-path problem with resource constraints and k-cycle elimination for k ≤ 3. INFORMS Journal on Computing 18(3), 391–406 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  11. Jin, Y., Hao, J.K., Hamiez, J.P.: A memetic algorithm for the minimum sum coloring problem. Computers & Operations Research 43, 318–327 (2014)

    Article  MathSciNet  Google Scholar 

  12. Kawulok, M., Nalepa, J.: Support vector machines training data selection using a genetic algorithm. In: Gimel’farb, G., Hancock, E., Imiya, A., Kuijper, A., Kudo, M., Omachi, S., Windeatt, T., Yamada, K. (eds.) SSPR & SPR 2012. LNCS, vol. 7626, pp. 557–565. Springer, Heidelberg (2012), http://dx.doi.org/10.1007/978-3-642-34166-3_61

  13. Li, Y., Li, P., Wu, B., Jiao, L., Shang, R.: Kernel clustering using a hybrid memetic algorithm. Natural Computing 12(4), 605–615 (2013)

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  16. Nalepa, J., Blocho, M.: Co-operation in the parallel memetic algorithm. International Journal of Parallel Programming, 1–28 (2014), http://dx.doi.org/10.1007/s10766-014-0343-4

  17. Nalepa, J., Blocho, M., Czech, Z.J.: Co-operation schemes for the parallel memetic algorithm. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Waśniewski, J. (eds.) PPAM 2013, Part I. LNCS, vol. 8384, pp. 191–201. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  18. 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), http://dx.doi.org/10.1007/978-3-642-37213-1_41

    Chapter  Google Scholar 

  19. Nalepa, J., Kawulok, M.: Fast and accurate hand shape classification. In: Kozielski, S., Mrozek, D., Kasprowski, P., Małysiak-Mrozek, B. z. (eds.) BDAS 2014. CCIS, vol. 424, pp. 364–373. Springer, Heidelberg (2014), http://dx.doi.org/10.1007/978-3-319-06932-6_35

    Chapter  Google Scholar 

  20. Nalepa, J., Kawulok, M.: A memetic algorithm to select training data for support vector machines. In: Proceedings of the 2014 Conference on Genetic and Evolutionary Computation, GECCO 2014, pp. 573–580. ACM, New York (2014)

    Chapter  Google Scholar 

  21. Pang, K.W.: An adaptive parallel route construction heuristic for the vehicle routing problem with time windows constraints. Expert Systems with Applications 38(9), 11939–11946 (2011)

    Article  Google Scholar 

  22. Repoussis, P.P., Tarantilis, C.D., Ioannou, G.: Arc-guided evolutionary algorithm for the vehicle routing problem with time windows. IEEE Transactions on Evolutionary Computation 13(3), 624–647 (2009)

    Article  Google Scholar 

  23. Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: 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)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, Silesian University of Technology, Gliwice, Poland

    Miroslaw Blocho & Jakub Nalepa

  2. ABB ISDC, Krakow, Poland

    Miroslaw Blocho

  3. Future Processing, Gliwice, Poland

    Jakub Nalepa

Authors
  1. Miroslaw Blocho
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jakub Nalepa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Miroslaw Blocho .

Editor information

Editors and Affiliations

  1. Silesian University of Technology, Gliwice, Poland

    Stanisław Kozielski

  2. Silesian University of Technology, Gliwice, Poland

    Dariusz Mrozek

  3. Silesian University of Technology, Gliwice, Poland

    Paweł Kasprowski

  4. Silesian University of Technology, Gliwice, Poland

    Bożena Małysiak-Mrozek

  5. Silesian University of Technology, Gliwice,, Poland

    Daniel Kostrzewa

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Blocho, M., Nalepa, J. (2015). Impact of Parallel Memetic Algorithm Parameters on Its Efficacy. In: Kozielski, S., Mrozek, D., Kasprowski, P., Małysiak-Mrozek, B., Kostrzewa, D. (eds) Beyond Databases, Architectures and Structures. BDAS 2015. Communications in Computer and Information Science, vol 521. Springer, Cham. https://doi.org/10.1007/978-3-319-18422-7_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-18422-7_27

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation