2-D Non-Convex 공간에서의 혐오시설 위치 선정을 위한 혼합정수비선형계획모형(MINLP) 연구
MINLP for Obnoxious Facility Location Problem on a Simplified 2-D Non-Convex Set
김정희(육군3사관학교); 조남석(국방대학교)
35권 1호, 41~54쪽
초록
Recently, we learned that the NIMBY phenomenon is not just a local problem but a serious nationwide problem that costs a huge social expenses. Hence, it is required that one should suggest solutions supported by scientific approaches. There have been a lot of researches about obnoxious facility location problem, but these researches have not been translated into real-world application yet. In this study, we introduce Mixed Integer Non-linear Programming formulation for solving obnoxious facility location problem. We describe how terrain in real-world can be simplified as a 2-D non-convex set and describe some implemental issues that can possibly occur. Various computational results are followed.
Abstract
Recently, we learned that the NIMBY phenomenon is not just a local problem but a serious nationwide problem that costs a huge social expenses. Hence, it is required that one should suggest solutions supported by scientific approaches. There have been a lot of researches about obnoxious facility location problem, but these researches have not been translated into real-world application yet. In this study, we introduce Mixed Integer Non-linear Programming formulation for solving obnoxious facility location problem. We describe how terrain in real-world can be simplified as a 2-D non-convex set and describe some implemental issues that can possibly occur. Various computational results are followed.
- 발행기관:
- 한국경영과학회
- 분류:
- 경영학