Skip to main content
SpringerLink
Log in
Book cover

International Conference on Parallel Processing and Applied Mathematics

PPAM 2013: Parallel Processing and Applied Mathematics pp 207–214Cite as

Multi-GPU Parallel Memetic Algorithm for Capacitated Vehicle Routing Problem

  • Conference paper
  • First Online:

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

Abstract

The goal of this paper is to propose and test a new memetic algorithm for the capacitated vehicle routing problem in parallel computing environment. In this paper we consider a simple variation of the vehicle routing problem in which the only parameter is the capacity of the vehicle and each client only needs one package. We analyze the efficiency of the algorithm using the hierarchical Parallel Random Access Machine (PRAM) model and run experiments with code written in CUDA.

The work was supported by the OPUS grant DEC-2012/05/B/ST7/00102 of Polish National Centre of Science.

This is a preview of subscription content, 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 EPUB and 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

Learn about institutional subscriptions

References

  1. Bandelt, H., Crama, Y., Spieksma, F.: Approximation algorithms for multi-dimensional assignment problems with decomposable costs. Discrete Appl. Math. 49, 25–40 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bożejko, W., Uchroński, M., Wodecki, M.: The new golf neighborhood for the flexible job shop problem, Proceedings of the ICCS 2010. Procedia Computer Science 1, 289–296 (2010)

    Article  Google Scholar 

  3. Bożejko, W., Wodecki, M.: On the theoretical properties of swap multimoves. Oper. Res. Lett. 35(2), 227–231 (2007). (Elsevier Science Ltd.)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bożejko, W., Wodecki, M.: Parallel genetic algorithm for minimizing total weighted completion time. In: Rutkowski, L., Siekmann, J., Tadeusiewicz, R., Zadeh, L.A. (eds.) ICAISC 2004. LNCS (LNAI), vol. 3070, pp. 400–405. Springer, Heidelberg (2004)

    Google Scholar 

  5. Deepa, S.N., Sivanandam, S.N.: Introduction to Genetic Algorithms. Springer, Heidelberg (2008)

    MATH  Google Scholar 

  6. Gelatt, C.D., Kirkpatrick, S., Vecchi, M.P.: Optimization by simulated annealing. Sci. New Ser. 220(4598), 671–680 (1983)

    MATH  MathSciNet  Google Scholar 

  7. Toth, P., Vigo, D.: The Vehicle Routing Problem. Society for Industrial and Applied Mathematics, Philadelphia (2001)

    Google Scholar 

  8. TSPLIB data sets. http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/

  9. Vose, M.D.: The Simple Genetic Algorithm: Foundations and Theory. Massachusetts Institute of Technology, Cambridge (1999)

    MATH  Google Scholar 

  10. Whitley, D.: A genetic algorithm tutorial. Stat. Comput. 4(2), 65–85 (1994)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Wrocław, Joliot-Curie 15, 50-383, Wrocław, Poland

    Mieczysław Wodecki, Michał Karpiński & Maciej Pacut

  2. Institute of Computer Engineering, Control and Robotics, Wroclaw University of Technology, Janiszewskiego 11-17, 50-372, Wrocław, Poland

    Wojciech Bożejko

Authors
  1. Mieczysław Wodecki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wojciech Bożejko
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michał Karpiński
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Maciej Pacut
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wojciech Bożejko .

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

Wodecki, M., Bożejko, W., Karpiński, M., Pacut, M. (2014). Multi-GPU Parallel Memetic Algorithm for Capacitated Vehicle Routing Problem. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2013. Lecture Notes in Computer Science(), vol 8385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55195-6_19

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-55194-9

  • Online ISBN: 978-3-642-55195-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation