Genetic algorithm using a Voronoi Diagram for Regrouping problem

• 영문명: Genetic algorithm using a Voronoi Diagram for Regrouping problem
• 발행기관: 한국산업경영시스템학회
• 저자명: Jeong-Yeon Seo Sang-Min Park In-Jae Jeong Deok-Soo Kim
• 간행물 정보: 『한국산업경영시스템학회 학술대회』2005년 춘계학술대회 논문집, 328~331쪽, 전체 4쪽
• 주제분류: 공학 > 산업공학
• 파일형태: PDF
• 발행일자: 2005.05.01

영문 초록

  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 good approximate solutions in a shorter computation time in comparison with optimal solution by integer programming.

목차

Abstract
1. INTRODUCTION
2. PROBLEM DEFINITION
3. WHY VORONOI DIAGRAM?
4. REGROUPING USING GENETIC APPROACH & VORONOI DIAGRAM (VGA)
5. EXPERIMETAL RESULT
6. CONCLUSION
ACKNOWLEDGEMENT
REFERENCES

키워드

regrouping Voronoi diagram genetic algorithm integer programming