分解技法을 이용한 設備立地選定問題의 解法에 관한 硏究

Abstract

문제 크기가 큰 線刑計劃問題의 解法인 Benders分解技法을 이용하여 設備立地選定問題의 해법을 연구하였다. 기존의 연구에서는 쌍대변수를 쉽게 구하여 그 값이 작았으나 본 연구에서는 약간의 과정을 거쳐 큰 값을 가지느 쌍대변수를 사용하여 효율적으로 하였으며 특히 單純問題의 경우 보다는 設備制限問題와 같아 設備에 관한 제약식이 추가되는 경우 더욱 효율적인 해법이 될 수 있다.

A Benders' decomposition method is a method for large scale Linear Programming and Mixed integer problem. So, Benders' decomposion method was used for the warehouse location problem.

In this paper, we used the improved dual multiplier for the Benders' decomposition method for the Uncapacitiated location problem.

Our study was efficient for the p-median problem and problem with p-median type constraints.

A Benders' decomposition method is a method for large scale Linear Programming and Mixed integer problem. So, Benders' decomposion method was used for the warehouse location problem.

In this paper, we used the improved dual multiplier for the Benders' decomposition method for the Uncapacitiated location problem.

Our study was efficient for the p-median problem and problem with p-median type constraints.