한국경영과학회:학술대회논문집 (Proceedings of the Korean Operations and Management Science Society Conference)

한국경영과학회 (The Korean Operations Research and Management Science Society)
권호 표지

선후행 관계제약을 갖는 TSP 문제의 유전알고리즘 해법

Traveling Salesman Problem with Precedence Relations based on Genetic Algorithm

  • 문치웅 (한양대학교 산업공학과) ;
  • 김규웅 (한양대학교 산업공학과) ;
  • 김종수 (한양대학교 산업공학과) ;
  • 허선 (한양대학교 산업공학과)
  • 발행 : 2000.04.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

The traveling salesman problem with precedence relations (TSPPR) is harder than general traveling salesman problem. In this paper we propose an efficient genetic algorithm (GA) to solve the TSPPR. The key concept of the proposed genetic algorithm is a topological sort (TS). The results of numerical experiments show that the proposed GA approach produces an optimal solution for the TSPPR.

키워드