최대유통문제에서 유전알고리듬을 적용한 치명호 결정방법

  • 정호연 (전주대학교 산업공학과) ;
  • 김은영 (전주대학교 산업공학과) ;
  • 안재근 (안성산업대학교 컴퓨터공학과) ;
  • 박순달 (서울대학교 산업공학과)
  • 발행 : 1998.10.01

초록

The purpose of this study is to present a method for determining the k most vital arcs in the maximum flow problem using a heuristic method. Generally, the problem which determine the k most vital arcs in maximum flow problem has known as NP-hard. Therefore, in this study we propose a method for determining all the k most vital arcs in maximum flow problem using a genetic algorithm. The proposed algorithm found all alternatives within shorter time than other heuristic methods. The method presented in this study can determine all the alternatives when there exists other alternative solutions.

키워드