다수제품의 수익성 최대화를 위한 설비입지선정 문제 = Coordinated Inventory Model for the Joint Replenishment Supply Chain

다국어 초록 (Multilingual Abstract)

The facility location problem of this paper is distinguished from the maximal covering location problem and the fixed-charge facility location problem. We propose the maximal profiting location problem (MPLP) that is the facility location problem maximizing profit with multi-product. We apply to the simulated annealing algorithm, the stochastic evolution algorithm and the accelerated simulated annealing algorithm to solve this problem. Through a scale-down and extension experiment, the MPLP was validated and all the three algorithm enable the near optimal solution to produce. As the computational complexity is increased, it is shown that the simulated annealing algorithm is able to find the best solution than the other two algorithms in a relatively short computational time.

참고문헌 (Reference)

1 "용량제약 있는 이계층 설비 입지선정 문제의 최적화 해법" KAIST 2002.

2 "서비스 레벨에 따른 용량제한 하에서의 입지선정문제" 3 (3): 43-50, 2003

3 "비용제약하에서 서비스 수준을 최대화 하는 설비입지선정에 관한 연구" 30 (30): 93-106, 2003

4 "메타휴리스틱" 영지문화사 1997.

5 "The Maximal Covering Location Problem" 32 : 101-108, 1974

6 "The Generalized Maximal Covering Location Problem" 29 : 563-581, 2002

7 "The Fixed Charge Facility Location Problem with Coverage Restrictions" 37 : 281-296, 2001

8 "Simulated Annealing의 가속화와 ATM 망에서의 가상경로 설정에의 적용" 21 (21): 125-140, 1996

9 "Production,Transportation,and Distribution Planning in a Multi-Commodity Tri-Echelon system" 30 : 291-302, 1996

10 "Network and Discrete Location：Models, Algorithms, and Applicatio" Wiley 1995.

11 "Lagrangian- relaxation-based Solution Procedures for a Multi-Product Capacitated Facility Location Problem with Choice of Facility type" 115 : 285-299, 1999

12 "Integrating Inventory Impacts into a Fixed-Charge Model for Location Distribution Centers" 34 : 173-186, 1998

13 "Competitive Locaton with Rectilinear Distances" 80 : 77-85, 1995

14 "Combinational Optimization by Stochastic Evolution" 10 : 55-535, 1991

15 "An LP Rounding Algorithm for Approximating Uncapacitated Facility Location Problem with Penalties" 94 : 119-123, 2005

16 "An Exact Algorithm for the Capacitated Facility Location Problems with Single Sourcing" 113 : 544-559, 1999

17 "A Repeated Matching Heuristic for the Single-Source Capacitated Facility Location Problem" 116 : 51-68, 1999

18 "A Multi- Commodity,Multi-Plant,Capacitated Facility Location Problem：Formulation and Efficient Heuristic Solution" 25 : 869-878, 1998

19 "A Maximal Covering Location Model in the presence of Partial Coverage" 31 : 1515-1526, 2004

20 "A Comparison of Lagrangean and Surrogate Relaxations for the Maximal Covering Location Problem" 124 : 377-389, 2000