서비스 위치 그룹핑을 위한 보로노이 다이어그램 기반의 유전자알고리듬

Regrouping Service Sites: a Genetic Approach using a Voronoi Diagram

  • Seo, Jeong-Yeon (Department of Industrial Engineering, Hanyang University) ;
  • Park, Sang-Min (Voronoi Diagram Research Center, Hanyang University) ;
  • Jeong, In-Jae (Department of Industrial Engineering, Hanyang University) ;
  • Kim, Deok-Soo (Department of Industrial Engineering, Hanyang University)
  • 발행 : 2005.05.13

초록

In this paper, we consider the problem of regrouping a number of service sites into a smaller number of service sites called centers. Each service site is represented as a point in the plane and has an associated value of service demand. We aim to group the sites so that each group has the balanced service demand and the sum of distances from the sites in the group to their corresponding center is minimized. To solve this problem, we propose a hybrid genetic algorithm that is combined with Voronoi diagrams. We provide a variety of experimental results by changing the weights of the two factors: service demands and distances. Our hybrid algorithm finds better solutions in a shorter computation time in comparison with a pure genetic algorithm.

키워드