Abstract
A novel improved ant colony algorithm is proposed, which is aiming at the locally optimal solution and highly complex issues in solving the logistics distribution model of E-commerce. First, corresponding problem description of logistics distribution procedure of E-commerce was analyzed, dynamic travelling salesman problem model was established with taking minimizing logistics time as objective function, and appropriate constraints were set. Second, framework of the improved ant colony algorithm was raised through integrating advantages of both local search algorithm (LSA) and ant colony algorithm. All operations like constructing solutions, pheromone update policy and local search in the novel algorithm were setting. Time complexity reduced to O(n4) in theoretically. Last, offline performance representing algorithm criterion was simulated based on analog data. Results show that, offline performance of the novel algorithm improves obviously, which would provide a reference to apply it in real logistics distribution scene in future.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Wang, H.: Graph Theory and Matlab Implementation. Beihang University Press, Beijing (2010)
Luo, Y., Chen, Z.: Path optimization of logistics distribution based on improved genetic algorithm. Syst. Eng. 30(8), 118–122 (2012)
Fu, R.: Research on logistics distribution based on hybrid genetic algorithm. Thesis for Master Degree of Qingdao University (2015)
Weng, X.: Research on multi objective dynamic optimization of cold chain logistics distribution problem based on artificial bee colony-genetic algorithm. Thesis for Master Degree of Beijing Jiaotong University (2017)
Li, Z.: Research on optimization algorithm of knapsack problem in express logistics distribution. Thesis for Master Degree of Chongqing University of Posts and Telecommunications (2017)
Psaraftis, H.N.: Dynamic Vehicle Routing Problems, pp. 223–248. Elsevier, New York (1988)
Niendorf, M., Kabamba, P.T., Girard, A.R.: Stability of solutions to classes of traveling salesman problems. IEEE Trans. Cybern. 46(4), 973–985 (2016)
Tinos, R., Whitley, D., Howe, A.: Use of explicit memory in the dynamic travelling salesman problem. In: Proceedings of Annual Conference on Genetic Evolution Computation, Vancouver, Canada, pp. 999–1006 (2014)
Mavrovouniotis, M., Yang, S.: A memetic ant colony optimization algorithm for the dynamic travelling salesman problem. In: Proceedings of Genetic Evolutionary Computation Conference, Madrid, Spain, pp. 49–56 (2015)
Mavrovouniotis, M., Yang, S.: Ant colony optimization with immigrants schemes for the dynamic travelling salesman problem with traffic factors. Appl. Soft Comput. 13(10), 4023–4037 (2013)
Mavrovouniotis, M., Yang, S., Yao, X.: Multi colony ant algorithms for the dynamic travelling salesman problem. In: Proceedings of IEEE Symposium on Computational Intelligence in Dynamic and Uncertain Environments(CIDUE), Orlando, FL, USA, pp. 9–16 (2014)
Melo, L., Pereira, F., Costa, E.: Multi caste ant colony algorithm for the dynamic travelling salesperson problem. In: Proceedings of Adaptive and Natural Computing Algorithms, pp. 179–188. Springer, Heidelberg (2013)
Simoes, A., Costa, E.: CHC based algorithms for the dynamic travelling salesman problem. In: Proceedings of Application Evolutional Computation, Turin, Italy, pp. 354–363 (2011)
Stutzle, T., Hoos, H.H.: Max-min ant system. Future Gen. Comput. Syst. 16(9), 889–914 (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Wang, Y., Zhu, Q., Song, Xo., Huang, H., Yang, Q. (2021). Research on Logistics Distribution Model of E-commerce Based on Improved Ant Colony Algorithm. In: Barolli, L., Poniszewska-Maranda, A., Park, H. (eds) Innovative Mobile and Internet Services in Ubiquitous Computing . IMIS 2020. Advances in Intelligent Systems and Computing, vol 1195. Springer, Cham. https://doi.org/10.1007/978-3-030-50399-4_41
Download citation
DOI: https://doi.org/10.1007/978-3-030-50399-4_41
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-50398-7
Online ISBN: 978-3-030-50399-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)