Discrete cuckoo search for traveling salesman problem

Gilang Kusuma Jati, Hisar Maruli Manurung, Suyanto

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

35 Citations (Scopus)

Abstract

Cuckoo search (CS) belongs to a class of novel nature-inspired algorithm inspired by the obligate brood parasitism of some cuckoo species by laying their eggs in the nests of other host birds (of other species). CS has been successfully applied to solve continuous optimization problems, however, its potential in discrete problems has not been sufficiently explored. Basing on the present algorithm of CS, this paper construct an discrete cuckoo search (DCS) to solve traveling salesman problem (TSP). Two schemes are studied, i.e. discrete step size and the cuckoo's updating scheme. DCS is evaluated on the TSP problem, comparing performance to other methods. Experimental results shows that the proposed algorithm performs very well to solve some simple TSP instances, but it can be trapped into local optimum solutions for some other instances.

Original languageEnglish
Title of host publicationProceedings - 2012 7th International Conference on Computing and Convergence Technology (ICCIT, ICEI and ICACT), ICCCT 2012
Pages993-997
Number of pages5
Publication statusPublished - 1 Dec 2012
Event2012 7th International Conference on Computing and Convergence Technology (ICCIT, ICEI and ICACT), ICCCT 2012 - Seoul, Korea, Republic of
Duration: 3 Dec 20125 Dec 2012

Publication series

NameProceedings - 2012 7th International Conference on Computing and Convergence Technology (ICCIT, ICEI and ICACT), ICCCT 2012

Conference

Conference2012 7th International Conference on Computing and Convergence Technology (ICCIT, ICEI and ICACT), ICCCT 2012
Country/TerritoryKorea, Republic of
CitySeoul
Period3/12/125/12/12

Fingerprint

Dive into the research topics of 'Discrete cuckoo search for traveling salesman problem'. Together they form a unique fingerprint.

Cite this