Skip to main content

A Continuous Particle Swarm Optimization Algorithm for Uncapacitated Facility Location Problem

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4150))

Abstract

In this paper, a continuous Particle Swarm Optimization (PSO) algorithm is presented for the Uncapacitated Facility Location (UFL) problem. In order to improve the solution quality a local search is embedded to the PSO algorithm. It is applied to several benchmark suites collected from OR-library. The results are presented and compared to the results of two recent metaheuristic approaches, namely Genetic Algorithm(GA) and Evolutionary Simulated Annealing (ESA). It is concluded that the PSO algorithm is better than the compared methods and generates more robust results.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Eberhart, R.C., Kennedy, J.: A New Optimizer Using Particle Swarm Theory. In: Proc. of the 6th Int. Symposium on Micro Machine and Human Science, Nagoya, Japan, pp. 39–43 (1995)

    Google Scholar 

  2. Cornuéjols, G., Nemhauser, G.L., Wolsey, L.A.: The Uncapacitated Facility Location Problem. In: Discrete Location Theory, pp. 119–171. Wiley Interscience, New York (1990)

    Google Scholar 

  3. Mirchandani, P.B., Francis, R.L. (eds.): Discrete Location Theory. Wiley-Interscience, New York (1990)

    MATH  Google Scholar 

  4. Klose, A.: A Branch and Bound Algorithm for an UFLP with a Side Constraint. Int. Trans. Opl. Res. 5, 155–168 (1998)

    Article  Google Scholar 

  5. Barcelo, J., Hallefjord, A., Fernandez, E., Jörnsten, K.: Lagrengean Relaxation and Constraint Generation Procedures for Capacitated Plant Location Problems with Single Sourcing. O R Spektrum 12, 78–79 (1990)

    Article  Google Scholar 

  6. Erlenkotter, D.: A dual-based procedure for uncapacitated facility location. Operations Research 26, 992–1009 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  7. Körkel, M.: On the Exact Solution of Large-Scale Simple Plant Location Problems. European J. of Operational Research 39(1), 157–173 (1989)

    Article  MATH  Google Scholar 

  8. Al-Sultan, K.S., Al-Fawzan, M.A.: A tabu search approach to the uncapacitated facility location problem. Annals of Operations Research 86, 91–103 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  9. Laurent, M., Hentenryck, P.V.: A Simple Tabu Search for Warehouse Location. European J. of Operational Research 157, 576–591 (2004)

    Article  MATH  Google Scholar 

  10. Jaramillo, J.H., Bhadury, J., Batta, R.: On the Use of Genetic Algorithms to Solve Location Problems. Computers & Operations Research 29, 761–779 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  11. Ghosh, D.: Neighborhood Search Heuristics for the Uncapacitated Facility Location Problem. European J. of Operational Research 150, 150–162 (2003)

    Article  MATH  Google Scholar 

  12. Aydin, M.E., Fogarty, T.C.: A Distributed Evolutionary Simulated Annealing Algorithm for Combinatorial Optimization Problems. J. of Heuristics 10, 269–292 (2004)

    Article  Google Scholar 

  13. Shi, Y., Eberhart, R.: Parameter selection in particle swarm optimization. In: Porto, V.W., Waagen, D. (eds.) EP 1998. LNCS, vol. 1447, pp. 591–600. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  14. Kennedy, J., Eberhart, R.C., Shi, Y.: Swarm intelligence. Morgan-Kaufmann, San Francisco (2001)

    Google Scholar 

  15. Beasley, J.E.: OR-Library (2005), http://people.brunel.ac.uk/~mastjjb/jeb/info.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sevkli, M., Guner, A.R. (2006). A Continuous Particle Swarm Optimization Algorithm for Uncapacitated Facility Location Problem. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., Stützle, T. (eds) Ant Colony Optimization and Swarm Intelligence. ANTS 2006. Lecture Notes in Computer Science, vol 4150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11839088_28

Download citation

  • DOI: https://doi.org/10.1007/11839088_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-38482-3

  • Online ISBN: 978-3-540-38483-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics