Skip to main content

A CPU-GPU Parallel Ant Colony Optimization Solver for the Vehicle Routing Problem

  • Conference paper
  • First Online:
Applications of Evolutionary Computation (EvoApplications 2018)

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

Abstract

This paper exposes a new hybrid approach based on Ant Colony Optimization heuristics, Route First-Cluster Second methods and Local search procedures, combined to generate high quality solutions for the Vehicle Routing Problem. This method uses the parallel computing power of modern general purpose GPUs and multicore CPUs, outperforming current ACO-based VRP solvers and showing to be a competitive approach compared to other high performing metaheuristic solvers.

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

Access this chapter

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

Institutional subscriptions

References

  1. Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput. Surv. (CSUR) 35(3), 268–308 (2003)

    Article  Google Scholar 

  2. Vidal, T., Crainic, T., Gendreau, M., Lahrichi, N., Rei, W.: A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper. Res. 60(3), 611–624 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  3. Jin, J., Crainic, T., Lokketangen, A.: A Cooperative Parallel Metaheuristic for the Capacitated Vehicle Routing Problem (2012)

    Google Scholar 

  4. Groer, C.: Parallel and serial algorithms for vehicle routing problems. In: ProQuest (2008)

    Google Scholar 

  5. Prins, C.: A grasp \(\times \) evolutionary local search hybrid for the vehicle routing problem. In: Pereira, F.B., Tavares, J. (eds.) Bio-inspired Algorithms for the Vehicle Routing Problem, Studies in Computational Intelligence, vol. 161, pp. 35–53. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-540-85152-3_2

    Chapter  Google Scholar 

  6. Christophe, D., Philippe, L., Prodhon, C., et al.: A GRASPxELS with Depth First Search Split Procedure for the HVRP (2012)

    Google Scholar 

  7. Subramanian, A.: Heuristic, Exact and Hybrid Approaches for Vehicle Routing Problems. Ph.D. thesis, Universidade Federal Fluminense, Niterói, Brazil (2012)

    Google Scholar 

  8. Dorigo, M., Birattari, M., Stutzle, T.: Ant colony optimization. IEEE Comput. Intell. Mag. 1(4), 28–39 (2006)

    Article  Google Scholar 

  9. Beasley, J.: Route first–cluster second methods for vehicle routing. Omega 11(4), 403–408 (1983)

    Article  Google Scholar 

  10. Osman, I.: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann. Oper. Res. 41(4), 421–451 (1993)

    Article  MATH  Google Scholar 

  11. Helsgaun, K.: An effective implementation of the lin-kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106–130 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  12. Guohua, F.: Parallel ant colony optimization algorithm with GPU-acceleration based on all-in-roulette selection. Comput. Digital Eng. 5, 007 (2011)

    Google Scholar 

  13. Golden, Bruce L., Wasil, Edward A., Kelly, James P., Chao, I-Ming: The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results. In: Crainic, Teodor Gabriel, Laporte, Gilbert (eds.) Fleet Management and Logistics. CRT, pp. 33–56. Springer, Boston, MA (1998). https://doi.org/10.1007/978-1-4615-5755-5_2

    Chapter  Google Scholar 

  14. Bell, J., McMullen, P.: Ant colony optimization techniques for the vehicle routing problem. Adv. Eng. Inform. 18(1), 41–48 (2004)

    Article  Google Scholar 

  15. Reimann, M., Doerner, K., Hartl, R.: D-ants: savings based ants divide and conquer the vehicle routing problem. Comput. Oper. Res. 31(4), 563–591 (2004)

    Article  MATH  Google Scholar 

  16. Chen, C., Ting, C.: An improved ant colony system algorithm for the vehicle routing problem. J. Chin. Inst. Ind. Eng. 23(2), 115–126 (2006)

    Google Scholar 

  17. Lucka, M., Piecka, S.: Ant colony optimizer with application to the vehicle routing problem. J. Appl. Math. 4 (2011)

    Google Scholar 

Download references

Acknowledgements

This work has been supported by the EU (FEDER) and the Spanish MINECO, under grants TIN2014-54806-R, TIN2015-65277-R and BES-2016-076806.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Antón Rey .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Rey, A., Prieto, M., Gómez, J.I., Tenllado, C., Hidalgo, J.I. (2018). A CPU-GPU Parallel Ant Colony Optimization Solver for the Vehicle Routing Problem. In: Sim, K., Kaufmann, P. (eds) Applications of Evolutionary Computation. EvoApplications 2018. Lecture Notes in Computer Science(), vol 10784. Springer, Cham. https://doi.org/10.1007/978-3-319-77538-8_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-77538-8_44

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-77537-1

  • Online ISBN: 978-3-319-77538-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics