- 期刊
- OpenAccess
Object-Guided Ant Colony Optimization Algorithm with Enhanced Memory for Traveling Salesman Problem
並列摘要
In this study, we presents an object-guided ACO algorithm which is consisted of ants with enhanced memory. In the process of solution construction, each ant stores a complete solution in its enhanced memory. Each time ant selects a solution component probabilistically, it will calculate the difference between current solution and the new solution after adding the selected component and then Metropolis accepting rule, which has been used in simulated annealing algorithm successfully, is used to decide whether to accept the component or discard it. The simulation results, which were carried on benchmark traveling salesman problems, show that the improvement of individual intelligence can improve the performance of ACO algorithm remarkably.
延伸閱讀
- 葉偉勳（2015）。A Research on Parameters of Ant Colony Optimization for the Traveling Salesman Problem〔碩士論文，中山醫學大學〕。華藝線上圖書館。https://doi.org/10.6834/CSMU.2015.00036
- 陳俊傑（2004）。A Seed-Guided Ant Colony Optimization Method for Capacitated Vehicle Routing Problem〔碩士論文，國立臺灣大學〕。華藝線上圖書館。https://doi.org/10.6342/NTU.2004.00687
- 陳俊勳（2004）。An Ant Colony Optimization Clustering Algorithm〔碩士論文，元智大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0009-0112200611315267
- 陳以承（2013）。Developing an enhanced ant colony search algorithm for continuous optimization problems〔碩士論文，國立暨南國際大學〕。華藝線上圖書館。https://doi.org/10.6837/NCNU.2013.00301
- Chiu, P. C. (2014). Applying Ant Colony Optimization Algorithm in a Serial Multi-echelon Integrated Just-in-Time Inventory Model [master's thesis, National Taipei University of Technology]. Airiti Library. https://doi.org/10.6841/NTUT.2014.00687