한국경영과학회지 (Journal of the Korean Operations Research and Management Science Society)

  • 제31권4호
  • /
  • Pages.139-155
  • /
  • 2006
  • /
  • 1225-1119(pISSN)
  • /
  • 2733-4759(eISSN)
한국경영과학회 (The Korean Operations Research and Management Science Society)
권호 표지

다수제품의 수익성 최대화를 위한 설비입지선정 문제

The Maximal Profiting Location Problem with Multi-Product

  • 이상헌 (국방대학교 운영분석학과) ;
  • 백두현 (국방대학교 운영분석학과)
  • 발행 : 2006.12.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

The facility location problem of this paper is distinguished from the maximal covering location problem and the flxed-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.

키워드

참고문헌

  1. 김여근, 윤복식, 이상복,메타휴리스틱, 영지 문화사, 1997
  2. 김은정, '용량제약 있는 이계층 설비 입지선정 문제의 최적화 해법', 석사학위논문, KAIST, 2002
  3. 윤복식, 조계연, 'Simulated Annealing9의 가속화와 ATM 망에서의 가상경로 설정에의 적용', 한국경영과학회지, 제21권, 제2호(1996), pp,125-l40
  4. 이계종, 이병기, 이영훈, '서비스 레벨에 따른 용량제한 하에서의 입지선정문제', 한국공급망경영학회지, 제3권, 제2호(2003), pp.43-50
  5. 홍성학, 이영훈, '비용제약하에서 서비스 수준을 최대화 하는 설비입지선정에 관한 연구', 대한산업공학회지, 제30권, 제2호(2003), pp..93 -100
  6. Aarts, E.H.L. and J.H.J. Korst, Simulated Annealing and Boltzmann Machines, John Wiley & Sons, New York, 1989
  7. Berman, O. and D. Krass, 'The Generalized Maximal Covering Location Problem,' Computers & Operations Research, Vol.29(2002), pp.563-581 https://doi.org/10.1016/S0305-0548(01)00079-X
  8. Church, R.L. and C.S. ReVelle, 'The Maximal Covering Location Problem,' Papers of the Regional Science Association, Vol.32 (1974), pp.101-108 https://doi.org/10.1007/BF01942293
  9. Daskin, M., Network and Discrete Location : Models, Algorithms, and Applications, Wiley, New York, 1995
  10. Galvao, R.D., L.G.A. Espejo, and B. Boffey, 'A Comparison of Lagrangean and Surrogate Relaxations for the Maximal Covering Location Problem,' European Journal of Operational Research, Vol.124(2000), pp. 377-389 https://doi.org/10.1016/S0377-2217(99)00171-X
  11. Holmberg, K., M. Ronnqvist and D. Yuan, 'An Exact Algorithm for the Capacitated Facility Location Problems with Single Sourcing,' European Journal of Operational Research, Vol.113(1999), pp.544-559 https://doi.org/10.1016/S0377-2217(98)00008-3
  12. Infante-Macias, R. and J. Munoz-perez 'Competitive Locaton with Rectilinear Distances,' European Journal of Operation Research, Vol.80(1995), pp.77-85 https://doi.org/10.1016/0377-2217(93)E0239-T
  13. Joseph, B.M. and W.N. Alan, 'Lagrangianrelaxation-based Solution Procedures for a Multi-Product Capacitated Facility Location Problem with Choice of Facility type,' European Journal of Operational Research, Vol.115(1999), pp.285-299 https://doi.org/10.1016/S0377-2217(98)00303-8
  14. Nozick, L. and M. Turnquist, 'Integrating Inventory Impacts into a Fixed-Charge Model for Location Distribution Centers,' Logistics and Transpn Rev., Vol.34(1998), pp.173-186 https://doi.org/10.1016/S1366-5545(98)00010-6
  15. Nozick, L., 'The Fixed Charge Facility Location Problem with Coverage Restrictions,' Transpotaiion Research Part E, Vol. 37(2001), pp.281-296 https://doi.org/10.1016/S1366-5545(00)00018-1
  16. Orhan, K. and K.K. Esra, 'A Maximal Covering Location Model in the presence of Partial Coverage,' Computer & Operations Research, Vol.31(2004), pp.1515-1526 https://doi.org/10.1016/S0305-0548(03)00105-9
  17. Pirkul, H., 'Production, Transportation, and Distribution Planning in a Multi-Commodity Tri-Echelon system,' Transportation Science, Vol.30(1996), pp.291-302 https://doi.org/10.1287/trsc.30.4.291
  18. Pirkul, H. and V. Jayaraman, 'A MultiCommodity, Multi-Plant, Capacitated Facility Location Problem: Formulation and Efficient Heuristic Solution,' Computers Operations Research, Vol.25(1998), pp.869-878 https://doi.org/10.1016/S0305-0548(97)00096-8
  19. Ronnqvist, M., S. Tragantalerngsak, and J. Holt, 'A Repeated Matching Heuristic for the Single-Source Capacitated Facility Location Problem,' European Journal of Operational Research, Vol.116(1999), pp.51-68 https://doi.org/10.1016/S0377-2217(98)00045-9
  20. Saab, Y.G. and V.B. Rao, 'Combinational Optimization by Stochastic Evolution,' IEEE trans. On Computer Aided Design, Vol.10 (1991), pp.55-535
  21. Xu, G. and J. Xu, 'An LP Rounding Algorithm for Approximating Uncapacitated Facility Location Problem with Penalties,' Irformation Processing Letters, Vol.94(2005), pp.119-123 https://doi.org/10.1016/j.ipl.2005.01.005