AN IMPROVED ARTIFICIAL BEE COLONY ALGORITHM WITH LOCAL SEARCH FOR TRAVELING SALESMAN PROBLEM

Küçük Resim Yok

Tarih

2014

Dergi Başlığı

Dergi ISSN

Cilt Başlığı

Yayıncı

TAYLOR & FRANCIS INC

Erişim Hakkı

info:eu-repo/semantics/closedAccess

Özet

This study aims to solve the traveling salesman problem for small, medium, and large traveling salesman problems taken from the TSPLIB with known solutions, by using an improved artificial bee colony algorithm that is a swarm intelligence-based heuristic algorithm. The improvement process is achieved by using a loyalty function that is used in bee colony optimization as a fitness function used in ABC algorithms. Obtained solutions are compared to solutions from the TSPLIB and the results of cunkas and ozsaglam's (2009) study, which includes the solutions for benchmark problems and cities and counties in Turkey according to the genetic algorithm and particle swarm optimization.

Açıklama

Anahtar Kelimeler

traveling salesman problem, opt-2 local search, artificial bee colony algorithm, opt-2 local search

Kaynak

CYBERNETICS AND SYSTEMS

WoS Q Değeri

Q3

Scopus Q Değeri

Q3

Cilt

45

Sayı

8

Künye