Improvement of the Bees Algorithm for Solving the Traveling Salesman Problems

Murat ŞAHİN

doi:https://doi.org/10.17671/gazibtd.991866

Article Details

Improvement of the Bees Algorithm for Solving the Traveling Salesman Problems

Authors:

Murat ŞAHİN

Publisher:

Gazi University

Main Topics:

Data processing and computer science | Applied physics

Journal:

Journal of Information Technologies 2022 Vol.15 Issue 1, pp.65-74

Document Type:

Article

Publication Date:

1/2022

Document Language:

English

Document ID (Org No.):

2000902304

Frequency:

Quarterly

eISSN:

2147-0715

pISSN:

1307-9697

DOI:

https://doi.org/10.17671/gazibtd.991866

Keywords:

Abstract:

 

The traveling salesman problem (TSP) has been a popular problem studied in the optimization field for a long time. The most successful methods used in solving these difficult problems are metaheuristic algorithms. In this study, an improved version of the bees algorithm is used in the solution of TSPs. In addition to the classical bees algorithm, two different city selection and relocation functions have been developed. With these functions, it is possible to change the location of multiple and variable numbers of cities. These new functions have been added to the continuation of the classical bees algorithm and are used only on the elite site, ensuring that the elite site becomes more elite. Thus, better results could be obtained with less number of iterations and the number of the total evaluation compared to the existing bees algorithm.

 

Gezgin satıcı problemi (GSP), optimizasyon alanında uzun süredir çalışılan popüler bir problemdir. Bu problemlerin çözümünde kullanılan en başarılı yöntemler ise metasezgisel algoritmalardır. Bu çalışmada, GSP'lerin çözümünde Arı Algoritmasının geliştirilmiş bir versiyonu kullanılmıştır. Klasik Arı Algoritmasına ek olarak iki farklı şehir seçimi ve yer değiştirme fonksiyonu geliştirilmiştir. Bu işlevler ile birden fazla ve değişken sayıdaki şehrin yerini değiştirmek mümkündür. Bu yeni fonksiyonlar klasik Arı Algoritmasının devamına eklenerek ve sadece elit bölgede kullanılmış ve bu bölümün daha elit hale gelmesini sağlamıştır. Böylece mevcut Arı Algoritmasına göre, daha az iterasyon ve arama ile daha iyi sonuçlar elde edilmiştir.

Article Details

Improvement of the Bees Algorithm for Solving the Traveling Salesman Problems

Authors:

Murat ŞAHİN

Publisher:

Gazi University

Main Topics:

Data processing and computer science | Applied physics

Journal:

Journal of Information Technologies 2022 Vol.15 Issue 1, pp.65-74

Document Type:

Article

Publication Date:

1/2022

Document Language:

English

Document ID (Org No.):

2000902304

Frequency:

Quarterly

eISSN:

2147-0715

pISSN:

1307-9697

DOI:

https://doi.org/10.17671/gazibtd.991866

Arı Algoritması

gezgin satıcı problemi

çoklu yerleştirme

optimizasyon

Issues

Article Details

Improvement of the Bees Algorithm for Solving the Traveling Salesman Problems

Authors: Murat ŞAHİN

Publisher: Gazi University

Main Topics: Data processing and computer science | Applied physics

Journal: Journal of Information Technologies 2022 Vol.15 Issue 1, pp.65-74

Document Type: Article

Publication Date: 1/2022

Document Language: English

Document ID (Org No.): 2000902304

Frequency: Quarterly

eISSN: 2147-0715

pISSN: 1307-9697

DOI: https://doi.org/10.17671/gazibtd.991866

Arı Algoritması

gezgin satıcı problemi

çoklu yerleştirme

optimizasyon

Issues

Authors:

Murat ŞAHİN

Publisher:

Gazi University

Main Topics:

Data processing and computer science | Applied physics

Journal:

Journal of Information Technologies 2022 Vol.15 Issue 1, pp.65-74

Document Type:

Article

Publication Date:

1/2022

Document Language:

English

Document ID (Org No.):

2000902304

Frequency:

Quarterly

eISSN:

2147-0715

pISSN:

1307-9697

DOI:

https://doi.org/10.17671/gazibtd.991866