A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem

Computational Optimization and Applications

Volumn 33, Issue 2-3, 2006, Pages 271-285

  Hifi, M ^a   Michrafy, M ^a   Sbihi, A ^a  

^a LaRIA   (France)

Author keywords

Combinatorial optimization; Heuristics; Knapsacks; Reactive local search

Indexed keywords

APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; HEURISTIC METHODS; ITERATIVE METHODS; OPTIMIZATION; PROBLEM SOLVING;

COMBINATORIAL OPTIMIZATION; FAST ITERATIONS; KNAPSACKS; REACTIVE LOCAL SEARCH;

ALGORITHMS;

EID: 33645146389     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-005-3057-0     Document Type: Article

References (16)

1. E. Balas and E. Zemel, "An algorithm for large zero-one knapsack problem," Operations Research, vol. 28, pp. 1130-1154, 1980.
2. P. Chu and J.E. Beasley, "A genetic algorithm for the multidimensional knapsack problem," Journal of Heuristics, vol. 4, pp. 63-86, 1998.
3. J.E. Beasley and P.C. Chu, "A genetic algorithm for the set covering problem," Europ. J. Opl. Res, vol. 94, pp. 392-404, 1996.
4. D. Fayard and G. Plateau, "An algorithm for the solution of the 0-1 knapsack problem," Computing, vol. 28, pp. 269-287, 1982.
5. M. Hifi, M. Michrafy and A. Sbihi, "Heuristic algorithms for the multiple-choice multidimensional knapsack problem," Journal of the Operational Research Society, vol. 55, pp. 1323-1332, 2004.
6. H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems, Springer, 2003.
7. S. Khan, K.F. Li, E.G. Manning, and MD. M. Akbar, "Solving the knapsack problem for adaptive multimedia systems," Studia Informatica, an International Journal, Special Issue on Cutting, Packing and Knapsacking Problems, vol. 2, no. 1, pp. 154-174, 2002.
8. S. Khan, "Quality adaptation in a multi-session adaptive multimedia system: Model and architecture," PhD Thesis, Department of Electronical and Computer Engineering, Uiversity of Victoria, May 1998.
9. H. Luss, "Minmax resource allocation problems: Optimization and parametric analysis," European Journal of Operational Research, vol. 60, pp. 76-86, 1992.
10. S. Martello, D. Pisinger, and P. Toth, "Dynamic programming and strong bounds for the 0-1 knapsack problem," Management Science, vol. 45, pp. 414-424, 1999.
11. M. Moser, D.P. Jokanović, and N. Shiratori, "An algorithm for the multidimesional multiple-choice knapsack problem," IEECE Transactions on Fundamentals of Electronics, vol. 80, no. 3, pp. 582-589, 1997.
12. J.S. Pang and C.S. Yu, "A min-max resource allocation problem with substitutions," European Journal of Operational Research, vol. 41, pp. 218-223, 1989.
13. D. Pisinger, "A minimal algorithm for the 0-1 knapsack problem," Operations Research, vol. 45, pp. 758-767, 1997.
14. D. Pisinger, "A minimal algorithm for the Multiple-choice Knapsack Problem," European Journal of Operational Research, vol. 83, pp. 394-410, 1995.
15. J. Richardson, M. Palmer, G. Liepins, and M. Hilliard, "Some guidelines for genetic algorithms with penalty functions," in Proceedings of the Third International Conference on Genetic Algorithms, Schaffer J (Eds.), Maurgan Kaufmann, 1989 pp. 191-197.
16. Y. Toyoda, "A simplified algorithm for obtaining approximate solution to zero-one programming problems," Management Science, vol. 21, pp. 1417-1427, 1975.