Nothing Special   »   [go: up one dir, main page]

Skip to main content

Logistics Distribution Route Optimization Using Hybrid Ant Colony Optimization Algorithm

  • Conference paper
  • First Online:
Web Information Systems and Applications (WISA 2022)

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

Included in the following conference series:

Abstract

Logistics route distribution optimization problem (LRDOP) belongs to traveling salesman problem (TSP), but it not only has higher requirements on the running efficiency of the path planning algorithm, but also is easier to fall into local optimum. Ant colony optimization (ACO) is one of the dominant algorithms for solving TSP. In ACO, \(\alpha \) and \(\beta \) parameters are critical and specific. Symbiotic organisms search (SOS) is a non-parametric algorithm, so the \(\alpha \) and \(\beta \) parameters of the ACO can be dynamically optimized by using SOS. In this paper, we introduce a hybrid ant colony optimization SOSACOp, which uses a mixture of ACO and SOS, and adjusts the results by using local optimization strategies and another pheromone updating rules. Experimental results show that SOSACOp has better comprehensive performance than ACO.

This work is supported by Key R &D project of China National Tobacco Corporation No. 110202102031 and Project of Science and Technology Project of Hubei Tobacco Company No. 027Y2021-046.

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
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.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

Similar content being viewed by others

References

  1. Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM (JACM) 45(5), 753–782 (1998)

    Article  MATH  Google Scholar 

  2. Jiang, L., Lai, Y., Chen, Q., Zeng, W., Yang, F., Yi, F.: Shortest path distance prediction based on CatBoost. In: Xing, C., Fu, X., Zhang, Y., Zhang, G., Borjigin, C. (eds.) WISA 2021. LNCS, vol. 12999, pp. 133–143. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-87571-8_12

    Chapter  Google Scholar 

  3. Emambocus, B.A.S., Jasser, M.B., Amphawan, A.: A discrete adapted dragonfly algorithm for solving the traveling salesman problem. In: Fifth International Conference on Intelligent Computing in Data Sciences (ICDS) 2021, pp. 1–6 (2021)

    Google Scholar 

  4. Li, D., Xiao, P., Zhai, R., Sun, Y., Wenbin, H., Ji, W.: Path planning of welding robots based on developed whale optimization algorithm. In: 2021 6th International Conference on Control, Robotics and Cybernetics (CRC), pp. 101–105 (2021)

    Google Scholar 

  5. Zhang, J., Zhang, Z., Lin, X.: An improved artificial bee colony with self-adaptive strategies and application. In: 2021 International Conference on Computer Network, Electronic and Automation (ICCNEA), pp. 101–104 (2021)

    Google Scholar 

  6. Bi, H., Yang, Z., Wang, M.: The performance of different algorithms to solve traveling salesman problem. In: 2021 2nd International Conference on Big Data & Artificial Intelligence & Software Engineering (ICBASE), pp. 153–156 (2021)

    Google Scholar 

  7. Wang, S., Liu, Y., Qiu, Y., Zhang, Q., Ma, J., Zhou, J.: Cooperative task allocation for multiple UAVs based on min-max ant colony system. In: 2021 5th Asian Conference on Artificial Intelligence Technology (ACAIT), pp. 283–286 (2021)

    Google Scholar 

  8. Wang, C., Li, W., Huang, Y.: An automatic heterogenous-based MAX-MIN ant system with pheromone reconstruction mechanism. In: 2021 17th International Conference on Computational Intelligence and Security (CIS), pp. 252–256 (2021)

    Google Scholar 

  9. Chitty, D.M.: A greedy approach to ant colony optimisation inspired mutation for permutation type problems. In: 2021 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 1–8 (2021)

    Google Scholar 

  10. Elleuch, W., Wali, A., Alimi, A.M.: Time-dependent ant colony optimization algorithm for solving the fastest traffic path finding problem in a dynamic environment. In: 2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp. 1649–1654 (2021)

    Google Scholar 

  11. Dorigo, M., Caro, G.D., Gambardella, L.M.: Ant algorithms for discrete optimization. Artif. Life 5(2), 137 C172 (1999)

    Google Scholar 

  12. Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Electron. Comput. 1(1), 53–66 (1997)

    Google Scholar 

  13. Deng, X.Y., Yu, W.L., Zhang, L.M.: A new ant colony optimization with global exploring capability and rapid convergence. In: Proceedings of the 10th World Congress on Intelligent Control and Automation. IEEE (2012)

    Google Scholar 

  14. Cheng, M.Y., Prayogo, D.: Symbiotic Organisms Search: a new metaheuristic optimization algorithm. Comput. Struct. 139, 98–112 (2014)

    Google Scholar 

  15. Wang, Y., Han, Z.: Ant colony optimization for traveling salesman problem based on parameters optimization. Appl. Soft Comput. 107(2), 107439 (2021)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yuhan Cai .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, C., Cai, Y., Hu, P., Quan, P., Song, W. (2022). Logistics Distribution Route Optimization Using Hybrid Ant Colony Optimization Algorithm. In: Zhao, X., Yang, S., Wang, X., Li, J. (eds) Web Information Systems and Applications. WISA 2022. Lecture Notes in Computer Science, vol 13579. Springer, Cham. https://doi.org/10.1007/978-3-031-20309-1_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-20309-1_45

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-20308-4

  • Online ISBN: 978-3-031-20309-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics