Abstract
Ant colony systems (ACS) have been successfully applied to solving optimization problems. Especially, they are efficient and effective in finding nearly optimal solutions to discrete search spaces. When the solution spaces of the problems to be solved are continuous, it is not so appropriate to use the original ACS to solve it. This paper thus proposes a dynamic-edge ACS algorithm for solving continuous variables problems. It can dynamically generate edges between two nodes and give a pheromone measures for them in a continuous solution space through distribution functions. In addition, it maps the encoding representation and the operators of the original ACS into continuous spaces easily. The proposed algorithm thus provides a simple and standard approach for applying ACS to a problem that has a continuous solution space, and retains the original process and characteristics of the traditional ACS. Several constrained functions are also evaluated to demonstrate the performance of the proposed 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.
