Abstract
Many algorithms need to be optimized and adjusted for specific environments in order to realize practical applications in engineering. The object of interest in a project is to minimize the moving time of the honeycomb container under the requirement that each hole in the container needs to arrive at the designated location once. By optimizing the order of each hole arriving at the designed location and the detailed moving path, the optimal moving path of the honeycomb container can be found. There are many essentially similar problems in engineering, such as drilling tacks, spot welding tasks etc. Such problems can be modeled into the traveling salesman problem, that the salesman needs to traverse all set points and eventually returns to the starting point. Some intelligent algorithms are used to solve traveling salesman problems now, such as simulated annealing algorithm, genetic algorithm, ant algorithm etc. However, some errors must be taken into account in practical applications of these algorithms in engineering. In this paper, the ant colony algorithm considering the return error is proposed to deal with the path planning problem in conditions where the return error existing mechanical driving devices.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Cao, F.Z.: A chaotic ant colony optimized link prediction algorithm. IEEE Trans. Syst. Man Cybern.: Syst., 1–15(2019)
Dai, F.Y.: A task scheduling algorithm based on genetic algorithm and ant colony optimization algorithm with multi-QoS constraints in cloud computing. In: 7th International Conference on Intelligent Human-Machine Systems and Cybernetics, pp. 428–431. IEEE, Hangzhou (2015)
Liang, F.D.: An efficient ant colony system approach for new energy vehicle dispatch problem. IEEE Trans. Intell. Transp. Syst., 1–14(2019)
Zhang, F.D.: Multi-colony ant colony optimization based on generalized Jaccard similarity Recommendation strategy, 157303–157317 (2019)
Alobaedy, F.M.M.: Analysis of the number of ants in ant colony system algorithm. In: 5th International Conference on Information and Communication Technology (ICoIC7), pp. 1–5. IEEE, Malacca City (2017)
Liu, Y.: A Novel Ant Colony Optimization Algorithm With Levy Flight. IEEE Access 8, pp. 67205–67213 (2020)
X. Liu, F.: The Ant Colony Algorithm Based on Logic Time Petri Nets and Application in Electronic-Commerce Logistics. IEEE Access 7, 169011–169017(2019)
Solimanpur, P.F.: Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing. Europ. J. Oper. Res. 157(3), 592–606 (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Ge, J., Gao, Y., Xu, L., Li, D., Lan, Z. (2022). Shortest Path Planning Based on the Ant Algorithm Considering the Return Error. In: Yan, L., Duan, H., Yu, X. (eds) Advances in Guidance, Navigation and Control . Lecture Notes in Electrical Engineering, vol 644. Springer, Singapore. https://doi.org/10.1007/978-981-15-8155-7_9
Download citation
DOI: https://doi.org/10.1007/978-981-15-8155-7_9
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-8154-0
Online ISBN: 978-981-15-8155-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)