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

  • 제40권4호
  • /
  • Pages.396-403
  • /
  • 2014
  • /
  • 1225-0988(pISSN)
  • /
  • 2234-6457(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지
DOI QR코드

DOI QR Code

일반 다중선택 다분할 선형계획 배낭문제

The Generalized Multiple-Choice Multi-Divisional Linear Programming Knapsack Problem

  • 원중연 (경기대학교 산업경영공학과)
  • Won, Joong-Yeon (Department of Industrial and Management Engineering, Kyonggi University)
  • 투고 : 2014.04.15
  • 심사 : 2014.06.26
  • 발행 : 2014.08.15
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

The multi-divisional knapsack problem is defined as a binary knapsack problem where each mutually exclusive division has its own capacity. In this paper, we present an extension of the multi-divisional knapsack problem that has generalized multiple-choice constraints. We explore the linear programming relaxation (P) of this extended problem and identify some properties of problem (P). Then, we develop a transformation which converts the problem (P) into an LP knapsack problem and derive the optimal solutions of problem (P) from those of the converted LP knapsack problem. The solution procedures have a worst case computational complexity of order $O(n^2{\log}\;n)$, where n is the total number of variables. We illustrate a numerical example and discuss some variations of problem (P).

키워드

참고문헌

  1. Armstrong, R. D., Sinha P., and Zoltners, A. A. (1982), The multiplechoice nested knapsack model, Management Science, 28(1), 34-43. https://doi.org/10.1287/mnsc.28.1.34
  2. Balas, E. and Zemel, E. (1980), An algorithm for large zero-one knapsack problem, Operations Research, 28(5), 1130-1154. https://doi.org/10.1287/opre.28.5.1130
  3. Campello, R. E. and Maculan, N. F. (1987), Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints : properties and algorithms, Discrete Applied Mathematics, 18, 119-136. https://doi.org/10.1016/0166-218X(87)90015-1
  4. Dudzinski, K. (1989), On a cardinality constrained linear programming knapsack problem, Operations Research letters, 8, 215-218. https://doi.org/10.1016/0167-6377(89)90063-1
  5. Sim, S. B., Jang, J. H., Jung, H. S., and Jeong, B. J. (2013), Military logistics consolidation center location problem : modeling and analysis, Journal of the Korean Institute of Industrial Engineers, 39(6), 587-598. https://doi.org/10.7232/JKIIE.2013.39.6.587
  6. Suh, J. D. (2012), A multistage metaheuristic scheduling algorithm in LCD module lines composed of processes, Journal of the Korean Institute of Industrial Engineers, 38(4), 262-275. https://doi.org/10.7232/JKIIE.2012.38.4.262
  7. Won, J. Y. and Chung, S. J. (1991), The multi-divisional linear knapsack problem, Journal of the Korean Institute of Industrial Engineers, 17(1), 127-130.
  8. Won, J. Y. (2011), On a two dimensional linear programming knapsack problem with the generalized GUB constraint, Journal of the Korean Institute of Industrial Engineers, 37(3), 258-263. https://doi.org/10.7232/JKIIE.2011.37.3.258