Proceedings of the Korean Operations and Management Science Society Conference (한국경영과학회:학술대회논문집)
- 1996.04a
- /
- Pages.514-517
- /
- 1996
타부탐색, 메모리, 싸이클 탐지를 이용한 배낭문제 풀기
Abstract
In solving multi-level knapsack problems, conventional heuristic approaches often assume a short-sighted plan within a static decision enviornment to find a near optimal solution. These conventional approaches are inflexible, and lack the ability to adapt to different problem structures. This research approaches the problem from a totally different viewpoint, and a new method is designed and implemented. This method performs intelligent actions based on memories of historic data and learning. These actions are developed not only by observing the attributes of the optimal solution, the solution space, and its corresponding path to the optimal solution, but also by applying human intelligence, experience, and intuition with respect to the search strategies. The method intensifies, or diversifies the search process appropriately in time and space. In order to create a good neighborhood structure, this method uses two powerful choice rules that emphasize the impact of candidate variables on the current solution with respect to their profit contribution. A side effect of so-called "pseudo moves", similar to "aspirations", supports these choice rules during the evaluation process. For the purpose of visiting as many relevant points as possible, strategic oscillation between feasible and infeasible solutions around the boundary is applied for intensification. To avoid redundant moves, short-term (tabu-lists), intermediate-term (cycle detection), and long-term (recording frequency and significant solutions for diversification) memories are used. Test results show that among the 45 generated problems (these problems pose significant or insurmountable challenges to exact methods) the approach produces the optimal solutions in 39 cases.lutions in 39 cases.
Keywords