본문 바로가기
  • Home

Ant Algorithm for the Travelling Salesman Problem: Finding the Better Alpha and Beta Values

  • Journal of Knowledge Information Technology and Systems
  • Abbr : JKITS
  • 2010, 5(5), pp.191-199
  • Publisher : Korea Knowledge Information Technology Society
  • Research Area : Interdisciplinary Studies > Interdisciplinary Research
  • Published : October 31, 2010

HWANG SU CHEOL 1 Cho, Sang Yeop 2

1인하공업전문대학
2청운대학교

Candidate

ABSTRACT

This paper proposes the better parameter finding method which is able to search the optimal solution(minimization of travel distance) by applying ant algorithms to TSP. In order to solve it we define the five types of city distribution, 363combinations of parameters, and for each types of city distribution, make ten city group consisted of 30 cities. And then applying ant algorithm which used the combination of parameters to the city group, we can find 39 better parameters which can use in all types of city distribution commonly.

Citation status

* References for papers published after 2023 are currently being built.