ADiscrete Particle SwarmOptimization Algorithm for Uncapacitated Facility Location Problem

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.

[1]  Kevin Barraclough,et al.  I and i , 2001, BMJ : British Medical Journal.

[2]  Mohammad Abdulrahman Al-Fawzan,et al.  A tabu search approach to the uncapacitated facility location problem , 1999, Ann. Oper. Res..

[3]  G. Nemhauser,et al.  Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .

[4]  Tony J. Van Roy,et al.  A Cross Decomposition Algorithm for Capacitated Facility Location , 1986, Oper. Res..

[5]  Mauro Birattari,et al.  Swarm Intelligence , 2012, Lecture Notes in Computer Science.

[6]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[7]  Minghe Sun.  Solving the uncapacitated facility location problem using tabu search , 2006, Comput. Oper. Res..

[8]  Hirotaka Yoshida,et al.  A PARTICLE SWARM OPTIMIZATION FOR REACTIVE POWER AND VOLTAGE CONTROL CONSIDERING VOLTAGE STABILITY , 2000 .

[9]  Mehmet Emin Aydin,et al.  A Distributed Evolutionary Simulated Annealing Algorithm for Combinatorial Optimisation Problems , 2004, J. Heuristics.

[10]  Peng-Yeng Yin,et al.  A discrete particle swarm algorithm for optimal polygonal approximation of digital curves , 2004, J. Vis. Commun. Image Represent..

[11]  Andries Petrus Engelbrecht,et al.  Cooperative learning in neural networks using particle swarm optimizers , 2000, South Afr. Comput. J..

[12]  Jozef Kratica,et al.  Solving the simple plant location problem by genetic algorithm , 2001, RAIRO Oper. Res..

[13]  Pin Luarn,et al.  A discrete version of particle swarm optimization for flowshop scheduling problems , 2007, Comput. Oper. Res..

[14]  Mehmet Fatih Tasgetiren,et al.  A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..

[15]  Mehmet Fatih Tasgetiren,et al.  A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..

[16]  Manfred Körkel.  On the exact solution of large-scale simple plant location problems , 1989 .

[17]  Yoshikazu Fukuyama,et al.  A hybrid particle swarm optimization for distribution state estimation , 2003, 2003 IEEE Power Engineering Society General Meeting (IEEE Cat. No.03CH37491).

[18]  Russell C. Eberhart,et al.  Comparison between Genetic Algorithms and Particle Swarm Optimization , 1998, Evolutionary Programming.

[19]  Mehmet Sevkli,et al.  A Continuous Particle Swarm Optimization Algorithm for Uncapacitated Facility Location Problem , 2006, ANTS Workshop.

[20]  Rajan Batta,et al.  On the use of genetic algorithms to solve location problems , 2002, Comput. Oper. Res..

[21]  Pascal Van Hentenryck,et al.  A simple tabu search for warehouse location , 2004, Eur. J. Oper. Res..

[22]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[23]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[24]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[25]  J. Krarup,et al.  The simple plant location problem: Survey and synthesis , 1983 .

[26]  A. Klose.  A Branch and Bound Algorithm for An Uncapacitated Facility Location Problem with a Side Constraint , 1998 .

[27]  Fawaz S. Al-Anzi,et al.  A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application , 2006, Comput. Oper. Res..

[28]  Imtiaz Ahmad,et al.  Particle swarm optimization for task assignment problem , 2002, Microprocess. Microsystems.

[29]  Mitsuo Gen,et al.  Optimal design of a star-LAN using neural networks , 1996 .

[30]  Philip M. Kaminsky,et al.  Designing and managing the supply chain : concepts, strategies, and case studies , 2007 .

[31]  Diptesh Ghosh,et al.  Neighborhood search heuristics for the uncapacitated facility location problem , 2003, Eur. J. Oper. Res..

[32]  K. Jörnsten,et al.  Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing , 1990 .

[33]  Shivakumar Vaithyanathan,et al.  Massively parallel analog tabu search using neural networks applied to simple plant location problems , 1996 .