Journal of the military operations research society of Korea (한국국방경영분석학회지)
- Volume 10 Issue 1
- /
- Pages.57-63
- /
- 1984
- /
- 1229-9898(pISSN)
An algorithm for 0 - 1 Multiperiod Knapsack Problem
0 - 1 다단계배낭기법
Abstract
The 0-1 multi-period Knapsack problem (MPKP) has a horizon of m periods, each having a number of types of projects with values and weights. Subject to the requirement, the cummulative capacity of the problem in each period i cannot be exceeded by the total weight of the projects selected in period 1, 2, ..., i. It is a problem of selecting the projects in such a way that the total value in the knapsack through the horizon of m periods is maximized. A search algorithm is developed and tested in this paper. Search rules that avoid the search of redundant partial solutions are used in the algorithm. Using the property of MPKP, a surrogate constraint concerned with the most available requirement is used in the bounding technique.
Keywords