Skip to main content
SpringerLink
Log in
Book cover

International Conference on Computational Logistics

ICCL 2018: Computational Logistics pp 306–315Cite as

Solving Full-Vehicle-Mode Vehicle Routing Problems Using ACO

  • Conference paper
  • First Online:

  • 1389 Accesses

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

Abstract

The capacitated vehicle routing problem is a very classic but simple type of vehicle routing problem (VRP). There are variants of the VRP in practice based on different constraints which are called rich VRP (RVRP). In this article, variants of the VRP, including fixed vehicle types and dynamic vehicle type combinations are analyzed. An improved ant colony optimization (ACO) algorithm is designed to resolve this group of VRPs. The fixed vehicle type VRP, homogenous fleet VRP and heterogeneous fleet VRP are defined by one or multiple vehicle types in RVRP. Because of the evolution of transportation equipment, some new vehicle types such as truck and full trailer as well as tractor and semitrailer are introduced. The static and dynamic usages of different vehicle types vary with the business operations. We define this kind of VRPs as full-vehicle-mode (FVM) VRP in this paper. The associated ACO algorithm is developed to solve FVM-VRP problems. Computational experiments are performed and the results are presented to demonstrate the efficiency of the proposed algorithm.

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. Caceres-Cruz, J., Arias, P., Guimarans, D., Riera, D., Juan, A.A.: Rich vehicle routing problem: survey. ACM Comput. Surv. (CSUR) 47(2), article #32 (2015)

    Article  Google Scholar 

  2. Lahyani, R., Khemakhem, M., Semet, F.: Rich vehicle routing problems: from a taxonomy to a definition. Eur. J. Oper. Res. 241(1), 1–14 (2015)

    Article  MathSciNet  Google Scholar 

  3. Lum, O., Chen, P., Wang, X., Golden, B., Wasil, E.: A heuristic approach for the swap-body vehicle routing problem. In: 14th INFORMS Computing Society Conference, pp. 172–187 (2015)

    Google Scholar 

  4. Parragh, S.N., Cordeau, J.F.: Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows. Comput. Oper. Res. 83, 28–44 (2017)

    Article  MathSciNet  Google Scholar 

  5. Drexl, M.: Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments. Networks 63(1), 119–133 (2014)

    Article  MathSciNet  Google Scholar 

  6. Rothenbächer, A.K., Drexl, M., Irnich, S.: Branch-and-price-and-cut for the truck-and-trailer routing problem with time windows. Transport. Sci. (2018). Online available

    Google Scholar 

  7. Torres, I., Cruz, C., Verdegay, J.L.: Solving the truck and trailer routing problem with fuzzy constraints. Int. J. Comput. Intell. Syst. 8(4), 713–724 (2015)

    Article  Google Scholar 

  8. Li, H., Lv, T., Li, Y.: The tractor and semitrailer routing problem with many-to-many demand considering carbon dioxide emissions. Transp. Res. Part D: Transp. Environ. 34, 68–82 (2015)

    Article  Google Scholar 

  9. Pollaris, H., Braekers, K., Caris, A., Janssens, G., Limbourg, S.: The fleet size and mix vehicle routing problem with sequence-based pallet loading and axle weight constraints. In: Proceedings of the BIVEC-GIBET Transport Research Days 2017: Towards an Autonomous and Interconnected Transport Future, pp. 162–176 (2017)

    Google Scholar 

  10. Li, H., Lv, T., Lu, Y.: The combination truck routing problem: a survey. Procedia Eng. 137, 639–648 (2016)

    Article  Google Scholar 

  11. Ariyasingha, I.D.I.D., Fernando, T.G.I.: Performance analysis of the multi-objective ant colony optimization algorithms for the traveling salesman problem. Swarm Evol. Comput. 23, 11–26 (2015)

    Article  Google Scholar 

  12. Gambardella, L.M., Taillard, É., Agazzi, G.: MACS-VRPTW: a multiple colony system for vehicle routing problems with time windows. In: New Ideas in Optimization, pp. 63–76. McGraw-Hill (1999)

    Google Scholar 

  13. Reed, M., Yiannakou, A., Evering, R.: An ant colony algorithm for the multi-compartment vehicle routing problem. Appl. Soft Comput. 15, 169–176 (2014)

    Article  Google Scholar 

  14. Rajappa, G.P., Wilck, J.H., Bell, J.E.: An ant colony optimization and hybrid metaheuristics algorithm to solve the split delivery vehicle routing problem. Int. J. Appl. Indust. Eng. (IJAIE) 3(1), 55–73 (2016)

    Article  Google Scholar 

  15. Kalayci, C.B., Kaya, C.: An ant colony system empowered variable neighborhood search algorithm for the vehicle routing problem with simultaneous pickup and delivery. Expert Syst. Appl. 66, 163–175 (2016)

    Article  Google Scholar 

  16. Wang, X., Choi, T.M., Liu, H., Yue, X.: Novel ant colony optimization methods for simplifying solution construction in vehicle routing problems. IEEE Trans. Intell. Transp. Syst. 17(11), 3132–3141 (2016)

    Article  Google Scholar 

  17. http://www.aco-metaheuristic.org/aco-code/

Download references

Acknowledgements

We are indebted to Prof. Stefan Voss and three anonymous reviewers for insightful observations and suggestions that have helped to improve our paper This work was partially supported by NSFC of China project [grant number 41771410], CIUC and TJAD [grant number CIUC20150011].

Author information

Authors and Affiliations

  1. School of Software Engineering, Tongji University, Shanghai, China

    Yahui Liu & Buyang Cao

Authors
  1. Yahui Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Buyang Cao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yahui Liu .

Editor information

Editors and Affiliations

  1. University of Salerno, Fisciano, Italy

    Raffaele Cerulli

  2. University of Salerno, Fisciano, Italy

    Andrea Raiconi

  3. Institute of Information Systems, University of Hamburg, Hamburg, Germany

    Stefan Voß

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Liu, Y., Cao, B. (2018). Solving Full-Vehicle-Mode Vehicle Routing Problems Using ACO. In: Cerulli, R., Raiconi, A., Voß, S. (eds) Computational Logistics. ICCL 2018. Lecture Notes in Computer Science(), vol 11184. Springer, Cham. https://doi.org/10.1007/978-3-030-00898-7_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00898-7_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00897-0

  • Online ISBN: 978-3-030-00898-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation