A scatter search method for the bi-criteria multi-dimensional {0,1}-knapsack problem using surrogate relaxation

Journal of Mathematical Modelling and Algorithms

Volumn 3, Issue 3, 2004, Pages 183-208

  Gomes Da Silva, Carlos ^a   Clímaco, João ^b   Figueira, José ^b,c  

^a POLYTECHNIC INSTITUTE OF LEIRIA   (Portugal)

^b INESC COIMBRA   (Portugal)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

Combinatorial optimization; Meta heuristics; Multi dimensional knapsack problem; Scatter search method; Surrogate relaxation

Indexed keywords

EID: 18744363346     PISSN: 15701166     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:JMMA.0000038617.09620.02     Document Type: Article

References (31)

1. Chardaire, P., McKeown, G. and Maki, J.: Application of GRASP to the multi-constraint knapsack problem, in Boers et al. (eds), Evoworkshop, Lecture Notes in Comput. Sci. 2037, Springer-Verlag, Berlin. 2001, pp. 30-39.
2. Coello, C., Veldhuizen, D. and Lamont, G.: Evolutionary Algorithms for Solving Multi-objective Problems, Kluwer Acad. Publ., Dordrecht, 2002.
3. Chu, P. and Beasley, J.: A genetic algorithm for the multi-dimensional knapsack problem, J. Heuristics 4 (1998), 63-86.
4. Deb, K.: Multi-Objective Optimization using Evolutionary Algorithms, Wiley, New York, 2001.
5. Dyer, M.: Calculating surrogate constraints, Math. Programming 19 (1980), 255-278.
6. Frévillle, A. and Plateau, G.: An efficient preprocessing procedure for the multi-dimensional 0-1 knapsack problem, Discrete Appl. Math. 49 (1994), 189-212.
7. Gandibleux, X., Mezdaoui, N. and Fréville, A.: A tabu search procedure to solve multiobjective combinatorial optimization problems, in R. Caballero, F, Ruiz and R. Steuer (eds), Proceedings of MOPCP96, Springer-Verlag, Berlin, 1996, pp. 29-1-300.
8. Gavish, B. and Pirkul, H.: Efficient algorithms for solving multi-constraint zero-one knapsack problems to optimality, Math. Programming 31 (1985), 78-105.
9. Gilmore, P. and Gomory, R.: The theory and computation of knapsack functions, Oper. Res. 14 (1966), 1045-1074.
10. Glover, F.: Surrogate constraint duality in mathematical programming, Oper. Res. 23(3) (1975), 434-451.
11. Glover, F.: Scatter search and path relinking, in D. Corne, M. Dorigo and F. Glover (eds). New Ideas in Optimization, McGraw-Hill, 1999, pp. 297-316.
12. Gomes da Silva, C., Figueira, J. and Clímaco, J.: An interactive procedure dedicated to the bi-criteria knapsack problem, Research Report 4, INESC-Coimbra, Portugal, 2003 (in Portuguese), http://www.inescc.pt/download/RR2003_04.pdf.
13. Gomes da Silva, C., Clímaco, J. and Figueira, J.: A scatter search method for bi-criteria knapsack problems, European J. Oper. Res. (2004), to appear.
14. Greenberg, H. and Pierskalla, W.: Surrogate mathematical programming, Oper. Res. 21 (1970), 924-939.
15. Hanafi, S. and Fréville, A.: An efficient tabu search approach for the 0-1 multi-dimensional knapsack problem, European J. Oper. Res. 106 (1998), 659-675.
16. Jaszkiewicz, A.: On the performance of multiple objective genetic local search on the 0/1 knapsack problem. A comparative experiment, Research Report RA-002/2000, Institute of Computing Science, Poznan University of Technology, Poznan, Poland, 2000.
17. Jaszkiewicz, A.: Genetic local search for multi-objective combinatorial optimization. European J. Oper. Res. 137 (2002), 50-71.
18. Jones, D., Mirrazavi, S. and Tamiz, M.: Multi-objective meta-heuristics: An overview of the current state-of-the-art, European J. Oper. Res. 137 (2002), 1-9.
19. Levenhagen, J., Bortfeldt, A. and Gehring, H.: Path tracing in genetic algorithms applied to the multiconstrained knapsack problem, in Boers et al. (eds), Evoworkshop, Lecture Notes in Computer Sci. 2037, Springer-Verlag, Berlin, 2001, pp. 40-49.
20. Loulou, R. and Michaelides, E.: New greedy-like heurisics for the multi-dimensional 0-1 knapsack problem, Oper. Res. 27(6) (1979), 1101-1114.
21. Magazine, M. and Oguz, O.: A heuristic algorithm for the multi-dimensional zero-one knapsack problem, European J. Oper. Res. 16 (1984). 319-326.
22. Pirkul, H.: A heuristic solution procedure for the multi-constraint zero-one knapsack problem, Naval Res. Logist. 34 (1987), 161-172.
23. Sarin, S., Karwan, M. and Rardin, R.: Surrogate duality in a branch-and-bound procedure for integer programming, European J. Oper. Res. 33 (1988), 326-333.
24. Schott, J.: Fault tolerance design using single and multi-criteria genetic algorithms, Master's thesis, Massachusetts Institute of Technology.
25. Senju, S. and Toyoda, Y.: An approach to linear programming with 0-1 variable, Management Sci. 15(4) (1968), 196-207.
26. Shin, W.: A branch and bound method for the multi-constraint zero-one knapsack problem, J. Oper. Res. Soc. 30 (1979), 369-378.
27. Ulungu, E., Teghem, J., Fortemps, Ph. and Tuyttens, D.: A MOSA method: A tool for solving multiobjective combinatorial optimization problems, J. Multi-Criteria Decision Anal. 8 (1999), 221-236.
28. Vasquez, M. and Hao, J.: A hybrid approach for the 0-1 multi-dimensional knapsack problem, in Proceedings of IJCAI-01, Seatle, Washington, 2001.
29. Weingartner, H. and Ness, D.: Method for the solution of the multi-dimensional 0-1 knapsack problem, Oper. Res. 15 (1967), 83-103.
30. Zitzler, E.: Evolutionary algorithms for multiobjective optimization: Methods and applications, Ph.D. thesis, Swiss Federal Institute of Technology of Zurich, Zurich, Switzerland, 1999.
31. Zitzler, E. and Thiele, L.: Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto Approach, IEEE Trans. Evolutionary Comput. 3(4) (1999), 257-271.