대한산업공학회지 (Journal of Korean Institute of Industrial Engineers)

  • 제37권2호
  • /
  • Pages.124-131
  • /
  • 2011
  • /
  • 1225-0988(pISSN)
  • /
  • 2234-6457(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지
DOI QR코드

DOI QR Code

제한용량이 있는 설비입지결정 문제에 대한 적응형 평균치교차분할 알고리즘

Adaptive Mean Value Cross Decomposition Algorithms for Capacitated Facility Location Problems

  • 김철연 (한양대학교 산업공학과) ;
  • 최경현 (한양대학교 기술경영전문대학원)
  • Kim, Chul-Yeon (Department of Industrial Engineering, Hanyang University) ;
  • Choi, Gyung-Hyun (Graduate School of Technology and Innovation Management, Hanyang University)
  • 투고 : 2011.05.06
  • 심사 : 2011.05.19
  • 발행 : 2011.06.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In this research report, we propose a heuristic algorithm with some primal recovery strategies for capacitated facility location problems (CFLP), which is a well-known combinatorial optimization problem with applications in distribution, transportation and production planning. Many algorithms employ the branch-and-bound technique in order to solve the CFLP. There are also some different approaches which can recover primal solutions while exploiting the primal and dual structure simultaneously. One of them is a MVCD (Mean Value Cross Decomposition) ensuring convergence without solving a master problem. The MVCD was designed to handle LP-problems, but it was applied in mixed integer problems. However the MVCD has been applied to only uncapacitated facility location problems (UFLP), because it was very difficult to obtain "Integrality" property of Lagrangian dual subproblems sustaining the feasibility to primal problems. We present some heuristic strategies to recover primal feasible integer solutions, handling the accumulated primal solutions of the dual subproblem, which are used as input to the primal subproblem in the mean value cross decomposition technique, without requiring solutions to a master problem. Computational results for a set of various problem instances are reported.

키워드

참고문헌

  1. Akinc, U. and Khumawala, B. M. (1977), An Efficient Branch-and-bound Algorithm for the Capacitated Warehouse Location, Management Science, 23(6), 585-594. https://doi.org/10.1287/mnsc.23.6.585
  2. Geoffrion, A. M. (1974), Lagrangean relaxation for integer programming, Mathematical Programming Study, 2, 82-114. https://doi.org/10.1007/BFb0120690
  3. Holmberg, K. (1992), Linear mean value cross decomposition : A generalization of the Kornai-Liptak method, European Journal of Operational Research, 62, 55-73. https://doi.org/10.1016/0377-2217(92)90177-B
  4. Holmberg, K. (1994), A convergence proof for linear mean value cross decomposition, Zeitschrift fur Operations Research, 39, 157-186.
  5. Holmberg, K. (1997), Mean value cross decomposition applied to integer programming problems, European Journal of Operation Research, 97, 124-138. https://doi.org/10.1016/S0377-2217(96)00139-7
  6. Holmberg, K. and Kiwiel, K. C. (2003), Mean value cross decomposition for nonlinear convex problems, Research report LiTH-MAT-R-2003- 10, Department of Mathematics, Linkoping Institute of Technology, Sweden.
  7. Holmberg, K. (2005), Mean value cross decomposition based branch-andbound for mixed integer programming problems, Research report LiTH-MAT-R-2004-13, Department of Mathematics, Linkoping Institute of Technology, Sweden.
  8. Klincewicz, J. G. and Luss, H. (1986), A Lagrangean Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints, The Journal of Operational Research Society, 37(5), 495-500. https://doi.org/10.1057/jors.1986.84
  9. Klose, A. (1999), An LP-Based Heuristic for Two-Stage Capacitated Facility Location Problems, The Journal of the Operational Research Society, 50(2), 157-166. https://doi.org/10.1057/palgrave.jors.2600675
  10. Klose, A. (2000), Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem, European Journal of Operational Research, 126, 408-421. https://doi.org/10.1016/S0377-2217(99)00300-8
  11. Nauss, R. M. (1978), An Improved Algorithm for the Capacitated Facility Location Problem, The Journal of the Operational Research Society, 29(12), 1195-1201. https://doi.org/10.1057/jors.1978.263
  12. Prins, C., Prodhon, C., Ruiz, A., Soriano, P., and Calvo, R. W. (2007), Solving theCapacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic, Transportation Science, 41, 470-483. https://doi.org/10.1287/trsc.1060.0187
  13. Sa, G. (1969), Branch-and-bound and Approximation Solutions to the Capacitated Plant Location Problem, Operations Research, 17, 1005-1016. https://doi.org/10.1287/opre.17.6.1005
  14. Van Roy, T. J. (1983), Cross decomposition for mixed integer programming, Mathematical Programming, 25, 46-63. https://doi.org/10.1007/BF02591718
  15. Van Roy, T. J. (1986), A cross decomposition algorithm for capacitated facility location, Operations Research, 34, 145-163. https://doi.org/10.1287/opre.34.1.145