Particle swarm optimization for the multidimensional knapsack problem

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

Volumn 4431 LNCS, Issue PART 1, 2007, Pages 358-365

  Hembecker, Fernanda ^a   Lopes, Heitor S ^a   Godoy Jr , Walter ^a  

^a UNIVERSIDADE TECNOLÓGICA FEDERAL DO PARANÁ   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; HEURISTIC ALGORITHMS; MATHEMATICAL PROGRAMMING; STOCHASTIC MODELS;

DISCRETE OPTIMIZATION; KNAPSACK PROBLEM; PARTICLE SWARM OPTIMIZATION;

PROBLEM SOLVING;

EID: 38049051725     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71618-1_40     Document Type: Conference Paper

References (15)

1. Beasley, J.E.: ORLib - Operations Research Library. [http://people. brunel.ac.uk/~mastjjb/jeb/orlib/files/mknap2.txt], (2005).
2. Beasley, J.E., Chu, P.C.: Genetic algorithm for the multidimensional knapsack problem. Journal of Heuristics 4 (1998) 63-86.
3. Clerc, M.: The swarm and the queen: towards a deterministic and adaptive particle swarm optimization. In: Proc. IEEE Congress on Evolutionary Computation, vol. 3, pp. 1951-1957, (1999).
4. th Annual Conference on Evolutionary Programming, pp. 611-616, (1998).
5. Eberhart, R.C., Shi, Y.: Particle swarm optimization: developments, applications and resources. In: Proc. Congress on Evolutionary Computation, Seoul, Korea, vol. 1, pp. 81-86 (2001).
6. Hoff, A., Løkketangen, A., Mittet, I.: Genetic algorithm for 0/1 multidimensional knapsack problems. In: Proc. Norsk Informatikkonferanse, Molde, Norway, (1996).
7. Kennedy, J., Eberhart, R.C.: Swarm Intelligence. Morgan Kaufmann, San Francisco, USA (2001).
8. Khuri, S., Bäck, T., Heitkoetter, J.: The zero/one multiple knapsack problem and genetic algorithm. In: Proc. ACM Symposium on Applied Computing, Phoenix, USA, pp. 188-193 (1994).
9. th Hybrid Intelligent Systems Conference, Rio de Janeiro, Brazil, pp. 245-250 (2005).
10. Martelo, S., Toth P.: Knapsack Problems - Algorithms and Computer Implementations. John Wiley & Sons, New York, USA (1990).
11. Maruo, M.H., Lopes, H.S., Delgado, M.R.B.S.: Self-adapting evolutionary parameters: encoding aspects for combinatorial optimization problems. In: Raidl, G.R., Gottlieb, J. (eds.), Evolutionary Computation for Combinatorial Problems, LNCS, v. 3448 (2005) pp. 154-165.
12. Senyu. S., Toyoda, Y.: An approach to linear programming with 0-1 variables. Management Science 15 (1967) B196-B207.
13. Shih, W.: A branch and bound method for the multiconstraint zero-one knapsack problem. Journal of the Operational Research Society 30 (1979) 369-378.
14. Trelea, I.C.: The particle swarm optimization algorithm: convergence analysis and parameter selection. Information Processing Letters 85 (2003) 317-325.
15. Weingartner, H.M., Ness, D.N.: Methods for the solution of multi-dimensional 0/1 knapsack problems. Operations Research 15 (1967) 83-103.