한국경영과학회:학술대회논문집 (Proceedings of the Korean Operations and Management Science Society Conference)
- 한국경영과학회 2007년도 추계학술대회 및 정기총회
- /
- Pages.316-321
- /
- 2007
The extension of hierarchical covering location problem
- Lee, Jung-Man (Department of Information and Industrial Engineering, Yonsei University) ;
- Lee, Young-Hoon (Department of Information and Industrial Engineering, Yonsei University)
- 발행 : 2007.11.09
초록
The hierarchical covering location problem emphasizes the issue of locating of hierarchical facilities in order to maximize the number of customers that can be covered. In the classical HCLP(Hierarchical Covering Location Problem), it is assumed that the customers are covered completely if they are located within a specific distance from the facility, and not covered otherwise. The generalized HCLP is introduced that the coverage of customers is measured to be any real value rather than 0 or 1, where the service level may decrease according to the distance. Mixed integer programming formulation for the generalized HCLP is suggested with a partial coverage of service. Solutions are found using OPL Studio, and are evaluated for various cases.