SavedAdd your journal

Journals / Endüstri Mühendisliği / 2010 / Cilt: 21 - Sayı: 2

Bees algorithm and generalized assignment problem: comparison of different neighborhood structures

Arı algoritması ve genelleştirilmiş atama problemi: farklı komşuluk yapılarının karşılaştırılması

Lale ÖZBAKIR
Pınar TAPKAN
Adil BAYKASOĞLU
Pages
2–13
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 this study, firstly Bees Algorithm is modified to solve Generalized Assignment Problem and the effects of shift, swap, double shift, and ejection chain neighborhood structures on the performance of Bees Algorithm is analyzed.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Bees Algorithm is a population based new search algorithm which is one of the meta heuristic techniques based on swarm intelligence.
📊
Key Findings & Data:Bees Algorithm depends on to model natural behavior of real honey bees in food foraging and is used to obtain solutions for combinatorial and generally continuous optimization problems in the literature.
💡
Conclusion & Impact:In this study, firstly Bees Algorithm is modified to solve Generalized Assignment Problem and the effects of shift, swap, double shift, and ejection chain neighborhood structures on the performance of Bees Algorithm is analyzed.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

Bees Algorithm is a population based new search algorithm which is one of the meta heuristic techniques based on swarm intelligence. Bees Algorithm depends on to model natural behavior of real honey bees in food foraging and is used to obtain solutions for combinatorial and generally continuous optimization problems in the literature. On the other hand, Generalized Assignment Problem is known as an NP-Hard problem and can be formulated as a combinatorial integer optimization problem. In this study, firstly Bees Algorithm is modified to solve Generalized Assignment Problem and the effects of shift, swap, double shift, and ejection chain neighborhood structures on the performance of Bees Algorithm is analyzed.

Özet

Arı Algoritması popülasyon tabanlı yeni bir arama algoritması olup sürü zekâsına dayalı metasezgisel yöntemlerden birisidir. Algoritma gerçek bal arılarının yiyecek arama davranışlarını modellemeye dayanmakta olup bilimsel yazında kombinatoryel ve genellikle de sürekli optimizasyon problemlerinin çözümünde kullanılmıştır. Diğer taraftan Genelleştirilmiş Atama Problemi NP-zor bir problem olup kombinatoryel tamsayılı optimizasyon problemi olarak formüle edilebilmektedir. Bu çalışmada öncelikle Arı Algoritması, Genelleştirilmiş Atama Problemi’nin çözümü için geliştirilmiş ve kaydırma, değiştirme, çift kaydırma ve çıkarım zinciri komşuluk yapılarının Arı Algoritması'nın performansı üzerindeki etkileri incelenmiştir.

🔖

Cite This Article

ÖZBAKIR, L., TAPKAN, P., BAYKASOĞLU, A. (2022). Bees algorithm and generalized assignment problem: comparison of different neighborhood structures. Endüstri Mühendisliği, Cilt: 21 - Sayı: 2, 2–13. https://ajindex.com/articles/501217

📄 Full Text PDF Viewer

📄

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

References (14)

  1. Alfandari, L., Plateau, A., Tolla, P. 2001. “A Two-Phase Path Relinking Algorithm for the Generalized Assignment Problem”, 4th International Conference of Metaheuristics, Porto, Portugal, 175-179
  2. Alfandari, L., Plateau, A., Tolla, P. 2002. “A Two-Phase Path Relinking Algorithm for the Generalized Assignment Problem”, Teknik Rapor No: 378, CEDRIC, CNAM
  3. Alfandari, L., Plateau, A., Tolla, P. 2004. “A Path Relinking Algorithm for the Generalized Assignment Problem”, Metaheuristics: Computer Decision-Making, Hazırlayanlar: Resende, M.G.C., Sousa, J.P., Kluwer Academic Publishers, Boston, 1-17
  4. Baştürk, B., Karaboğa, D. 2006. “An Artificial Bee Colony (ABC) Algorithm for Numeric Function Optimization”, IEEE Swarm Intelligence Symposium, Indianapolis, Indiana, USA
  5. Baykasoğlu, A. 2001. “Goal Programming Using the Multiple Objective Tabu Search”, Journal of Operational Research Society, 52(12), 1359-1369
  6. Baykasoğlu, A. 2006. “Applying the Multiple Objective Tabu Search to Continuous Optimization Problems with a Simple Neighborhood Strategy”, International Journal for Numerical Methods in Engineering, 65, 406-424
  7. Baykasoğlu, A., Özbakır, L., Tapkan, P. 2007. “Artificial Bee Colony Algorithm and its Application to Generalized Assignment Problem”, Swarm Intelligence: Focus on Ant and Particle Swarm Optimization, Hazırlayanlar: Chan, F.T.S., Tiwari, M.K., I-Tech Education and Publishing, Vienna, Austria, 113-144
  8. Chong, C.S., Low, M.Y.H., Sivakumar, A.I., Gay, K.L. 2006. “A Bee Colony Optimization Algorithm to Job Shop Scheduling”, 37th Winter Simulation, Monterey, California, 1954-1961
  9. Chu, P.C., Beasley, J.E. 1997. “A Genetic Algorithm for the Generalized Assignment Problem”, Computers Operations Research, 24, 17-23
  10. Diaz, J.A., Fernandez, E. 2001. “A Tabu Search Heuristic for the Generalized Assignment Problem”, European Journal Operational Research, 132, 22-38
  11. Fisher, M.L., Jaikumar, R., Van Wassenhove, L.N. 1986. “A Multiplier Adjustment Method for the Generalized Assignment Problem”, Management Science, 32, 1095- 1103
  12. Karaboğa, D., Baştürk, B. 2007. “A Powerful and Efficient Algorithm for Numerical Function Optimization: Artificial Bee Colony (ABC) Algorithm”, Journal of Global Optimization, 39(3), 459-471
  13. Laguna, M., Kelly, J.P., Gonzalez-Velarde, J.L., Glover, F. 1995. “Tabu Search for the Multilevel Generalized Assignment Problem”, European Journal of Operational Research, 82, 176-189
  14. Lourenço, H.R., Ser