Abstract
An ant colony optimization (ACO) is employed to solve uncapacitated facility location (UFL) problem, which is one of the most widely studied in combinatorial optimization. This is the first approach to solve this problem using ACO technique. Various exact algorithms like branch and bound, linear programming, Lagrangean relaxation algorithms had already been used to solve the problem. On the other hand the meta heuristic approach like continuous particle swarm optimization algorithm (CPSO) [1] has been found very useful to solve this problem. The same benchmark suites that were used in CPSO algorithm collected from OR-library [2] are applied here.
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.
