SavedAdd your journal

Journals / İzmir İktisat Dergisi / 2019 / Cilt: 34 - Sayı: 2

Investigation Of Crossover Operators Using Genetic Algorithms In The Solution Of The Traveling Salesman Problem Based On Case Studies

Gezgin Satıcı Probleminin Genetik Algoritmalar Kullanarak Çözümünde Çaprazlama Operatörlerinin Örnek Olaylar Bazlı İncelenmesi

Meryem PULAT
İpek DEVECİ KOCAKOÇ
Pages
225–243
Publication Date
2019-06-30
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)

Studies in the literature have been examined in a wide range of contexts (based on keyword and year), and the sample events and the results have been analyzed.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:The Traveling salesman problem is a difficult (NP-hard) problem that has been studied intensively by researchers and academics in the field of optimization for many years.
📊
Key Findings & Data:Genetic algorithms are one of the best methods used to solve various NP-hard problems, such as TSP (traveling salesman problem).
💡
Conclusion & Impact:Studies in the literature have been examined in a wide range of contexts (based on keyword and year), and the sample events and the results have been analyzed.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Gezgin Satıcı Problemi · Genetik Algoritmalar · Çaprazlama operatörü

Abstract

The Traveling salesman problem is a difficult (NP-hard) problem that has been studied intensively by researchers and academics in the field of optimization for many years. Genetic algorithms are one of the best methods used to solve various NP-hard problems, such as TSP (traveling salesman problem). Many crossover operators have been proposed for the tsp problem and new ones have been proposed in each study. Our aim in this study is to guide the researchers who want to work on this subject by taking out a detailed inventory of the TSPLIB case studies and the crossover operators that are used in the studies that are investigating the tsp solution. Studies in the literature have been examined in a wide range of contexts (based on keyword and year), and the sample events and the results have been analyzed.

Özet

Gezgin satıcı problemi, optimizasyon alanında araştırmacı ve akademisyenler tarafından üzerinde uzun yıllardır yoğun olarak çalışılan çözümü zor (NP-hard) bir problemdir. Genetik algoritmalar GSP (gezgin satıcı problemi) gibi çeşitli NP-hard problemleri çözmek için kullanılan en iyi yöntemlerden biridir. GSP problemi için çok sayıda çaprazlama operatörü önerilmiştir ve her çalışmada yenileri önerilmeye devam etmektedir. Bu çalışmanın amacı GSP çözümünü araştıran çalışmalarda kullanılan TSPLIB örnek olaylarının ve incelenen çaprazlama operatörlerinin detaylı bir envanterini çıkarmak ve bu konuda çalışmak isteyen araştırmacılara yön göstermektir. Literatürdeki çalışmalar geniş bir kapsamda (anahtar kelime ve yıl bazında) incelenerek ortak kullanılan örnek olayların ve bulunan sonuçların analizi yapılarak tablolaştırılmıştır.

🔖

Cite This Article

PULAT, M., KOCAKOÇ, İ. D. (2019). Investigation Of Crossover Operators Using Genetic Algorithms In The Solution Of The Traveling Salesman Problem Based On Case Studies. İzmir İktisat Dergisi, Cilt: 34 - Sayı: 2, 225–243. https://ajindex.com/articles/29881

📄 Full Text PDF Viewer

📄

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

References (10)

  1. ABDEL-MOETTY, S. M., HEAKIL, A. O. (2012), “Enhanced Traveling Salesman Problem Solving Using Genetic Algorithm Technique with Modified Sequential Constructive Crossover Operator”, International Journal of Computer Science and Network Security (IJCSNS), 12(6), 134. ABDOUN, O., ABOUCHABAKA, J., TAJANI, C. (2012), “Analyzing the Performance of Mutation Operators to Solve the Travelling Salesman Problem”, International Journal of Emerging Sciences, 2(1), 61-77.
  2. AFFENZELLER, M., WAGNER, S. (2003), “A Self-Adaptive Model for Selective Pressure Handling Within the Theory of Genetic Algorithms”, In International Conference on Computer Aided Systems Theory, 384-393.
  3. AFFENZELLER, M., WAGNER, S. (2003, June), “SASEGASA: An Evolutionary Algorithm for Retarding Premature Convergence by Self-Adaptive Selection Pressure Steering”, In International Work-Conference on Artificial Neural Networks, 438-445.
  4. Springer, Berlin, Heidelberg. AFFENZELLER, M., WAGNER, S. (2004), “Reconsidering the Selection Concept of Genetic Algorithms from A Population Genetics Inspired Point of View”, Cybernetics and Systems, 701–706.
  5. AGARWAL, T., SINGH, K. (2013), “Using New Variation Crossover Operator of Genetic Algorithm for Solving the Traveling Salesmen Problem”, MIT International Journal of Computer Science and Information Technology, 3(1), 35-37.
  6. AHMED, Z. H. (2010), “Genetic Algorithm for the Traveling Salesman Problem using Sequential Constructive Crossover Operator”, International Journal of Biometrics & Bioinformatics (IJBB), 3(6), 96–105.
  7. ALLAOUA, H., BRAHIM, B. (2015), “A Mono Crossover Genetic Algorithm for TSP”, Global Journal on Technology, Issue 7 (2015): 4th World Conference on Innovation and Computer Sciences (INSODE-2014).
  8. AMOUS, S. K., LOUKIL, T., ELAOUD, S., DHAENENS, C. (2008), “A New Genetic Algorithm Applied to the Traveling Salesman Problem”, International Journal of Pure and Applied Mathematics, 48(2), 1-16.
  9. CHAWLA, G., BALA, M. Y. (2014), “Solving Optimization Problem by Hybrid Genetic Algorithm Using Hill Climbing in Replacement Operator”, Journal of Recent Research Aspects, 2(4), 73-78.
  10. CHEN, S., SMITH, S. F. (1996), “Commonality And Genetic Algorithms”, Carnegie Mellon University, The Robotics Institute. CONTRERAS-BOLTON, C., PARADA, V. (2015), “Automatic Combination of Operators in a Genetic Algorithm to Solve the Traveling Salesman Problem”, PloS one, 10(9). ÇOLAK, S. (2010), “Genetik Algoritmalar Yardımı ile Gezgin Satıcı Probleminin Çözümü Üzerine Bir Uygulama