Abstract
Ant colony optimization (ACO) has been effective meta-heuristics to solve hard instances of constraint satisfaction problems (CSPs). In ACO based algorithms, it is generally necessary and difficult to set at least a pair of control parameters in advance. In this paper, we propose an ACO based algorithm that can dynamically adjust the control parameters during the search progress by adopting a particle swarm intelligence based approach. We demonstrate that dynamically adjustment of the parameters in our proposed method can be effective and efficiently solve large-scale and hard graph coloring problems which are one of typical examples of CSPs.
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.
