SavedAdd your journal

Journals / Mühendislik Bilimleri Dergisi / 2002 / Cilt: 8 - Sayı: 2

A genetic algorithms using the local search heuristic in facilities layout problem: A memetic algorithm approach

Tesis düzenlemesi probleminde yerel arama sezgiseli kullanan bir genetik algoritma: Memetik algoritma yaklaşımı

Orhan TÜRKBEY
Pages
265–271
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)

The developed memetic algorithm is applied on test problems taken from QAP-LIB, the results are compared with the present techniques in the literature.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Memetic algorithms, which use local search techniques, are hybrid structured algorithms like genetic algorithms among evolutionary algorithms.
📊
Key Findings & Data:In this study, for Quadratic Assignment Problem (QAP), a memetic structured algorithm using a local search heuristic like 2-opt is developed.
💡
Conclusion & Impact:The developed memetic algorithm is applied on test problems taken from QAP-LIB, the results are compared with the present techniques in the literature.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

Memetic algorithms, which use local search techniques, are hybrid structured algorithms like genetic algorithms among evolutionary algorithms. In this study, for Quadratic Assignment Problem (QAP), a memetic structured algorithm using a local search heuristic like 2-opt is developed. Developed in the algorithm, a crossover operator that has not been used before for QAP is applied whereas, Eshelman procedure is used in order to increase the solution variability. The developed memetic algorithm is applied on test problems taken from QAP-LIB, the results are compared with the present techniques in the literature.

Özet

Memetik Algoritmalar (MA), evrimsel algoritmalar içinde Yerel Arama (YA) tekniklerini kullanan ve Genetik Algoritma (GA)'lara benzeyen melez (hibrid) yapılı algoritmalardır. Bu çalışmada, Kuadratik Atama Problemi (KAP) için 2-opt benzeri bir YA sezgiseli kullanan memetik yapılı bir algoritma geliştirilmiştir. Geliştirilen MA'da KAP için daha önce kullanılmamış bir çaprazlama operatörü uygulanmış, çözüm çeşitliliğini artırmak için ise Eshelman prosedüründen yararlanılmıştır. Geliştirilen MA, QAP-LIB'den alınan test problemler üzerinde denenerek, sonuçlar literatürdeki mevcut teknikler ile karşılaştırılmıştır.

🔖

Cite This Article

TÜRKBEY, O. (2002). A genetic algorithms using the local search heuristic in facilities layout problem: A memetic algorithm approach. Mühendislik Bilimleri Dergisi, Cilt: 8 - Sayı: 2, 265–271. https://ajindex.com/articles/289291

📄 Full Text PDF Viewer

📄

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

References (8)

  1. Ahuja, R. K., Orlin, J. B. and Tiwari, A. 2000. A Greedy Genetic Algorithm For the Quadratic Assignment Problem, Computers and Operations Research. 27, 917-934.
  2. Davis, L. 1985. “Job-Shop Scheduling With Genetic Algorithms”, In Proceedings of the Second International Conference on Genetic Algorithms, Mahwah, NJ. Garey, M.R. and Johnson, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP- Completeness, Freeman, New York. Goldberg, D. Linge, R. 1985. “Alleles, loci andthe travelling salesman problem”, In Proceedings of the Second International Conference on Genetic Algorithms, Mahwah, NJ. Grefenstette, J. J. 1997. “Lamarckian learning in multi-agent environments”, In Proceedings of the Fourth International Conference on Genetic Algorithms, San Diego, CA, 303-310. Larrañaga, P., Kuijpers, C. M. H., Murga, R. H., Inza, I. and Dizdarevic, S. 1999a. Genetic algorithms for the Travelling Salesman Problem: A review of representations and operators, Artificial Intelligence Review. 13, 129-170. Larrañaga, P., Etxeberria, R., Lozano, J. A. and Peña, J. M. 1999b. “A Review of the Cooperation Between Evolutionary Computation and Probabilistic Graphical Models”, In Second Symposium on Artificial Intelligence, Adaptive Systems, CIMAF’99, 314-319,
  3. La Habana. Merz, P. and Freisleben, B. 1997a. “A Genetic Local Search Approach to the Quadratic Assignment Problem”, In Proceedings of the 7th International Conference on Genetic Algorithms, (T. Bäck, editör), 465-472, Morgan Kaufmann, (http://www.informatik.uni-siegen.de/~pmerz).
  4. Merz, P. and Freisleben, B. 1997b. “Genetic Local Search For the TSP: New Results”, In Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, (T. Bäck, Z. Michalewicz ve X. Yao, editors), 159-164, IEEE Press, (http://www.informatik.uni-siegen.de/~pmerz)
  5. Merz, P. and Freisleben, B. 1999. “A Comparison of Memetic Algorithms, Tabu search, and Ant Colonies for the Quadratic Assignment Problem”, In Proceedings of the 1999 International Genetic and Evolutionary Computation Conference (GECCO ’99), Morgan Kaufmann, 417-424. (http://www.informatik.uni-siegen.de/~pmerz).
  6. Miagkikh, V., Topchy, A., Kureichik, V. and Tetelbaum, A. 1996. “Combined Genetic and Local Search Algorithm For the Quadratic Assignment Problem”, In Proceedings of IC on Evolutionary Computation and Its Applications, EvCA’96, Moscow, June 1996, 335-341.
  7. Mirchandani, P. B. and Francis, R. L. 1990.
  8. Discrete Location theory, Wiley, New York. Moscato,