Abstract
The evolutionary metaheuristic called scatter search has been applied successfully to optimization problems for several years. In this paper, we apply the scatter search technique to the well-known 0–1 multidimensional knapsack problem. We propose a new relaxation-based diversification generator, which produces an initial population with elite solutions. The computational results obtained for a set of classic and correlated instances clearly show that (1) this generator can also be used as a heuristic for solving the multidimensional knapsack problem; (2) using the population produced by our generator as a starting point for the scatter search algorithm leads to better performance. We also enhance the scatter search algorithm by integrating memory and by using adapted intensification phases. Overall, the results are interesting and competitive compared to other population-based algorithms, such as genetic algorithms.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Beasley, J.E.: OR-Library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069–1072 (1990)
Bertsimas, D., Demir, R.: An approximate dynamic programming approach to multidimensional knapsack problems. Manage. Sci. 48(4), 550–565 (2002)
Campos, V., Glover, F., Laguna, M., Martí, R.: An experimental evaluation of a scatter search for the linear ordering problem. J. Glob. Optim. 21, 397–414 (2001)
Chu, P., Beasley, J.E.: A genetic algorithm for the multidimensional knapsack problem. J. Heuristics 4, 63–86 (1998)
Fréville, A.: The multidimensional 0–1 knapsack problem: an overview. Eur. J. Oper. Res. 155(1), 1–21 (2004)
Fréville, A., Hanafi, S.: The multidimensional 0–1 knapsack problem—bounds and computational aspects. Ann. Oper. Res. 139(1), 195–227 (2005)
Fréville, A., Plateau, G.: Sac-à-dos multidimensionel en variables 0–1: Encadrement de la somme des variables à l’optimum. RAIRO Oper. Res. 27, 169–187 (1993)
Fréville, A., Plateau, G.: An efficient preprocessing procedure for the multidimensional knapsack problem. Discrete Appl. Math. 49, 189–212 (1994)
Gilmore, P.C., Gomory, R.E.: The theory and computation of knapsack functions. Oper. Res. 14, 1045–1075 (1966)
Glover, F.: Heuristics for integer programming using surrogate constraints. Decis. Sci. 8, 156–166 (1977)
Glover, F.: Tabu search—part I. ORSA J. Comput. 1(3), 190–206 (1989)
Glover, F.: Tabu search—part II. ORSA J. Comput. 2(1), 4–32 (1990)
Glover, F.: Scatter search and star paths: beyond the genetic metaphor. OR Spektrum 17, 125–137 (1995)
Glover, F.: A template for scatter search and path relinking. In: Hao, J., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds.) Artificial Evolution, vol. 1363 of Lecture Notes in Computer Science, pp. 13–54. Springer (1998)
Glover, F., Kochenberger, G.: Critical event tabu search for multidimensional knapsack problems. In: Osman, I., Kelly, J. (eds.) Meta Heuristics: Theory and Applications, pp. 407–427. Kluwer Academic Publishers (1996)
Glover, F., Lokketangen, A., Woodruff, D.: Scatter search to generate diverse MIP solutions. In: Laguna, M., Gonzlez-Velarde, J. (eds.) OR Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, pp. 299–317. Kluwer Academic Publishers (2000)
Gomes da Silva, C., Climaco, J., Figueira, J.: A scatter search method for the bi-criteria multi-dimensional {0,1}-knapsack problem using surrogate relaxation. J. Math. Model. Algorithms 3(3), 183–208 (2004)
Hanafi, S., Fréville, A.: An efficient tabu search approach for the 0–1 multidimensional knapsack problem. Eur. J. Oper. Res. 106, 659–675 (1998)
Haul, C., Voß, S.: Using surrogate constraints in genetic algorithms for solving multidimensional knapsack problems. In: Woodruff, D. (ed.) Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search: Interface in Computer Science And Operations Research, pp. 235–251. Kluwer Academic Publishers (1998)
Laguna, M., Armentano, V.: Lessons from applying and experimenting with scatter search. In: Rego, C., Alidaee, B. (eds.) Metaheuristic Optimization via Adaptive Memory and Evolution: Tabu Search and Scatter Search, pp. 229–246. Kluwer Academic Publishers (2005)
Laguna, M., Marti, R.: Scatter Search: Methodology and Implementations in C. Kluwer Academic Publishers (2003)
Li, V., Curry, G.: Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search. Comput. Oper. Res. 32(4), 825–848 (2005)
Lorie, J.H., Savage, L.J.: Three problems in capital rationing. J. Bus. 28, 229–239 (1955)
Marti, R., Lourenco, H., Laguna, M.: Assigning proctors to exams with scatter search. In: Laguna, M., Gonzlez-Velarde, J. (eds.) Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, pp. 215–227. Kluwer Academic Publishers (2000)
Moraga, R.J., DePuy, G.W., Whitehouse, G.E.: Meta-RaPS approach for the 0–1 multidimensional knapsack problem. Comput. Ind. Eng. 48, 83–96 (2005)
Vasquez, M., Hao, J.K.: A logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite. Comput. Optim. Appl. 20, 137–157 (2001a)
Vasquez, M., Hao, J.K.: Une approche hybride pour le sac à dos multidimensionnel en variables 0–1. RAIRO Oper. Res. 35, 415–438 (2001b)
Vasquez, M., Vimont, Y.: Improved results on the 0–1 multidimensional knapsack problem. Eur. J. Oper. Res. 165, 70–81 (2005)
Wilbaut, C.: Heuristiques hybrides pour la résolution de problèmes en nombres entiers mixtes. Ph.D. thesis, Université de Valenciennes et du Hainaut Cambrésis (2006)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hanafi, S., Wilbaut, C. Scatter Search for the 0–1 Multidimensional Knapsack Problem. J Math Model Algor 7, 143–159 (2008). https://doi.org/10.1007/s10852-008-9078-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10852-008-9078-9