A hybrid cultural algorithm with local search for traveling salesman problem

Yongjun Kim, Sung Bae Cho

Research output: Contribution to conferencePaper

7 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

Fingerprint

Cultural Algorithm
Traveling salesman problem
Travelling salesman problems
Hybrid Algorithm
Local Search
Search Methods
Combinatorial Problems
Integrate
Experimental Results
Local search (optimization)

All Science Journal Classification (ASJC) codes

  • Computational Mathematics

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
Kim, Yongjun ; Cho, Sung Bae. / A hybrid cultural algorithm with local search for traveling salesman problem. Paper presented at 2009 IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA 2009, Daejeon, Korea, Republic of.5 p.
@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",
month = "12",
day = "1",
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",

}

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

A hybrid cultural algorithm with local search for traveling salesman problem. / Kim, Yongjun; Cho, Sung Bae.

2009. 188-192 Paper presented at 2009 IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA 2009, Daejeon, Korea, Republic of.

Research output: Contribution to conferencePaper

TY - CONF

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

AU - Kim, Yongjun

AU - Cho, Sung Bae

PY - 2009/12/1

Y1 - 2009/12/1

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

ER -

Kim Y, Cho SB. A hybrid cultural algorithm with local search for traveling salesman problem. 2009. 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