A hybrid cultural algorithm with local search for traveling salesman problem

Yongjun Kim; Sung Bae Cho

doi:10.1109/CIRA.2009.5423211

A hybrid cultural algorithm with local search for traveling salesman problem

Yongjun Kim, Sung Bae Cho

College of Computing

Research output: Contribution to conference › Paper › peer-review

10 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 language	English
Pages	188-192
Number of pages	5
DOIs	https://doi.org/10.1109/CIRA.2009.5423211
Publication status	Published - 2009
Event	2009 IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA 2009 - Daejeon, Korea, Republic of Duration: 2009 Dec 15 → 2009 Dec 18

Other

Other	2009 IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA 2009
Country/Territory	Korea, Republic of
City	Daejeon
Period	09/12/15 → 09/12/18

All Science Journal Classification (ASJC) codes

Computational Mathematics

Access to Document

10.1109/CIRA.2009.5423211

Cite this

@conference{f9db714deede40b68629091095029a4d,

title = "A hybrid cultural algorithm with local search for traveling salesman problem",

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.",

author = "Yongjun Kim and Cho, {Sung Bae}",

year = "2009",

doi = "10.1109/CIRA.2009.5423211",

language = "English",

pages = "188--192",

note = "2009 IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA 2009 ; Conference date: 15-12-2009 Through 18-12-2009",

}

TY - CONF

T1 - A hybrid cultural algorithm with local search for traveling salesman problem

AU - Kim, Yongjun

AU - Cho, Sung Bae

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77951173369&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77951173369&partnerID=8YFLogxK

U2 - 10.1109/CIRA.2009.5423211

DO - 10.1109/CIRA.2009.5423211

M3 - Paper

AN - SCOPUS:77951173369

SP - 188

EP - 192

T2 - 2009 IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA 2009

Y2 - 15 December 2009 through 18 December 2009

ER -

A hybrid cultural algorithm with local search for traveling salesman problem

Abstract

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this