Ants and multiple knapsack problem

Proceedings - 6th International Conference on Computer Information Systems and Industrial Management Applications, CISIM 2007

Volumn , Issue , 2007, Pages 149-154

  Boryczka, Urszula ^a  

^a UNIVERSITY OF SILESIA   (Poland)

Author keywords

Ant colony optimization; Combinatorial optimization; Multiple knapsack problem

Indexed keywords

COMBINATORIAL OPTIMIZATION; HEURISTIC ALGORITHMS; INDUSTRIAL MANAGEMENT; INFORMATION MANAGEMENT; INFORMATION SYSTEMS; INFORMATION USE;

ANT COLONIES; HEURISTIC FUNCTIONS; MULTIPLE KNAPSACK PROBLEM; NEW APPROACHES; OPTIMIZATION ALGORITHMS; TOTAL PROFITS;

ANT COLONY OPTIMIZATION;

EID: 47749152671     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISIM.2007.12     Document Type: Conference Paper

References (12)

1. E. Bonabeau, M. Dorigo, and G. Theraulaz. Swarm Intelligence. From Natural to Artificial Systems. Oxford University Press, 1999.
2. M. Dorigo and L. M. Gambardella. A study of some properties of Ant-Q. In Proceedings of Fourth International Conference on Parallel Problem Solving from Nature, PPSNIV, pages 656-665, Berlin, 1996. Springer-Verlag.
3. M. Dorigo and L. M. Gambardella. Ant Colony System: A cooperative learning approach to the Traveling Salesman Problem. IEEE Trans. Evol. Comp., 1:53-66, 1997.
4. M. Dorigo and T. Stützle. Ant Colony Optimization. The MIT Press, 2004.
5. L. M. Gambardella and M. Dorigo. HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem. Technical Report 11, IDSIA, 1997.
6. M. S. Hung and J. C. Fisk. An algorithm for 0-1 multiple knapsack problems. Naval Res. Logist. Quartely, 24:571-579, 1978.
7. R. M. Karp. Reducibility among combinatorial problems. Complexity of Computer Computations, 1972.
8. G. Leguizamón and Z. Michalewicz. A new version of Ant System for subset problems. In Proceedings of the 1999 Congress on Evolutionary Computation, pages 1459-1464, Piscataway, NJ, 1999. IEEE Press.
9. S. Martello and p. Toth. A branch and bound algorithm for the zero-one multiple knapsack problem. Discrete Applied Math., 3:275-288, 1981.
10. S. Martello and P. Toth. Solutionof the zero-one multiple knapsack problem. Euro J. Oper. Res., 4:322-329, 1980.
11. S. Martello and P. Toth. Heuristic algorithms for the multiple knapsack problem. Computing, 27:93-112, 1981.
12. S. Martello and P. Toth. Lower bounds and reduction procedures for the bin packing problem. Discrete Applied Math., 28:59-70, 1990.