Abstract
AbstractIn this paper we prove the convergence of a Monte Carlo (MC) method for Combinatorial Optimization Problems (COPs). The Ant Colony Optimization (ACO) is a MC method, created to solve efficiently COPs. The Ant Colony Optimization (ACO) algorithms are being applied successfully to diverse heavily problems. To show that ACO algorithms could be good alternatives to existing algorithms for hard combinatorial optimization problems, recent research in this area has mainly focused on the development of algorithmic variants which achieve better performance than previous one. In this paper we present ACO algorithm with Additional Reinforcement (ACO-AR) of the pheromone to the unused movements. ACO-AR algorithm differs from ACO algorithms in several important aspects. In this paper we prove the convergence of ACO-AR algorithm.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
