A mini-swarm for the quadratic knapsack problem

Proceedings of the 2007 IEEE Swarm Intelligence Symposium, SIS 2007

Volumn , Issue , 2007, Pages 190-197

  Xie, Xiao Feng ^a   Liu, Jiming ^a  

^a HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; GLOBAL OPTIMIZATION; HEURISTIC METHODS; INFORMATION USE; LEARNING SYSTEMS; MATHEMATICAL OPERATORS;

ELEMENTAL OPERATORS; HEURISTIC INFORMATION; MINI-SWARM SYSTEMS; QUADRATIC KNAPSACK PROBLEM (QKP);

PROBLEM SOLVING;

EID: 34548776496     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SIS.2007.368045     Document Type: Conference Paper

References (57)

1. J. R. Anderson, Learning and Memory: an Integrated Approach. New York: Wiley, 1995.
2. E. Balas and E. Zemel, "An algorithm for large zero-one knapsack problems," Operations Research, vol. 28, pp. 1130-1154, 1980.
3. [3]A. Billionnet and F. Calmeis, "Linear programming for the 0-1 quadratic knapsack problem," European Journal of Operational Research, vol. 92, pp. 310-325, 1996.
4. A. Billionnet, A. Faye, and É. Soutif, "A new upper bound for the 0-1 quadratic knapsack problem," European Journal of Operational Research, vol. 112, pp. 664-672, 1999.
5. A. Billionnet and È. Soutif, "An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem," European Journal of Operational Research, vol. 157, pp. 565-575, 2004.
6. S. I. Birbil, S.-C. Fang, and R.-L. Sheu, "On the convergence of a population-based global optimization algorithm," Journal of Global Optimization, vol. 30, pp. 301-318, 2004.
7. E. Bonabeau, M. Dorigo, and G. Theraulaz, Swarm Intelligence: From Natural to Artificial Systems. UK: Oxford University Press, 1999.
8. Y. Borenstein and R. Poli, "Information landscapes," Genetic and Evolutionary Computation Conference, Washington DC, USA, pp. 1515-1522, 2005.
9. R. Boyd and P. J. Richerson, The Origin and Evolution of Cultures. New York: Oxford University Press, 2005.
10. A. Caprara, D. Pisinger, and P. Toth, "Exact solution of the Quadratic Knapsack Problem," INFORMS Journal on Computing, vol. 11, pp. 125-137, 1999.
11. P. C. Chu and J. E. Beasley, "A genetic algorithm for the multidimensional knapsack problem," Journal of Heuristics, vol. 4, pp. 63-86, 1998.
12. M. Clerc, Particle Swarm Optimization. London: ISTE Publishing Company, 2006.
13. C. A. C. Coello, G. T. Pulido, and M. S. Lechuga, "Handling multiple objectives with particle swarm optimization," IEEE Transactions on Evolutionary Computation, vol. 8, pp. 256-279, 2004.
14. G. B. Dantzig, "Discrete-variable extremum problems," Operations Research, vol. 5, pp. 266-277, 1957.
15. M. Dorigo, V. Maniezzo, and A. Colorni, "The ant system: optimization by a colony of cooperating agents," IEEE Trans. Systems, Man, and Cybernetics - Part B, vol. 26, pp. 1-13, 1996.
16. A.P. Engelbrecht, Fundamentals of Computational Swarm Intelligence: Wiley & Sons, 2005.
17. T. A. Feo and M. G. C. Resende, "Greedy randomized adaptive search procedures," Journal of Global Optimization, vol. 6, pp. 109-133, 1995.
18. B. Freisleben and P. Merz, "New genetic local search operators for the traveling salesman problem," International Conference on Parallel Problem Solving from Nature, Berlin, Germany, pp. 890 - 899, 1996.
19. B. G. Galef and K. N. Laland, "Social learning in animals: Empirical studies and theoretical models," Bioscience, vol. 55, pp. 489-499, 2005.
20. G. Gallo, P. L. Hammer, and B. Simeone, "Quadratic knapsack problems," Mathematical Programming Study, vol. 12, pp. 132-149, 1980.
21. M. R. Garey and D. S. Johnson, ""Strong" NP-completeness results: motivation, examples, and implications," Journal of the ACM, vol. 25, pp. 499-508, 1978.
22. G. Gigerenzer and D. G. Goldstein, "Reasoning the fast and frugal way: models of bounded rationality," Psychological Review, vol. 103, pp. 650-669, 1996.
23. C. P. Gomes and B. Selman, "Algorithm portfolio design: theory vs. practice," Conference On Uncertainty in Artificial Intelligence, New Providence, RI, pp. 190-197, 1997.
24. P. L. Hammer and D. J. Rader, "Efficient methods for solving quadratic 0-1 knapsack problems," INFOR, vol. 35, pp. 170-182, 1997.
25. S. He, Q. H. Wu, and J. R. Saunders, "A novel group search optimizer inspired by animal behavioural ecology," IEEE Congress on Evolutionary Computation, Vancouver, BC, Canada, pp. 1272-1278, 2006.
26. C. Helmberg, F. Rendl, and R. Weismantel, "A semidefinite programming approach to the quadratic knapsack problem," Journal of Combinatorial Optimization, vol. 4, pp. 197-215, 2000.
27. J. H. Holland, Adaptation in natural and artificial systems. Ann Arbor: University of Michigan Press, 1975.
28. W. Hordijk, "A measure of landscapes," Evolutionary Computation, vol. 4, pp. 335-360, 1996.
29. Z. Hua, B. Zhang, and L. Liang, "An approximate dynamic programming approach to convex quadratic knapsack problems," Computers & Operations Research, vol. 33, pp. 660-673, 2006.
30. O. H. Ibarra and C. E. Kim, "Fast approximation algorithms for the knapsack and sum of subset problems," Journal of the ACM, vol. 22, pp. 463-468, 1975.
31. A. M. Isen, T. E. Shalker, M. Clark, and L. Karp, "Affect, accessibility of material in memory, and behavior: a cognitive loop?" Journal of Personality and Social Psychology, vol. 36, pp. 1-12, 1978.
32. B. A. Julstrom, "Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem," Genetic and Evolutionary Computation Conference, Washington DC, USA, pp. 607-614, 2005.
33. J. Kennedy and R. C. Eberhart, "Particle swarm optimization," IEEE International Conference on Neural Networks, Perth, Australia, pp. 1942-1948, 1995.
34. J. Kennedy, R. C. Eberhart, and Y. Shi, Swarm Intelligence. San Mateo, CA: Morgan Kaufmann, 2001.
35. J. E. Laird, A. Newell, and P. S. Rosenbloom, "SOAR - an architecture for general intelligence," Artificial Intelligence, vol. 33, pp. 1-64, 1987.
36. X. Li, J. Branke, and T. Blackwell, "Particle swarm with speciation and adaptation in a dynamic environment," Genetic and Evolutionary Computation Conference, Seattle, WA, USA, pp. 51-58, 2006.
37. J. Liu, X.-L. Jin, and K. C. Tsui, Autonomy Oriented Computing (AOC): From Problem Solving to Complex Systems Modeling: Kluwer Academic Publishers, 2005.
38. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations. New York, USA: John Wiley & Sons, 1990.
39. S. Martello, D. Pisinger, and P. Toth, "New trends in exact algorithms for the 0-1 knapsack problem," European Journal of Operational Research, vol. 123, pp. 325-332, 2000.
40. R. Mendes, J. Kennedy, and J. Neves, "The fully informed particle swarm: Simpler, maybe better," IEEE Transactions on Evolutionary Computation, vol. 8, pp. 204-210, 2004.
41. P. Michelon and L. Veilleux, "Lagrangean methods for the 0-1 quadratic knapsack problem," European Journal of Operational Research, vol. 92, pp. 326-341, 1996.
42. J. K. Olick and J. Robbins, "Social memory studies: From "collective memory" to the historical sociology of mnemonic practices," Annual Review of Sociology, vol. 24, pp. 105-140, 1998.
43. D. Pisinger, "Core problems in Knapsack algorithms," Operations Research, vol. 47, pp. 570-575, 1999.
44. D. Pisinger, "Where are the hard knapsack problems?" Computers and Operations Research, vol. 32, pp. 2271-2282, 2005.
45. D. Pisinger, A. Bo Rasmussen, and R. Sandvik, "Solution of large-sized quadratic knapsack problems through aggressive reduction," INFORMS Journal on Computing, 2006.
46. D. J. Rader and G. J. Woeginger, "The quadratic 0-1 knapsack problem with series-parallel support," Operations Research Letters, vol. 30, pp. 159-166, 2002.
47. A. Rodriguez and J. A. Reggia, "Extending self-organizing particle systems to problem solving," Artificial Life, vol. 10, pp. 379-395, 2004.
48. R. Storn and K. V. Price, "Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces," J. Global Optimization, vol. 11, pp. 341-359, 1997.
49. G. Syswerda, "Uniform crossover in genetic algorithms," International Conference on Genetic Algorithms, San Mateo, CA, pp. 2-9, 1989.
50. N. A. Taatgen, "Learning without limits: from problem solving toward a unified theory of learning." Groningen, the Netherlands: University of Groningen, 1999.
51. G. Tao and Z. Michalewicz, "Inver-over operator for the TSP," International Conference on Parallel Problem Solving from Nature, Amsterdam, the Netherlands, pp. 803-812, 1998.
52. D. Weyns and T. Holvoet, "On the role of environments in multiagent systems," Informatica, vol. 29, pp. 409-421, 2005.
53. D. Whitley, "An overview of evolutionary algorithms: practical issues and common pitfalls," Information and Software Technology, vol. 43, pp. 817-831, 2001.
54. X.-F. Xie and W.-J. Zhang, "Solving engineering design problems by social cognitive optimization," Genetic and Evolutionary Computation Conference, Washington, USA, pp. 261-262, 2004.
55. X.-F. Xie and W.-J. Zhang, "SWAF: Swarm algorithm framework for numerical optimization," Genetic and Evolutionary Computation Conference, Seattle, Washington, USA, pp. 238-250, 2004.
56. X.-F. Xie and J. Liu, "A compact multiagent system based on autonomy oriented computing," IEEE/WIC/ACM International Conference on Intelligent Agent Technology, Compiègne, France, pp. 38-44, 2005.
57. X. Yao, "Global optimisation by evolutionary algorithms," International Symposium on Parallel Algorithm/Architecture Synthesis, Aizu-Wakamatsu, Japan, pp. 282-291, 1997.