Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method

Computers and Operations Research

Volumn 39, Issue 9, 2012, Pages 2111-2121

  Li, Vincent C ^a   Liang, Yun Chia ^b   Chang, Huan Fu ^b  

^a NATIONAL CHIAYI UNIVERSITY   (Taiwan)

^b YUAN ZE UNIVERSITY   (Taiwan)

Author keywords

Adaptive memory projection; Critical event tabu search; Generalized upper bound; Heuristics; Multidimensional knapsack

Indexed keywords

ADAPTIVE MEMORY; CRITICAL EVENTS; GENERALIZED UPPER BOUND; HEURISTICS; MULTIDIMENSIONAL KNAPSACK;

BUDGET CONTROL; COMBINATORIAL OPTIMIZATION; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; SENSITIVITY ANALYSIS;

TABU SEARCH;

EID: 84855557865     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.10.016     Document Type: Article

References (50)

1. J. Lorie, and L. Savage Three problems in capital rationing The Journal of Business 28 1955 229 239
2. C. Peterson Computational experience with variants of the Balas algorithm applied to the selection of research and development projects Management Science 13 9 1967 736 750
3. P. Gilmore, and R. Gomory The theory and computation of knapsack functions Operations Research 14 6 1966 1045 1075
4. W. Shih A branch and bound method for the multiconstraint zero-one knapsack problem Journal of Operations Research Society 30 4 1979 369 378
5. S. de Vries, and R.V. Vohra Combinatorial auctions: a survey INFORMS Journal on Computing 15 3 2003 284 309 (Pubitemid 39042722)
6. R.M. Nauss The 01 knapsack problem with multiple choice constraints European Journal of Operational Research 2 2 1978 125 131
7. P. Sinha, and A.A. Zoltners The multiple-choice knapsack problem Operations Research 27 3 1979 503 515
8. R. Parra-Hernandez, and N. Dimopoulos A new heuristic for solving the multichoice multidimensional knapsack problem IEEE Transactions on Systems, Man and Cybernetics, Part A: Systems and Humans 35 5 2005 708 717 (Pubitemid 41488616)
9. M. Moser, D. Jokanovic, and N. Shiratori An algorithm for the multidimensional multiple-choice knapsack problem IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences E80-A 3 1997 582 589 (Pubitemid 127756115)
10. Khan S. Quality adaptation in a multi-session adaptive multimedia system: model and architecture. PhD thesis. Department of Electrical and Computer Engineering, University of Victoria, Victoria, British Columbia, Canada; 1998.
11. Chen L, Khan S, Li K, Manning E. Building an adaptive multimedia system using the utility model. In: Rolim J, et al., editors. Parallel and distributed processing, Lecture notes in computer science, vol. 1586. Berlin, Heidelberg: Springer; 1999. p 28998.
12. V.C. Li, G.L. Curry, and E.A. Boyd Towards the real time solution of strike force asset allocation problems Computers & Operations Research 31 2 2004 273 291 (Pubitemid 38092819)
13. W.E. Wilhelm, and E. Gokce Branch-and-price decomposition to design a surveillance system for port and waterway security IEEE Transactions on Automation Science and Engineering 7 2 2010 316 325
14. S. Martello, and P. Toth Knapsack problems 1990 Wiley New York, USA
15. M. Garey, and D. Johnson Computers and intractability: a guide to the theory of NP-completeness 1979 Freeman San Francisco, USA
16. F. Glover Adaptive memory projection methods for integer programming C. Rego, B. Alidaee, Metaheuristic optimization via memory and evolution: tabu search and scatter search 2005 Kluwer Academic Publishers Boston, USA 425 440 (Chapter 19)
17. D.P. Hans Kellerer Ulrich Pferschy, Knapsack problems 2004 Springer Berlin-Heidelberg, Germany
18. A. Fréville The multidimensional 01 knapsack problem: an overview European Journal of Operational Research 155 1 2004 1 21
19. A. Fréville, and S. Hanafi The multidimensional 01 knapsack problem-bounds and computational aspects Annals of Operations Research 139 1 2005 195 227 (Pubitemid 41363707)
20. H. Everett III Generalized Lagrange multiplier method for solving problems of optimum allocation of resources Operations Research 11 3 1963 399 417
21. M. Magazine, and O. Oguz A heuristic algorithm for the multidimensional 01 knapsack problem European Journal of Operational Research 16 3 1984 319 326 (Pubitemid 14583791)
22. Y. Toyoda A simplified algorithm for obtaining approximate solutions to zero-one programming problems Management Science 21 12 1975 1417 1427
23. S. Khan, K.F. Li, E.G. Manning, and M.M. Akbar Solving the knapsack problem for adaptive multimedia systems Studia Informatica, Special Issue on Combinatorial Problems 2 2 2002 157 178
24. M. Hifi, M. Michrafy, and A. Sbihi Heuristic algorithms for the multiple-choice multidimensional knapsack problem Journal of the Operational Research Society 55 12 2004 1323 1332
25. M. Hifi, M. Michrafy, and A. Sbihi A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem Computational Optimization and Applications 33 23 2006 271 285
26. H. Pirkul A heuristic solution procedure for the multiconstraint zero-one knapsack problem Naval Research Logistics 34 2 1987 161 172 (Pubitemid 17583439)
27. M.M. Akbar, M.S. Rahman, M. Kaykobad, E.G. Manning, and G.C. Shoja Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls Computers & Operations Research 33 5 2006 1259 1273 (Pubitemid 41428290)
28. C.S. Hiremath, and R.R. Hill New greedy heuristics for the multiple-choice multi-dimensional knapsack problem International Journal of Operational Research 2 4 2007 495 512
29. N. Cherfi, and M. Hifi A column generation method for the multiple-choice multi-dimensional knapsack problem Computational Optimization and Applications 46 1 2010 51 73
30. Hiremath C. New heuristic and metaheuristic approaches applied to the multiple-choice multidimensional knapsack problem. PhD thesis. Wright State University, Dayton, OH, USA; 2008.
31. F. Glover, and M. Laguna Tabu search 1998 Kluwer Academic Publishers Boston, USA
32. A. Sbihi A best first search exact algorithm for the multiple-choice multidimensional knapsack problem Journal of Combinatorial Optimization 13 4 2007 337 351 (Pubitemid 46540449)
33. T. Ghasemi, and M. Razzazi Development of core to solve the multidimensional multiple-choice knapsack problem Computers & Industrial Engineering 60 2 2011 349 360
34. A. Drexl A simulated annealing approach to the multiconstraint zero-one knapsack problem Computing 40 1 1988 1 8 (Pubitemid 18609207)
35. P. Chu, and J. Beasley A genetic algorithm for the multidimensional knapsack problem Journal of Heuristics 4 1 1998 63 86 (Pubitemid 128512788)
36. S. Hanafi, and A. Fréville An efficient tabu search approach for the 01 multidimensional knapsack problem European Journal of Operational Research 106 23 1998 659 675 (Pubitemid 128399674)
37. F. Glover, and G. Kochenberger Critical event tabu search for multidimensional knapsack problems I.H. Osman, J.P. Kelly, Metaheuristics: theory and applications 1996 Kluwer Academic Publishers Boston, USA 407 427
38. V.C. Li, and G.L. Curry Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search Computers & Operations Research 32 4 2005 825 848
39. Glover F. Surrogate constraints: tutorial notes, graduate school of business. University of Colorado, Boulder, CO, USA; 1998.
40. V.C. Li Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints Computers & Operations Research 32 11 2005 2843 2852 (Pubitemid 40244551)
41. W. Carlton, and J.W Barnes A note on hashing functions and tabu search algorithms European Journal of Operational Research 95 1996 237 239 (Pubitemid 126391985)
42. V.C. Li A perturbation-guided oscillation strategy for the multidimensional knapsack problem with generalized upper bound constraints X.-S. Zhang, D.-G. Liu, Y. Wang, Proceedings of the seventh international symposium on operations research and its applications. Lecture notes in operations research vol. 8 2008 World Publishing Company Beijing, PRC 369 376
43. R.R. Hill, Y.K. Cho, and J.T. Moore Problem reduction heuristic for the 01 multidimensional knapsack problem Computers & Operations Research 39 1 2012 19 26 (Special issue on knapsack problems and applications)
44. P. Shaw Using constraint programming and local search methods to solve vehicle routing problems M. Maher, J.F. Puget, Proceedings of CP'98 1998 Springer-Verlag 417 431 (Pubitemid 128151602)
45. C. Wilbaut, S. Salhi, and S. Hanafi An iterative variable-based fixation heuristic for the 01 multidimensional knapsack problem European Journal of Operational Research 199 2 2009 339 348
46. S. Hanafi, and C. Wilbaut Improved convergent heuristics for the 01 multidimensional knapsack problem Annals of Operations Research 183 1 2011 125 142
47. F. Glover A template for scatter search and path relinking J.-K. Hao, E. Lutton, E. Ronald, M. Schoenauer, D. Snyers, Artificial evolution, Lecture notes in computer science vol. 1363 1998 Springer London, UK 13 54 (Pubitemid 128044715)
48. M. Fischetti, and A. Lodi Local branching Mathematical Programming 98 1 2003 23 47
49. F. Glover Heuristics for integer programming using surrogate constraints Decision Sciences 8 1 1977 156 166
50. F. Glover Multi-start and strategic oscillation methodsprinciples to exploit adaptive memory M. Laguna, J.L. Gonzales-Velarde, Computing tools for modeling, optimization and simulation: interfaces in computer science and operations research 2000 Kluwer Academic Publishers Boston, USA 1 24