Bringing order into the neighborhoods: Relaxation guided variable neighborhood search

Journal of Heuristics

Volumn 14, Issue 5, 2008, Pages 457-472

  Puchinger, Jakob ^a   Raidl, Günther R ^b  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Integer linear programming; Multidimensional knapsack problem; Variable neighborhood search

Indexed keywords

COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; INTEGER PROGRAMMING;

INTEGER LINEAR PROGRAMMING; MULTIDIMENSIONAL KNAPSACK PROBLEM; VARIABLE NEIGHBORHOOD SEARCH;

OPTIMIZATION;

EID: 51649083288     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-007-9048-9     Document Type: Article

References (23)

1. Chu, P.C., Beasley, J.: A genetic algorithm for the multiconstrained knapsack problem. J. Heur. 4, 63-86 (1998)
2. Duin, C., Voß, S. The pilot method: a strategy for heuristic repetition with application to the steiner problem in graphs. Networks 34, 181-191 (1999)
3. Dumitrescu, I., Stuetzle, T.: Combinations of local search and exact algorithms. In: Raidl, G.R., Meyer, J.-A., Middendorf, M., Cagnoni, S., Cardalda, J.J.R., Corne, D.W., Gottlieb, J., Guillot, A., Hart, E., Johnson, C.G., Marchiori, E. (eds.) Applications of Evolutionary Computation. LNCS, vol. 2611, pp. 211-223. Springer, Berlin (2003)
4. Fréville, A.: The multidimensional 0-1 knapsack problem: an overview. Eur. J. Oper. Res. 155, 1-21 (2004)
5. Gavish, B., Pirkul, H.: Efficient algorithms for solving the multiconstraint zero-one knapsack problem to optimality. Math. Program. 31, 78-105 (1985)
6. Gilmore, P., Gomory, R.: The theory and computation of knapsack functions. Oper. Res. 14, 1045-1075 (1966)
7. Glover, F., Kochenberger, G.: Critical event tabu search for multidimensional knapsack problems. In: Osman, I., Kelly, J. (eds.) Metaheuristics: Theory and Applications, pp. 407-427. Kluwer Academic, Dordrecht (1996)
8. Hansen, P., Mladenović, N.: An introduction to variable neighborhood search. In: Voß, S., Martello, S., Osman, I., Roucairol, C. (eds.) Metaheuristics, Advances and Trends in Local Search Paradigms for Optimization, pp. 433-458. Kluwer Academic, Dordrecht (1999)
9. Hansen, P., Mladenović, N.: A tutorial on variable neighborhood search. Technical Report G-2003-46, Les Cahiers du GERAD, HEC Montréal and GERAD, Canada (2003)
10. Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)
11. Lorie, J., Savage, L.: Three problems in capital rationing. J. Bus. 28, 229-239 (1955)
12. Manne, A., Markowitz, H.: On the solution of discrete programming problems. Econometrica 25, 84-110 (1957)
13. Puchinger, J.: Combining metaheuristics and integer programming for solving cutting and packing problems. Ph.D. thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms (2006)
14. Puchinger, J., Raidl, G.R.: Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification. In: Proceedings of the First International Work-Conference on the Interplay Between Natural and Artificial Computation. LNCS, vol. 3562, pp. 41-53. Springer, Berlin (2005a)
15. Puchinger, J., Raidl, G.R.: Relaxation guided variable neighborhood search. In: Proceedings of the XVIII Mini EURO Conference on VNS, Tenerife, Spain (2005b)
16. Puchinger, J., Raidl, G.R., Gruber, M.: Cooperating memetic and branch-and-cut algorithms for solving the multidimensional knapsack problem. In: Proceedings of MIC2005, the 6th Metaheuristics International Conference, pp. 775-780, Vienna, Austria (2005)
17. Puchinger, J., Raidl, G.R., Pferschy, U.: The core concept for the multidimensional knapsack problem. In: Evolutionary Computation in Combinatorial Optimization-EvoCOP 2006. LNCS, vol. 3906, pp. 195-208. Springer, Berlin (2006)
18. Raidl, G.R., Gottlieb, J.: Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: a case study for the multidimensional knapsack problem. Evolut. Comput. J. 13(4), 441-475 (2005)
19. Shih, W.: A branch and bound method for the multiconstraint zero-one knapsack problem. J. Oper. Res. Soc. 30, 369-378 (1979)
20. Vasquez, M., Hao, J.-K.: A hybrid approach for the 0-1 multidimensional knapsack problem. In: Proceedings of the Int. Joint Conference on Artificial Intelligence, pp. 328-333 (2001)
21. Vasquez, M., Vimont, Y.: Improved results on the 0-1 multidimensional knapsack problem. Eur. J. Oper. Res. 165, 70-81 (2005)
22. Weingartner, H.M., Ness, D.N.: Methods for the solution of the multidimensional 0/1 knapsack problem. Oper. Res. 15, 83-103 (1967)
23. Wolsey, L.A.: Integer Programming. Wiley-Interscience, New York (1998)