The Integration of Genetic and Ant Colony Algorithm in a Hybrid Approach
Keywords:
genetic algorithm, ant colony algorithm, hybrid approach, optimizationAbstract
The genetic algorithm has many difficulties in solving path plan optimization. Problems like the lack of appropriate setting and settings for different applications. This research work proposes an improved genetic algorithm that combines ant colony algorithm for path optimization. The goal is to eliminate the parameterization uncertainty of the traditional genetic algorithm by introducing the ant colony optimizer. Through the hybrid algorithm, optimization is achieved in moving from point to point, reducing the total distance and improving the travel time. With the help of the global search features of the ant colony optimizer and the stepwise search features, the optimal parameters of the genetic are improved, and the finding of the optimal solution in the global application of the hybrid algorithm is accelerated. The experimental results show that the proposed algorithm can automatically obtain better parameters, especially in its initial values, having good solution accuracy, robustness and significantly better efficiency. The hybrid algorithm was tested on a TSP problem but has applications in spatial mechanics systems such as CNC machining, robotic systems and Coordinate Measuring Machines (CMM). A CMM application is also presented in the results of this paper. Experimental measurements show that up to 40% path planning optimization can be achieved compared to a simple genetic algorithm.
Downloads
References
Dorigo M., Luca M-G., Ant colony system: a cooperative learning approach to the traveling salesman problem. The IEEE Transactions on Evolutionary Computation 1997;1 (1):53–66.
Mansour G., Tsagaris A., Sagris D., CNC machining optimization by genetic algorithms using CAD based system, 3rd International Conference on Diagnosis and Prediction in Mechanical Engineering Systems DIPRE 12.
Tsagaris A., Mansour G. 2017. Implementation of hybrid genetic and ant colony algorithm for CMM path planning, 6th International Conference on Manufacturing Engineering ICMEΝ, 5-6 October 2017, Thessaloniki, Greece.
Qu, G. Xu, G. Wang, Optimization of the measuring path on a coordinate measuring machine using genetic algorithms, Elsevier Measurement 23 (1998) 159-170.
B. Yuewei, W. Shuangyu, L. Kai, W. Xiaogang, A strategy to automatically planning measuring path with CMM offline, Mechanic Automation and Control Engineering (MACE), 2010 International Conference on Wuhan, IEEE Press.
Li, S., You, X. and Liu, S. (2021) Multiple Ant Colony Optimization Using Both Novel LSTM Network and Adaptive Tanimoto Communication Strategy. Applied Intelligence, No. 9, 1-21. https://doi.org/10.1007/s10489-020-02099-z
Guan, B., Zhao, Y. and Li, Y. (2021) An Improved Ant Colony Optimization with an Automatic Updating Mechanism for Constraint Satisfaction Problems. Expert Systems with Applications, 164, Article ID: 114021. https://doi.org/10.1016/j.eswa.2020.114021
Mirjalili, S., Mirjalili, S.M. and Lewis, A. (2014) Grey Wolf Optimizer. Advances in Engineering Software, 69, 46-61. https://doi.org/10.1016/j.advengsoft.2013.12.007
Gai, J., Shen, J., Hu, Y., et al. (2020) An Integrated Method Based on Hybrid Grey Wolf Optimizer Improved Variational Mode Decomposition and Deep Neural Network for Fault Diagnosis of Rolling Bearing. Measurement, 162, Article ID: 107901. https://doi.org/10.1016/j.measurement.2020.107901
Meng, X., Jiang, J. and Wang, H. (2021) AGWO: Advanced GWO in Multi-Layer Perception Optimization. Expert Systems with Applications, Article ID: 114676. https://doi.org/10.1016/j.eswa.2021.114676
Prakash, B. and Viswanathan, V. (2021) ARP-GWO: An Efficient Approach for Prioritization of Risks in Agile Software Development. Soft Computing, 25, 5587-5605. https://doi.org/10.1007/s00500-020-05555-7
Binitha S. and Sathya S. S., A survey of Bio inspired optimization algorithms, International Journal of Soft Computing and Engineering, vol. 2, no. 2, pp. 137–151, 2012.
Bongard J., Biologically inspired computing, Computer, vol. 42, no. 4, pp. 95–98, 2009.
Jianjun Ni, Liuying Wu, Xinnan Fan, and Simon X. Yang, Bioinspired Intelligent Algorithm and Its Applications for Mobile Robot Control: A Survey, 2016
Liang, Y., Wang, L. Applying genetic algorithm and ant colony optimization algorithm into marine investigation path planning model. Soft Computing 24, 8199–8210 (2020). https://doi.org/10.1007/s00500-019-04414-4
Dong R, Wang S, Wang G et al (2019) Hybrid optimization algorithm based on wolf pack search and local search for solving traveling salesman problem. J Shanghai Jiaotong Univ (Sci) 24(1):41–47
Jing Luan, Zhong Yao, Futao Zhao, Xin Song, A novel method to solve supplier selection problem: Hybrid algorithm of genetic algorithm and ant colony optimization, Mathematics and Computers in Simulation, Volume 156, 2019, Pages 294-309, ISSN 0378-4754, https://doi.org/10.1016/j.matcom.2018.08.011.
Paydar M.M., Saidi-Mehrabad M. A hybrid genetic algorithm for dynamic virtual cellular manufacturing with supplier selection, Int. J. Adv. Manuf. Tech., 92 (2017), pp. 3001-3017
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
All papers should be submitted electronically. All submitted manuscripts must be original work that is not under submission at another journal or under consideration for publication in another form, such as a monograph or chapter of a book. Authors of submitted papers are obligated not to submit their paper for publication elsewhere until an editorial decision is rendered on their submission. Further, authors of accepted papers are prohibited from publishing the results in other publications that appear before the paper is published in the Journal unless they receive approval for doing so from the Editor-In-Chief.
IJISAE open access articles are licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. This license lets the audience to give appropriate credit, provide a link to the license, and indicate if changes were made and if they remix, transform, or build upon the material, they must distribute contributions under the same license as the original.