SavedAdd your journal

Journals / İstanbul Üniversitesi İşletme Fakültesi Dergisi / 2012 / Cilt: 41 - Sayı: 2

The particle swarm optimization algorithm for the P-Median facility location problem

P-Medyan kuruluş yeri seçim probleminin çözümünde parçacık sürü optimizasyonu algoritması yaklaşımı

Mehmet BASTI
Necdet ÖZÇAKAR
Pages
241–257
Publication Date
2022-10-18
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

In addition, the results are compared to the solutions obtained from applications of other well-known heuristic and meta-heuristic methods to the same problems.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:This research examines methods for solving the p-median problem, which is an important type of the facility location problems and belongs to the class of NP hard problems.
📊
Key Findings & Data:A swarm based meta-heuristic, the Particle Swarm Optimization (PSO) algorithm is applied for the solution of the p-median problem.
💡
Conclusion & Impact:In addition, the results are compared to the solutions obtained from applications of other well-known heuristic and meta-heuristic methods to the same problems.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

This research examines methods for solving the p-median problem, which is an important type of the facility location problems and belongs to the class of NP hard problems. A swarm based meta-heuristic, the Particle Swarm Optimization (PSO) algorithm is applied for the solution of the p-median problem. The study concludes with presentation of results obtained from the application of the PSO algorithm to two of the widely used ORLIB and Galvao test problems. In addition, the results are compared to the solutions obtained from applications of other well-known heuristic and meta-heuristic methods to the same problems.

Özet

Bu çalışmada kuruluş yeri seçim problemleri içinde önemli bir yere sahip olan p-medyan probleminin çözümü üzerinde durulmuştur. NP-zor kombinatoryal optimizasyon problemler kategorisine giren p-medyan probleminin çözümü için sürü zekası tabanlı bir meta sezgisel olan Parçacık Sürü Optimizasyonu (PSO) algoritması kullanılmıştır. Çalışmanın sonunda PSO algoritmasının yaygın olarak kullanılan iki farklı test problemine uygulanması ile elde edilen sonuçlar verilmiştir. Ayrıca elde edilen bu sonuçlar literatürdeki farklı sezgisel ve meta sezgisellerin aynı test problemlerine uygulanması ile elde edilen sonuçlarla karşılaştırılmıştır.

🔖

Cite This Article

BASTI, M., ÖZÇAKAR, N. (2022). The particle swarm optimization algorithm for the P-Median facility location problem. İstanbul Üniversitesi İşletme Fakültesi Dergisi, Cilt: 41 - Sayı: 2, 241–257. https://ajindex.com/articles/554021

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (19)

  1. R. Tavakkoli, E. Shayan, Facilities Layout Design by Genetic Algorithms. Computers and Industrial Engineering, 35, 3-4, 527-530 (1998).
  2. M. Jamshidi, Median Location Problem, in Facility Location: Concepts, Models, Algorithms and Case Studies (R.Z. Farahani and M. Hekmatfar, Eds.), Physica-Verlag Heidelberg, 2009, p.177-191.
  3. S.L. Hakimi, Optimum Location of Switching Centers and the Absolute Centers and Medians of a Graph. Operations Research, 12, 450–459 (1964).
  4. M.S. Daskin, Network and Discrete Location: Models, Algorithms and Applications. John Wiley & Sons, Inc., New York, 1995, p.92-303.
  5. J. Current, M.S. Daskin and D. Schilling, Discrete Network Location Model, in Facility Location: Applications and Theory (Z. Drezner and H.W. Hamacher, Eds.), Springer-Verlag, 2001, p.83-120.
  6. D.R. Sule, Logistics of Facility Location and Allocation. Marcel Dekker, New York, US, 2001, p.173-220
  7. O. Alp, E. Erkut, Z. Drezner, An Efficient Genetic Algorithm for the p-Median Problem. Annals of Operations Research, 122, 1-4, 21-42 (2004).
  8. A.A. Kuehn, M.J. Hamburger, A Heuristic Program for Locating Warehouses. Management Science, 9, 4, 643-666 (1963).
  9. A. Manne, Plant Location Under Economies of Scale Decentralization and computation. Management Science, 11, 213-235 (1964).
  10. M. Balinski, Integer Programming, Methods, Uses and Computation. Management Science, 12, 253–313 (1965).
  11. S.L. Hakimi, Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems. Operations Research, 13, 462–475 (1965).
  12. W. Pullan, A Population Based Hybrid Metaheuristic for the p-median Problem. IEEE Congress on Evolutionary Computation, 76-82 (2008).
  13. T. Küçükdeniz, Sürü Zekası Optimizasyon Tekniği ve Tedarik Zinciri Yönetiminde Bir Uygulama. Yayımlanmamış Doktora Tezi, İstanbul Üniversitesi,
  14. Fen Bilimleri Enstitüsü, Endüstri Mühendisliği Anabilim Dalı, (2009).
  15. G. Cornuejols, M.L. Fisher, G.L. Nemhauser, Location of Bank Accounts to Optimise Float: an Analytic Study of Exact and Approximate Algorithms. Management Science, 23, 789–810 (1977).
  16. O. Kariv, S.L. Hakimi, An Algorithmic Approach to Network Location Problems. II: The p-medians. SIAM Journal on Applied Mathematics, 37, 3, 539–560 (1979).
  17. C. ReVelle, R. Swain, Central Facilities Location. Geographical Analysis, 2, 30–42 (1970).
  18. J. Kennedy, R.C. Eberhart, Particle swarm optimization. Proceedings of IEEE International Conference on Neural Networks, Piscataway, NJ, USA, 1942-1948 (1995).
  19. J. Kennedy, R.C