SavedAdd your journal

Journals / Çukurova Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi / 2013 / Cilt: 17 - Sayı: 2

Metaheuristic Methods and Their Application Areas

Metasezgisel Yöntemler ve Uygulama Alanları

Aytuğ ONAN
Pages
113–128
Publication Date
2013-12-01
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, primary application areas of metaheuristic methods are presented.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Metaheuristic methods are approximate algorithms that produce efficient and appropriate solutions in an acceptable time for complex optimization problems to which conventional optimization algorithms are not able to provide an acceptable solution.
📊
Key Findings & Data:Metaheuristic methods can provide efficient solutions to many different problems, such as scheduling, routing, timetabling, graph coloring owing to being easily adjustable to different problems.
💡
Conclusion & Impact:In addition, primary application areas of metaheuristic methods are presented.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Metasezgisel Yöntemler · Eniyileme · Uygulama Alanları

Abstract

Metaheuristic methods are approximate algorithms that produce efficient and appropriate solutions in an acceptable time for complex optimization problems to which conventional optimization algorithms are not able to provide an acceptable solution. Metaheuristic methods can provide efficient solutions to many different problems, such as scheduling, routing, timetabling, graph coloring owing to being easily adjustable to different problems. In this study, metaheuristic methods are classified as single solution based metaheuristic methods and population based metaheuristic methods based on solution number in search and the main algorithms of each class are introduced. In addition, primary application areas of metaheuristic methods are presented.

Özet

Metasezgisel yöntemler, geleneksel eniyileme yöntemlerinin kabul edilebilir bir çözüm üretemediği karmaşık eniyileme problemleri için kabul edilebilir bir zaman diliminde etkin ve uygun çözümler üretebilen yaklaşık algoritmalardır. Metasezgisel yöntemler, farklı problemlere kolayca uyarlanabilmeleri sayesinde çizelgeleme, rotalama, zaman planlama, çizge boyama gibi birçok farklı probleme etkin çözümler getirebilmektedir. Bu çalışma kapsamında, metasezgisel yöntemler, arama çözüm sayısına dayalı olarak, tek çözüme dayalı ve toplum tabanlı metasezgisel yöntemler olarak sınıflandırılmış ve bu sınıflar içerisinde incelenebilecek temel algoritmalar tanıtılmıştır. Ayrıca, metasezgisel yöntemlerin başlıca uygulama alanları sunulmuştur.

🔖

Cite This Article

ONAN, A. (2013). Metaheuristic Methods and Their Application Areas. Çukurova Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi, Cilt: 17 - Sayı: 2, 113–128. https://ajindex.com/articles/828163

📄 Full Text PDF Viewer

📄

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

References (17)

  1. Birattari, M., Paquette, L., Stützle, T. ve Varrentrapp, K. (2001) “Classification of Metaheuristics and Design of Experiments for the Analysis of Components” Teknik Rapor, AIDA-01-05.
  2. Blum, C. ve Roli, A. (2003) “Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison”, ACM Computing Surveys, 35(3):268-308.
  3. Brownlee, J. (2011) “Clever Algorithms: Nature-Inspired Programming Recipes”, 1st Edition,
  4. Lulu Enterprises. Busetti, F. (2013) “Simulated Annealing Overview”, http://163.18.62.64/wisdom/ Simulated% 20 annealing%20overview.pdf, (11.09.2013).
  5. Crainic, T.G. ve Toulouse, M. (2003) “Parallel Strategies for Meta-heuristics” Glover et al. (eds) Handbook of Metaheuristics, Kluwer Academic Publishers.
  6. Dorigo, M., DiCaro, G. ve Gambardella, L. (1999) “Ant Algorithms for Discrete Optimization”, Artificial Life, 5:137-172.
  7. Dorigo, M. ve Gambardella, L. (1997) “Ant Colonies for the Travelling Salesman Problem”, Biosystems, 43(2):73-81.
  8. Dorigo, M. ve Stützle, T. (2004) “Ant Colony Optimization”, Cambridge, MIT Press.
  9. Dumitrescu, I. ve Stützle, T. (2003) “Combinations of Local Search and Exact Algorithms”, Cagnoni et al. (eds) Applications of Evolutionary Computing, Springer. Eglese, R.W. (1990) “Simulated Anneling: A Tool for Operational Research”, European Journal of Operational Research, 46:271-281.
  10. Engelbrecht, A. (2007) “Computational Intelligence: An Introduction”, 2nd Edition,
  11. Wiley. Gendreau, M. (2003) “An Introduction to Tabu Search” Glover et al. (eds) Handbook of Metaheuristics, Kluwer Academic Publishers.
  12. Glover, F. (1990) “Tabu Search: A Tutorial”, Interfaces, 20:74-94.
  13. Goffe, W.L., Ferrier, G.D. ve Rogers, J. (1994) “Global Optimization of Statistical Functions with Simulated Annealing”, Journal of Econometrics, 60(1-2):65- 99. Grosan, C., Abraham, A. ve Chis, M. (2006) “Swarm Intelligence in Data Mining” Abraham et al. (eds) Swarm Intelligence in Data Mining, Springer. Henderson, D., Jacobson, S.H. ve Johson, A.W. (2003) “The Theory and Practice of Simulated Annealing” Glover et al. (eds) Handbook of Metaheuristics, Kluwer Academic Publishers.
  14. Kirkpatrick, S., Gelatt, C. ve Vecchi, M.P. (1983) “Optimization by Simulated Annealing”, Science, 220(4598):671-680.
  15. Larose, D.T. (2006) “Data Mining Methods and Models”, 1st Edition,
  16. Wiley. Lourenço, H.R., Martin, O.C. ve Stützle, T. (2003) “Iterated Local Search” Glover et al. (eds) Handbook of Metaheuristics, Kluwer Academic Publishers.
  17. Michiels, W., Aarts, E. ve Korst, J. (2007) “T