A genetic algorithm for the quadratic multiple knapsack problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4729 LNCS, Issue , 2007, Pages 490-498

  Saraç, Tugba ^a   Sipahioglu, Aydin ^a  

^a ESKISEHIR OSMANGAZI UNIVERSITY   (Turkey)

Author keywords

Combinatorial optimization; Genetic algorithm; Quadratic multiple knapsack problem

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BIOELECTRIC PHENOMENA; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; CYBERNETICS; GENETIC ALGORITHMS; HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; QUADRATIC PROGRAMMING;

CAPACITY CONSTRAINTS; COMBINATORIAL OP-TIMIZATION PROBLEM; CROSSOVER OPERATORS; GENETIC ALGORITHM; INTERNATIONAL SYMPOSIUM; KNAPSACK PROBLEMS; MULTIPLE KNAPSACK PROBLEM; MUTATION OPERATORS; QUADRATIC MULTIPLE KNAPSACK PROBLEM;

DIESEL ENGINES;

EID: 49949086683     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75555-5_47     Document Type: Conference Paper

References (16)

1. Gallo, G., Hammer, P.L., Simeone, B.: Quadratic Knapsack Problems. Mathematical Programming Study 12, 132-149 (1980)
2. Chaillou, P., Hansen, P., Mahieu, Y.: Best network flow bound for the quadratic knapsack problem. In: Combinatorial Optimization. Lecture Notes in Mathematics, vol. 1403, pp. 225-235 (1986)
3. Michelon, P., Veuilleux, L.: Lagrangean methods for the 0-1 quadratic knapsack problem. European Journal of Operational Research 92, 326-341 (1996)
4. Billionnet, A., Calmels, F.: Linear programming for the 0-1 quadratic knapsack problem. European Journal of Operational Research 92, 310-325 (1996)
5. Caprara, A., Pisinger, D., Toth, P.: Exact solution of the quadratic knapsack problem. INFORMS Journal on Computing 11, 125-137 (1999)
6. Helmberg, C., Rendi, F., Weismantel, R.: A semidefinite programming approach to the quadratic knapsack problem. Journal of Combinatorial Optimization 4, 197-215 (2000)
7. Billionnet, A., Soutif, E.: An exact method based on Lagrangean decomposition for the 0-1 quadratic knapsack problem. European Journal of operational research 157(3), 565-575 (2003)
8. Julstrom, B.A.: Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem. Proceedings of the Genetic and Evolutionary Computation Conference 1, 607-614 (2005)
9. Hiley, A., Julstrom, B.A.: The Quadratic multiple knapsack problem and three heuristic approaches to it. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 547-552 (2006)
10. Cotta, C., Troya, J.: A hybrid genetic algorithm for the 0-1 multiple knapsack problem. Artificial Neural Networks and Genetic Algorithms 3, 250-254 (1998)
11. Anagun, A.S., Saraç, T.: Optimization of performance of genetic algorithm for 0-1 knapsack problems using Taguchi method. In: Gavrilova, M., Gervasi, O., Kumar, V., Tan, C.J.K., Taniar, D., Laganà, A., Mun, Y., Choo, H. (eds.) ICCSA 2006. LNCS, vol. 3982, pp. 678-687. Springer, Heidelberg (2006)
12. Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)
13. Gen, M., Cheng, R.: Genetic Algorithms and Engineering Design. John Wiley & Sons, New York (1997)
14. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
15. Martello, S., Toth, P.: Knapsack Problems Algorithms and Computer Implementations. John Wiley & Sons, England (1990)
16. Martello, S., Toth, P.: Heuristic algorithms for the multiple knapsack problem. Computing 27, 93-112(1981)