A hybrid cultural algorithm with local search for traveling salesman problem

Yongjun Kim, Sung Bae Cho

Research output: Contribution to conferencePaper

8 Citations (Scopus)

Abstract

A new Hybrid Cultural Algorithm with Local Search (HCALS) is introduced to solve Traveling Salesman Problem (TSP). The algorithm integrates the local search method into the cultural algorithm which uses social intelligence to guide and lead individuals in the population. Better solutions can be attained by controlling individuals which are locally optimized by the local search methods. The combination of these two methods can be a promising method for solving the combinatorial problems like TSP. The experimental results show that the proposed algorithm can find better solutions than other methods for TSP in most cases.

Original languageEnglish
Pages188-192
Number of pages5
DOIs
Publication statusPublished - 2009 Dec 1
Event2009 IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA 2009 - Daejeon, Korea, Republic of
Duration: 2009 Dec 152009 Dec 18

Other

Other2009 IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA 2009
CountryKorea, Republic of
CityDaejeon
Period09/12/1509/12/18

All Science Journal Classification (ASJC) codes

  • Computational Mathematics

Fingerprint Dive into the research topics of 'A hybrid cultural algorithm with local search for traveling salesman problem'. Together they form a unique fingerprint.

  • Cite this

    Kim, Y., & Cho, S. B. (2009). A hybrid cultural algorithm with local search for traveling salesman problem. 188-192. Paper presented at 2009 IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA 2009, Daejeon, Korea, Republic of. https://doi.org/10.1109/CIRA.2009.5423211