A Discrete Particle Swarm Optimization Algorithm for Uncapacitated Facility Location Problem. (18th March 2008)

• Record Type: Journal Article
• Authors: Guner, Ali R.; Sevkli, Mehmet
• Other Names: Blackwell T. Academic Editor.
• Is Part Of: Journal of artificial evolution and applications. Volume 2008(2008)
• Publication Date: 2008-03-18
• Subjects: Evolutionary programming (Computer science) -- Periodicals; Evolutionary programming (Computer science); Periodicals; Electronic journals; 006.3823
• DOI: 10.1155/2008/861512
• Languages: English
• ISSNs: 1687-6229

Abstract

Abstract : A discrete version of particle swarm optimization ( DPSO ) is employed to solve uncapacitated facility location ( UFL ) problem which is one of the most widely studied in combinatorial optimization. In addition, a hybrid version with a local search is defined to get more efficient results. The results are compared with a continuous particle swarm optimization ( CPSO ) algorithm and two other metaheuristics studies, namely, genetic algorithm ( GA ) and evolutionary simulated annealing ( ESA ). To make a reasonable comparison, we applied to same benchmark suites that are collected from OR -library. In conclusion, the results showed that DPSO algorithm is slightly better than CPSO algorithm and competitive with GA and ESA .