CANLI
Yükleniyor Veriler getiriliyor…
/ Makaleler / Scopus Detay
Scopus 🔓 Açık Erişim YÖKSİS Eşleşti

A discrete tree-seed algorithm for solving symmetric traveling salesman problem

Engineering Science and Technology, an International Journal · Ağustos 2020

YÖKSİS DOI Eşleşmesi Bulundu

Bu Scopus makalesi YÖKSİS veritabanında da kayıtlı. Aşağıda YÖKSİS verilerini görebilirsiniz.

YÖKSİS Kayıtları
A discrete tree-seed algorithm for solving symmetric traveling salesman problem
Engineering Science and Technology-An International Journal-JESTECH · 2020 SCI-Expanded
DOÇENT AHMET CEVAHİR ÇINAR →

Makale Bilgileri

DergiEngineering Science and Technology, an International Journal
Yayın TarihiAğustos 2020
Cilt / Sayfa23 · 879-890
DOI10.1016/j.jestch.2019.11.005
Scopus ID2-s2.0-85076524418
Erişim🔓 Açık Erişim
Özet Tree-Seed algorithm (TSA) is a recently developed nature inspired population-based iterative search algorithm. TSA is proposed for solving continuous optimization problems by inspiring the relations between trees and their seeds. The constrained and binary versions of TSA are present in the literature but there is no discrete version of TSA which decision variables represented as integer values. In the present work, the basic TSA is redesigned by integrating the swap, shift, and symmetry transformation operators in order to solve the permutation-coded optimization problems and it is called as DTSA. In the basic TSA, the solution update rules can be used for the decision variables whose are defined in continuous solution space, this rules are replaced with the transformation operators in the proposed DTSA. In order to investigate the performance of DTSA, well-known symmetric traveling salesman problems are considered in the experiments. The obtained results are compared with well-known metaheuristic algorithms and their variants, such as Ant Colony Optimization (ACO), Genetic Algorithm (GA), Simulated Annealing (SA), State Transition Algorithm (STA), Artificial Bee Colony (ABC), Black Hole (BH), and Particle Swarm Optimization (PSO). Experimental results show that DTSA is another qualified and competitive solver on discrete optimization.

Yazarlar (3)

1
Ahmet Cevahir Cinar
2
Sedat Korkmaz
3
Mustafa Kiran

Anahtar Kelimeler

Discrete optimization Metaheuristic Transformation operator Traveling salesman problem Tree seed algorithm

Kurumlar

Konya Division
Konya Turkey
Konya Technical University
Konya Turkey

Metrikler

58
Atıf
3
Yazar
5
Anahtar Kelime

Sistemimizdeki Yazarlar

AÇ
AHMET CEVAHİR ÇINAR
DOÇENT

Hızlı Erişim

DOI ile aç Scopus'ta aç Makaleler listesi