A hierarchic approach based on swarm intelligence to solve the traveling salesman problem

Mesut GÜNDÜZ; Mustafa Servet KIRAN; Eren ÖZCEYLAN

Makale detayları

A hierarchic approach based on swarm intelligence to solve the traveling salesman problem

Yazarlar:

Mesut GÜNDÜZ | Mustafa Servet KIRAN | Eren ÖZCEYLAN

Yayıncı:

TUBITAK

Dergi:

Turkish Journal of Electrical Engineering and Computer Science 2015 Vol.23 Issue 1, pp.103-117

Belge Tipi:

Makale

Yayın Tarihi:

3/2015

Belge Dili:

Türkçe

Document ID (Org No.):

2000742734

Sıklık:

İki Aylık

eISSN:

1303-6203

pISSN:

1300-0632

Özet:

 

The purpose of this paper is to present a new hierarchic method based on swarm intelligence algorithms for solving the well-known traveling salesman problem. The swarm intelligence algorithms implemented in this study are divided into 2 types: path construction-based and path improvement-based methods. The path construction-based method (ant colony optimization (ACO)) produces good solutions but takes more time to achieve a good solution, while the path improvement-based technique (artificial bee colony (ABC)) quickly produces results but does not achieve a good solution in a reasonable time. Therefore, a new hierarchic method, which consists of both ACO and ABC, is proposed to achieve a good solution in a reasonable time. ACO is used to provide a better initial solution for the ABC, which uses the path improvement technique in order to achieve an optimal or near optimal solution. Computational experiments are conducted on 10 instances of well-known data sets available in the literature. The results show that ACO-ABC produces better quality solutions than individual approaches of ACO and ABC with better central processing unit time.

 

The purpose of this paper is to present a new hierarchic method based on swarm intelligence algorithms for solving the well-known traveling salesman problem. The swarm intelligence algorithms implemented in this study are divided into 2 types: path construction-based and path improvement-based methods. The path construction-based method (ant colony optimization (ACO)) produces good solutions but takes more time to achieve a good solution, while the path improvement-based technique (artificial bee colony (ABC)) quickly produces results but does not achieve a good solution in a reasonable time. Therefore, a new hierarchic method, which consists of both ACO and ABC, is proposed to achieve a good solution in a reasonable time. ACO is used to provide a better initial solution for the ABC, which uses the path improvement technique in order to achieve an optimal or near optimal solution. Computational experiments are conducted on 10 instances of well-known data sets available in the literature. The results show that ACO-ABC produces better quality solutions than individual approaches of ACO and ABC with better central processing unit time.

Makale detayları

A hierarchic approach based on swarm intelligence to solve the traveling salesman problem

Yazarlar: Mesut GÜNDÜZ | Mustafa Servet KIRAN | Eren ÖZCEYLAN

Yayıncı: TUBITAK

Dergi: Turkish Journal of Electrical Engineering and Computer Science 2015 Vol.23 Issue 1, pp.103-117

Belge Tipi: Makale

Yayın Tarihi: 3/2015

Belge Dili: Türkçe

Document ID (Org No.): 2000742734

Sıklık: İki Aylık

eISSN: 1303-6203

pISSN: 1300-0632

Sayı

Yazarlar:

Mesut GÜNDÜZ | Mustafa Servet KIRAN | Eren ÖZCEYLAN

Yayıncı:

TUBITAK

Dergi:

Turkish Journal of Electrical Engineering and Computer Science 2015 Vol.23 Issue 1, pp.103-117

Belge Tipi:

Makale

Yayın Tarihi:

3/2015

Belge Dili:

Türkçe

Document ID (Org No.):

2000742734

Sıklık:

İki Aylık

eISSN:

1303-6203

pISSN:

1300-0632