http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
침수피해 예방을 위한 지하 저류시설 설치 최적화-서울시 사례연구
배성재(Sungjae Bae),안뜰에봄(Drebom Ahn),유형우(Hyoungwoo Yoo),이충목(Chungmok Lee) 대한산업공학회 2017 대한산업공학회지 Vol.43 No.4
Due to global climate change and rapid urbanization, modern cities are under constant threat of floods. The flood happens when there is too much rain at short time and overflow of water drain networks, which can be prevented by deployment of underground water reservoirs. In this study, we present an optimization approach for planning of underground water reservoir locations to prevent floods. To establish effective underground water reservoirs system, it is required to (1) identify areas under flood risk and (2) locations of underground water reservoirs. We propose a method for determining flood risk of any given area and developed an optimization model to find an optimal assignment between the flood-risky-area and underground water reservoirs. The proposed method is validated by extensive real-life data of Seoul.
김서희(Seohee Kim),안뜰에봄(Drebom Ahn),이충목(Chungmok Lee) 대한산업공학회 2017 대한산업공학회지 Vol.43 No.4
In this paper we concern a variant of knapsack problem which is defined as an ordinary 0-1 knapsack problem with additional queuing delay term in the objective function under assumption of data uncertainty. We present two exact algorithms for solving the problem. The first algorithm is a mixed integer programming formulation developed by using linearization technique for the nonlinear objective function. The second approach is based on the dynamic programming by utilizing the specific structure of the robust knapsack problem. Computational experiments for the proposed approaches on the well-known benchmarking problems show that the dynamic programming approach clearly outperforms the MIP-based one.