Journals / Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi / 2006 / Cilt: 21 - Sayı: 4

Global ant colony optimization

Global karınca kolonisi optimizasyonu

Pages
689–698
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)

Computer solutions demonstrate that GACO is a good alternative solution method for solving LSP.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:This paper presents a new metaheuristic approach called Global Ant Colony Optimization (GACO).
📊
Key Findings & Data:GACO differs from the other ACO techniques that ants don’t need to visit all nodes or don’t complete the tour.
💡
Conclusion & Impact:Computer solutions demonstrate that GACO is a good alternative solution method for solving LSP.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

This paper presents a new metaheuristic approach called Global Ant Colony Optimization (GACO). GACO differs from the other ACO techniques that ants don’t need to visit all nodes or don’t complete the tour. GACO is developed to solve lot sizing problem. GACO is able to find new alternative solution by starting any node and visiting one or more nodes. There is no local pheromone update in GACO. Global pheromone update and ant’s path choice is carried out by using complete path information. GACO has been applied to solve various size of one item LSP. Computer solutions demonstrate that GACO is a good alternative solution method for solving LSP.

Özet

Bu çalışmada, Global Karınca Kolonisi Algoritması (Global Ant Colony Optimization) (GACO) adı verilen yeni bir karınca kolonisi optimizasyon tekniği anlatılmaktadır. Geliştirilmiş birçok karınca kolonisi optimizasyonu (Ant Colony Optimization) (ACO) sisteminden farklı olarak, karıncaların tam bir tur yapma ya da tüm düğümlere uğrama zorunlulukları yoktur. Özellikle sipariş büyüklüğü problemlerine (Lot Sizing Problem) (LSP) alternatif bir çözüm önerisi olarak geliştirilen GACO’da, herhangi bir düğümden başlayarak ve herhangi bir ya da birden fazla düğüme uğrayarak bir çözüm alternatifi geliştirmek mümkündür. Mevcut ACO’lardan ayrıldığı en temel bir diğer fark ise bölgesel feromon güncellemesinin olmayışıdır. Feromon güncellemesi ve karıncaların yol seçimi yolun tamamı dikkate alınarak gerçekleştirilmektedir. GACO, literatürdeki farklı tip ve boyutlardaki LSP’ne uygulanmıştır. Sonuçlar GACO’nun hem sonuçlar hem de süreler açısından LSP’nin çözümüne iyi bir alternatif olduğunu göstermektedir.

🔖

Cite This Article

SÖYLER, H., KESKİNTÜRK, T. (2022). Global ant colony optimization. Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi, Cilt: 21 - Sayı: 4, 689–698. https://ajindex.com/articles/524141

📄 Full Text PDF Viewer

📄

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

References (15)

  1. Dorigo, M., Gambardella, L.M., “Ant Colonies for the Travelling Salesman Problem”, Biosystems, 43 (2), 73–81, 1997
  2. Dorigo, M., Gambardella L.M., “Ant Colonies for the Traveling Salesman Problem”, TR/IRIDIA/3, Universite´ Libre de Bruxelles Belgium, 1996
  3. Dorigo, M., Gambardella L.M., “Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem”, TR/IRIDIA/5, Universite´ Libre de Bruxelles Belgium, 1996
  4. Maniezzo, V., Gambardella L.M., De Luigi, F., “Ant Colony Optimization”, New optimization techniques in engineering, Springer, Heidelberg, Germany, 101–121, 2004
  5. Dorigo, M., Maniezzo, V., Colorni, A., “The Ant System: Optimization by a Colony of Cooperating Agents”, IEEE Trans. Systems Man Cybernetics, B 26: 29–42, 1996
  6. Colorni, A., Dorigo, M., Maniezzo., V., “An Investigation of Some Properties of an “Ant Algorithm”, In Proceedings of the Paralel Problem Solving from Nature Conference, Elsevier Publishing, Brussels, Belgium, 509–520, 1992
  7. Gambardella, L.M., Dorigo, M., “Ant-Q: A Reinforcement Learning Approach to the Travelling Salesman Problem”, Proceedings of the Twelfth International Conference on Machine Learning, California, USA, 1995
  8. Bullnheimer B., Hartl R.F., Strauss C., “A New Rank Based Version of the Ant System: A Computational Study”, Central European Journal for Operations Research and Economics, 1997
  9. Dorigo, M., Gambardella, L.M., “Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem”, IEEE Transaction on Evolutionary Computation, 1, 53-66, 1997
  10. Stützle, T., Hoos, H.H., “Max Min Ant System”, Journal of Future Generation Computer Systems, 8 (16), 889–914, 2000
  11. Tsai C.F., Tsai C. W., Tseng, C.C., “A New Hybrid Heuristic Approach for Solving Large Traveling Salesman Problem”, Information Sciences, 166(1-4), 67-81, 2004
  12. Gambardella L., Taillard, E.D., Agazzi, G., “MACS-VRPT: A Multiple Ant Colony System with for Vehicle Routing Problems with Time Windows”, New Ideas in Optimization, Ed.: Corne, D., Dorigo, M., Glover, F., Mc Graw-Hill, 63-76
  13. Middendorf, M., Reischle, F., Schmeck, H., “Multi Colony Ant Algorithms”, Journal of Heuristics, 8- 3, ABI/INFORM Global, 305-320, 2002
  14. Randall M., “A Parallel Implementation of Ant Colony Optimization”, Journal of Parallel and Distributed Computing, 62, 1421–1432, 2002
  15. Bullnheimer, B., Hartl, R.F., Strauss, C., “An Improved Ant System Algorithm For The Vehicle Routing Problem”, Ann. Oper. R