Abstract
Ant colony optimization (ACO) is a class of stochastic search procedures working in the space of the solutions which has been applied to several NP-hard combinatorial optimization problems. Two-stage updating pheromone for invariant ant colony optimization algorithm (TSIACO) as one of novel ACO algorithm has been proved that it is a strong invariant ACO algorithm. Experimental results based on traveling salesman problems (TSP) show its feasibility compared to max-min ant system (MMAS). However, how the parameters affecting the performance of TSIACO has not been studied. In this paper, the framework of constructing invariant ACO algorithm based on TSIACO is proposed firstly. Then, we use the experimental analysis method to study the action of parameters based on TSP. Lastly, we compare the performance of TSIACO with other novel ACO algorithms to show the effectiveness of TSIACO.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: DEStech Transactions on Engineering and Technology Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
