KJCKorea
Journal Central

@article{ART001538253},
author={이승관 and Kang, Myung-Ju},
title={Ant Colony System for solving the traveling Salesman Problem Considering the Overlapping Edge of Global Best Path},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2011},
volume={16},
number={3},
pages={203-210}

TY - JOUR
AU - 이승관
AU - Kang, Myung-Ju
TI - Ant Colony System for solving the traveling Salesman Problem Considering the Overlapping Edge of Global Best Path
JO - Journal of The Korea Society of Computer and Information
PY - 2011
VL - 16
IS - 3
PB - The Korean Society Of Computer And Information
SP - 203
EP - 210
SN - 1598-849X
AB - Ant Colony System is a new meta heuristics algorithms to solve hard combinatorial optimization problems. It is a population based approach that uses exploitation of positive feedback as well as greedy search. It was first proposed for tackling the well known Traveling Salesman Problem. In this paper, we propose the searching method to consider the overlapping edge of the global best path of the previous and the current. This method is that we first determine the overlapping edge of the global best path of the previous and the current will be configured likely the optimal path. And, to enhance the pheromone for the overlapping edges increases the probability that the optimal path is configured. Finally, the performance of Best and Average-Best of proposed algorithm outperforms ACS-3-opt, ACS-Subpath and ACS-Iter algorithms.
KW - Ant Colony System;Traveling Salesman Problem;Optimization;Meta Heuristic
DO -
UR -
ER -

이승관 and Kang, Myung-Ju. (2011). Ant Colony System for solving the traveling Salesman Problem Considering the Overlapping Edge of Global Best Path. Journal of The Korea Society of Computer and Information, 16(3), 203-210.

이승관 and Kang, Myung-Ju. 2011, "Ant Colony System for solving the traveling Salesman Problem Considering the Overlapping Edge of Global Best Path", Journal of The Korea Society of Computer and Information, vol.16, no.3 pp.203-210.

이승관, Kang, Myung-Ju "Ant Colony System for solving the traveling Salesman Problem Considering the Overlapping Edge of Global Best Path" Journal of The Korea Society of Computer and Information 16.3 pp.203-210 (2011) : 203.

이승관, Kang, Myung-Ju. Ant Colony System for solving the traveling Salesman Problem Considering the Overlapping Edge of Global Best Path. 2011; 16(3), 203-210.

이승관 and Kang, Myung-Ju. "Ant Colony System for solving the traveling Salesman Problem Considering the Overlapping Edge of Global Best Path" Journal of The Korea Society of Computer and Information 16, no.3 (2011) : 203-210.

이승관; Kang, Myung-Ju. Ant Colony System for solving the traveling Salesman Problem Considering the Overlapping Edge of Global Best Path. Journal of The Korea Society of Computer and Information, 16(3), 203-210.

이승관; Kang, Myung-Ju. Ant Colony System for solving the traveling Salesman Problem Considering the Overlapping Edge of Global Best Path. Journal of The Korea Society of Computer and Information. 2011; 16(3) 203-210.

이승관, Kang, Myung-Ju. Ant Colony System for solving the traveling Salesman Problem Considering the Overlapping Edge of Global Best Path. 2011; 16(3), 203-210.

이승관 and Kang, Myung-Ju. "Ant Colony System for solving the traveling Salesman Problem Considering the Overlapping Edge of Global Best Path" Journal of The Korea Society of Computer and Information 16, no.3 (2011) : 203-210.