Skip to main content
SpringerLink
Log in

Parallel Cost Function Determination on GPU for the Vehicle Routing Problem

  • Conference paper
Artificial Intelligence and Soft Computing (ICAISC 2015)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9120))

Included in the following conference series:

  • 1913 Accesses

Abstract

The paper deals with parallel variants of optimization algorithms dedicated to solve transportation optimization issues. The problem derives from practice of logistics and vehicle routes planning. We propose parallelization method of the cost function determination dedicated to be executed on GPU architecture. The method can be used in metaheuristic algorithms as well as in exact approaches.

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. Alba, E., Dorronsoro, B.: Computing Nine New Best-So-Far Solutions for Capacitated VRP with a Cellular Genetic Algorithm. Information Processing Letters 98(6), 225–230 (2006)

    Article  MathSciNet  MATH  Google Scholar 

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

    Chapter  Google Scholar 

  3. Bożejko, W., Wodecki, M.: Parallel Evolutionary Algorithm for the Traveling Salesman Problem. Journal of Numerical Analysis, Industrial and Applied Mathematics 2(3-4), 129–137 (2007)

    MATH  Google Scholar 

  4. Bożejko, W., Wodecki, M.: Solving Permutational Routing Problems by Population-Based Metaheuristics. Computers & Industrial Engineering 57, 269–276 (2009)

    Article  Google Scholar 

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

    Google Scholar 

  6. Bożejko, W., Pempera, J., Smutnicki, C.: Parallel Tabu Search Algorithm for the Hybrid Flow Shop Problem. Computers & Industrial Engineering 65, 466–474 (2013)

    Article  Google Scholar 

  7. Bożejko, W., Wodecki, M.: On the theoretical properties of swap multimuwes. Res. Lett. 35(2), 227–231 (2007)

    MathSciNet  MATH  Google Scholar 

  8. Dantzig, G.B., Ramser, J.H.: The Truck Dispatching Problem, INFORMS. Management Science 6(1), 80–91 (1959)

    Article  MathSciNet  Google Scholar 

  9. Doerner, K.F., Hartl, R.F., Kiechle, G., Lucká, M., Reimann, M.: Parallel ant systems for the capacitated vehicle routing problem. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2004. LNCS, vol. 3004, pp. 72–83. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  10. Hasle, G., Kloster, O.: Industrial Vehicle Routing, SINTEF ICT, Department of Applied Mathematics, P.O. Box 124 Blindern, NO-0314 Oslo, Norway

    Google Scholar 

  11. Jagiełło, S., Źelazny, D.: Solving Multi-criteria Vehicle Routing Problem by Parallel Tabu Search on GPU. Procedia Computer Science (18), 2529–2532 (2013)

    Google Scholar 

  12. Le Bouthillier, A., Crainic, T.: A cooperative parallel meta-heuristic for the vehicle routing problem with time windows. Computers & Operations Research 32, 1685–1708 (2005)

    Article  MATH  Google Scholar 

  13. Pempera, J., Smutnicki, C., Żelazny, D.: Optimizing bicriteria flow shop scheduling problem by simulated annealing algorithm. Procedia Computer Science (18), 936–945 (2013)

    Google Scholar 

  14. Rego, C.: Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms. Parallel Computing 27, 201–222 (2001)

    Article  MATH  Google Scholar 

  15. Rudy, J., Żelazny, D.: Memetic algorithm approach for multi-criteria network scheduling. In: Proceeding of the International Conference on ICT Management for Global Competitiveness and Economic Growth in Emerging Economies (ICTM 2012), pp. 247–261 (2012)

    Google Scholar 

  16. Rudy, J., ?Zelazny, D.: GACO: a parallel evolutionary approach to multi-objective scheduling. In: Gaspar-Cunha, A., Henggeler Antunes, C., Coello, C.C. (eds.) EMO 2015. LNCS, vol. 9018, pp. 307–320. Springer, Heidelberg (2015)

    Google Scholar 

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

    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

  2. Department of Automatics, Mechatronics and Control Systems, Faculty of Electronics, Wrocław University of Technology, Wyb. Wyspiańskiego 27, 50-370, Wrocław, Poland

    Wojciech Bożejko, Szymon Jagiełło & Jarosław Pempera

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. Szymon Jagiełło
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jarosław Pempera
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mieczysław Wodecki .

Editor information

Editors and Affiliations

  1. Czestochowa University of Technology, Czestochowa, Poland

    Leszek Rutkowski

  2. Czestochowa University of Technology, Czestochowa, Poland

    Marcin Korytkowski

  3. Czestochova Univ of Technology, Częstochova, Poland

    Rafal Scherer

  4. AGH University of Science and Technology, Krakow, Poland

    Ryszard Tadeusiewicz

  5. University of California, Berkeley, California, USA

    Lotfi A. Zadeh

  6. Louisville, Kentucky, USA

    Jacek M. Zurada

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Wodecki, M., Bożejko, W., Jagiełło, S., Pempera, J. (2015). Parallel Cost Function Determination on GPU for the Vehicle Routing Problem. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L., Zurada, J. (eds) Artificial Intelligence and Soft Computing. ICAISC 2015. Lecture Notes in Computer Science(), vol 9120. Springer, Cham. https://doi.org/10.1007/978-3-319-19369-4_69

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19369-4_69

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19368-7

  • Online ISBN: 978-3-319-19369-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation