Skip to main content

A Hybrid Ant Colony Optimization Algorithm for Green Two-Echelon Multi-compartment Vehicle Routing Problem with Time Windows

  • Conference paper
  • First Online:
Advanced Intelligent Computing Technology and Applications (ICIC 2024)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14862))

Included in the following conference series:

  • 480 Accesses

Abstract

In this paper, a hybrid ant colony optimization algorithm with adaptive large neighborhood search (HACO_ALNS) is proposed to solve the green two-echelon multi-compartment Vehicle routing problem with time windows (G2E-MCVRPTW). Minimizing travel and service time costs, minimizing penalty costs, and maximizing the reduction of carbon emission costs are the objectives that the G2E-MCVRPTW needs to optimize. In the initial phase of the HACO_ALNS algorithm, customers are assigned to satellites using three-dimensional clustering. Then, based on problem characteristics, several high-quality individuals are obtained using two algorithms to initialize the pheromone concentration matrix, thereby accelerating the convergence speed of the algorithm. In the local search phase of HACO_ALNS, three local operations are proposed to enhance the algorithm’s local search capability. The route reduction operation not only searches for better solutions but also further accelerates the convergence speed of the algorithm, bringing the solution space quickly to a more optimal search space. The adaptive large neighborhood search operation efficiently conducts deep search and optimization of the solution space. A perturbation operation based on simulated annealing algorithm is designed to prevent the algorithm from being trapped in local optima. Finally, simulation experiments and algorithm comparisons demonstrate the effectiveness of the proposed HACO_ALNS algorithm.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Elbek, M., Wohlk, S.: A variable neighborhood search for the multi-period collection of recyclable materials. Eur. J. Oper. Res. 249(2), 540–550 (2016)

    Article  MathSciNet  Google Scholar 

  2. Huang, H., Yang, S., Li, X., Hao, Z.: An Embedded Hamiltonian graph-guided heuristic algorithm for two-echelon vehicle routing problem. IEEE Trans. Cybern. 52(7), 5695–5707 (2022)

    Article  Google Scholar 

  3. Hemmelmayr, V.C., Cordeau, J.F., Crainic, T.G.: An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Comput. Oper. Res. 39(12), 3215–3228 (2012)

    Article  MathSciNet  Google Scholar 

  4. Breunig, U., Schmid, V., Hartl, R.F., Vidal, T.: A large neighborhood based heuristic for two-echelon routing problems. Comput. Oper. Res. 76, 208–225 (2016)

    Article  MathSciNet  Google Scholar 

  5. Chen, J., Shi, J.: A multi-compartment vehicle routing problem with time windows for urban distribution - a comparison study on particle swarm optimization algorithms. Comput. Ind. Eng. 133, 95–106 (2019)

    Article  Google Scholar 

  6. Zhang, H., Zhang, Q., Ma, L., Zhang, Z., Liu, Y.: A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows. Inf. Sci. 490, 166–190 (2019)

    Article  MathSciNet  Google Scholar 

  7. Wang, Y., Wang, L., Chen, G., Cai, Z., Xing, L.: An improved ant colony optimization algorithm to the periodic vehicle routing problem with time window and service choice. Swarm Evol. Comput. 55, 100675 (2020)

    Article  Google Scholar 

  8. 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 

  9. Demir, E., Bektas, T., Laporte, G.: An adaptive large neighborhood search heuristic for the pollution-routing problem. Eur. J. Oper. Res. 223(2), 346–359 (2012)

    Article  MathSciNet  Google Scholar 

  10. Guo, N., Qian, B., Na, J., Hu, R., Mao, J.L.: A three-dimensional ant colony optimization algorithm for multi-compartment vehicle routing problem considering carbon emissions. Appl. Soft Comput. 127(109326), 1–22 (2022)

    Google Scholar 

  11. Perboli, G., Tadei, R., Vigo, D.: The two-echelon capacitated vehicle routing problem: models and math-based heuristics. Trans. Sci. 45(3), 364–380 (2011)

    Article  Google Scholar 

  12. Baldacci, R., Mingozzi, A., Roberti, R., et al.: An exact algorithm for the two-echelon capacitated vehicle routing problem. Oper. Res. 61(2), 298–314 (2013)

    Article  MathSciNet  Google Scholar 

  13. Giallanza, A., Li Puma, G.: Fuzzy green vehicle routing problem for designing a three echelons supply chain. J. Clean. Prod. 259, 120774 (2020)

    Article  Google Scholar 

  14. Abdulkader, M.M.S., Gajpal, Y., ElMekkawy, T.Y.: Hybridized ant colony algorithm for the multi compartment vehicle routing problem. Appl. Soft Comput. 37, 196–203 (2015)

    Article  Google Scholar 

Download references

Acknowledgments

This research was supported by the National Natural Science Foundation of China (62173169 and 61963022) and the Basic Research Key Project of Yunnan Province (202201AS070030).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ning Guo .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wang, ZC., Guo, N., Hu, R., Qian, B., Shang, QX. (2024). A Hybrid Ant Colony Optimization Algorithm for Green Two-Echelon Multi-compartment Vehicle Routing Problem with Time Windows. In: Huang, DS., Zhang, X., Chen, W. (eds) Advanced Intelligent Computing Technology and Applications. ICIC 2024. Lecture Notes in Computer Science, vol 14862. Springer, Singapore. https://doi.org/10.1007/978-981-97-5578-3_29

Download citation

  • DOI: https://doi.org/10.1007/978-981-97-5578-3_29

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-97-5577-6

  • Online ISBN: 978-981-97-5578-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics