Buradasınız

Anasayfa » Content

TESİS DÜZENLEMESİ PROBLEMİNDE YEREL ARAMA SEZGİSELİ KULLANAN BİR GENETİK ALGORİTMA : MEMETİK ALGORİTMA YAKLAŞIMI

A GENETIC ALGORITHM USING THE LOCAL SEARCH HEURISTIC IN FACILITIES LAYOUT PROBLEM: A MEMETİC ALGORİTHM APPROACH

Journal Name:

  • Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi

Publication Year:

  • 2002

Key Words:

Keywords (Original Language):

Author NameUniversity of AuthorFaculty of Author
Abstract (2. Language): 
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.
Bookmark/Search this post with
Abstract (Original Language): 
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.
FULL TEXT (PDF): 
PDF icon arastirmax-tesis-duzenlemesi-probleminde-yerel-arama-sezgiseli-kullanan-bir-genetik-algoritma-memetik-algoritma-yaklasimi.pdf
  • 2
265
271
  • Turkish

REFERENCES

References: 

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.
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.
Larranaga, 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.
Larranaga, P., Etxeberria, R., Lozano, J. A. and Pena, 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, 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. Back, editör), 465-472, Morgan Kaufmann, (http://www.informatik.uni-siegen.de/~pmerz).
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. Back, Z. Michalewicz ve X. Yao, editors), 159-164, IEEE Press, (http://www.informatik.uni-siegen.de/~pmerz)
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).
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.
Mirchandani, P. B. and Francis, R. L. 1990. Discrete Location theory, Wiley, New York.
Moscato, P. 1989. On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms, Tech. Rep. Caltech Concurrent Computation Program, Report. 826, California Institute of Technology, Pasadena, California, USA. (ayrıca http://alife.ccp14.ac.uk/memetic/~moscato/papers/bi gone.ps).
Mühlenbein,
H
. 1989. "Parallel Genetic Algorithm Population Dynamics and Combinatorial Optimisation", In: H.Schaffer (ed.): In Proceedings 3rd International Conference on Genetic Algorithms, San Francisco: Morgan Kaufmann,
416-421.
Mühlenbein,
H.
, Schomisch, M. and Born, J. 1991. The Parallel Genetic Algorithm as Function Optimizer, Parallel Computing, 17, 619-632.
Potvin, Y. 1996. Genetic Algorithms for the Travelling Salesman Problem. Annals of Operations
Research, 63, 339-370.
Syswerda, G. 1991. Schedule Optimisation Using Genetic Algorithms, Handbook of Genetic Algorithms, Ed. Davis, L., Van Nostrand Reinhold. QAP-LIB, Quadratic Assignment Problem Library, http://www.opt.math.tu-graz.ac.at/qaplib/.
Tate, D. M. and Smith, A. E. 1995. A Genetic Approach to the Quadratic Assignment Problem. Computers and Operations Research, 22 (1), 73-83.
Whitley, D., Starkweather, T. and Fuguay, D. 1989.
"Scheduling Problems and Travelling Salesman Problem", In Proceedings of the International Conference on Genetic Algorithms, Los Altos, CA: Morgan Kaufmann Pub.

Thank you for copying data from http://www.arastirmax.com