Development of Evolution Program to Find the Multiple Shortest Paths in High Complex and Large Size Real Traffic Network

복잡도가 높고 대규모 실제 교통네트워크에서 다수 최적경로들을 탐색할 수 있는 진화 프로그램의 개발

  • 김성수 (강원대학교 산업공학과) ;
  • 정종두 (넷시큐어 테크놀러지(주)) ;
  • 민승기 (강원대학교 대학원 산업공학과)
  • Published : 2002.06.30

Abstract

It is difficult to find the shortest paths using existing algorithms (Dijkstra, Floyd-Warshall algorithm, and etc) in high complex and large size real traffic networks The objective of this paper is to develop an evolution program to find the multiple shortest paths within reasonable time in these networks including turn-restrictions, U-turns, and etc.

Keywords