@article{ART001708312},
author={Sang-Un, Lee},
title={The Extended k-opt Algorithm for Traveling Salesman Problem},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2012},
volume={17},
number={10},
pages={155-165}
TY - JOUR
AU - Sang-Un, Lee
TI - The Extended k-opt Algorithm for Traveling Salesman Problem
JO - Journal of The Korea Society of Computer and Information
PY - 2012
VL - 17
IS - 10
PB - The Korean Society Of Computer And Information
SP - 155
EP - 165
SN - 1598-849X
AB - This paper suggests traveling salesman problem algorithm that have been unsolved problem with NP-Hard. The proposed algorithm is a heuristic with edge-swap method. The classical method finds the initial solution starts with first node and visits to mostly adjacent nodes then decides the traveling path. This paper selects minimum weight edge for each nodes, then perform Min-Min method that start from minimum weight edge among the selected edges and Min-Max method that starts from maximum weight edges among it. Then we decide tie initial solution to minimum path length between Min-Min and Min-Max method. To get the final optimal solution, we apply previous two-opt to initial solution. Also, we suggest extended 3-opt and 4-opt additionally. For the 7 actual experimental data, this algorithm can be get the optimal solutions of state-of-the-art with fast and correct.
KW - Traveling Salesman Problem;Exhaustive Search Method;Edge Exchange Method;Heuristic Method;Min-Min and Min-Max Search
DO -
UR -
ER -
Sang-Un, Lee. (2012). The Extended k-opt Algorithm for Traveling Salesman Problem. Journal of The Korea Society of Computer and Information, 17(10), 155-165.
Sang-Un, Lee. 2012, "The Extended k-opt Algorithm for Traveling Salesman Problem", Journal of The Korea Society of Computer and Information, vol.17, no.10 pp.155-165.
Sang-Un, Lee "The Extended k-opt Algorithm for Traveling Salesman Problem" Journal of The Korea Society of Computer and Information 17.10 pp.155-165 (2012) : 155.
Sang-Un, Lee. The Extended k-opt Algorithm for Traveling Salesman Problem. 2012; 17(10), 155-165.
Sang-Un, Lee. "The Extended k-opt Algorithm for Traveling Salesman Problem" Journal of The Korea Society of Computer and Information 17, no.10 (2012) : 155-165.
Sang-Un, Lee. The Extended k-opt Algorithm for Traveling Salesman Problem. Journal of The Korea Society of Computer and Information, 17(10), 155-165.
Sang-Un, Lee. The Extended k-opt Algorithm for Traveling Salesman Problem. Journal of The Korea Society of Computer and Information. 2012; 17(10) 155-165.
Sang-Un, Lee. The Extended k-opt Algorithm for Traveling Salesman Problem. 2012; 17(10), 155-165.
Sang-Un, Lee. "The Extended k-opt Algorithm for Traveling Salesman Problem" Journal of The Korea Society of Computer and Information 17, no.10 (2012) : 155-165.
