설비용량에 제한이 있는 입지선정 문제에 대한 기존해법간의 비교분석

Abstract

Capacitated facility location problems have received a great deal of attention in the past decade, resulting in a proliferation of algorithms for solving them. As is the case with mixed 1-1 integer programming problems, the computational success of such algorithms depends greatly on how to obtain lower bounds in good quality within a resonable time. The objective of this paper is to provide a comparative analysis of those algorithms in terms of lower bounds they produce. Analyses of the strategies for generating lower bounds as well as the quality of generated lower bounds are provided.