Smallest Position Value Approach

Tasgetiren, Fatih; Chen, Angela; Gencyilmaz, Gunes; Gattoufi, Said

doi:10.1007/978-3-540-92151-6_5

Smallest Position Value Approach

Tasgetiren F., Chen A., Gencyilmaz G., Gattoufi S.

DIFFERENTIAL EVOLUTION: A HANDBOOK FOR GLOBAL PERMUTATION BASED COMBINATORIAL OPTIMIZATION, cilt.175, ss.121-138, 2009 (SCI-Expanded)

Yayın Türü: Makale / Tam Makale
Cilt numarası: 175
Basım Tarihi: 2009
Doi Numarası: 10.1007/978-3-540-92151-6_5
Dergi Adı: DIFFERENTIAL EVOLUTION: A HANDBOOK FOR GLOBAL PERMUTATION BASED COMBINATORIAL OPTIMIZATION
Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
Sayfa Sayıları: ss.121-138
İstanbul Kültür Üniversitesi Adresli: Evet

Özet

In a traveling salesman problem, if the set of nodes is divided into clusters for a single node from each cluster to be visited, then the problem is known as the generalized traveling salesman problem (GTSP). Such problem aims to find a tour with minimum cost passing through only a single node from each cluster. In attempt to show how a continuous optimization algorithm can be used to solve a discrete/combinatorial optimization problem, this chapter presents a standard continuous differential evolution algorithm along with a smallest position value (SPV) rule and a unique solution representation to solve the GTSP. The performance of the differential evolution algorithm is tested on a set of benchmark instances with symmetric distances ranging from 51 (11) to 442 (89) nodes (clusters) from the literature. Computational results are presented and compared to a random key genetic algorithm (RKGA) from the literature.