Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지

A Heuristic Algorithm for Asymmetric Traveling Salesman Problem using Hybrid Genetic Algorithm

혼합형 유전해법을 이용한 비대칭 외판원문제의 발견적해법

  • 김진규 (한양대학교 대학원 산업공학과) ;
  • 윤덕균 (한양대학교 산업공학과)
  • Published : 1995.03.01
Download PDF
⟨ Previous Next ⟩

Abstract

This paper suggests a hybrid genetic algorithm for asymmetric traveling salesman problem(TSP). The TSP was proved to be NP-complete, so it is difficult to find optimal solution in reasonable time. Therefore it is important to develope an algorithm satisfying robustness. The algorithm applies dynamic programming to find initial solution. The genetic operator is uniform order crossover and scramble sublist mutation. And experiment of parameterization has been performed.

Keywords