A new version of ant system for subset problems

Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999

Volumn 2, Issue , 1999, Pages 1459-1464

  Leguizamon, Guillermo ^a   Michalewicz, Zbigniew ^b,c  

^a UNIVERSIDAD NACIONAL DE SAN LUIS   (Argentina)

^b UNIVERSITY OF NORTH CAROLINA AT CHARLOTTE   (United States)

^c INSTITUTE OF COMPUTER SCIENCE   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; TRAVELING SALESMAN PROBLEM;

ACO ALGORITHMS; ANT COLONY OPTIMIZATION (ACO); ANT SYSTEMS; COMPUTATIONAL STUDIES; MULTIPLE KNAPSACK PROBLEM; ORDER PROBLEMS; POTENTIAL POWER;

PROBLEM SOLVING;

EID: 84901447899     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.1999.782655     Document Type: Conference Paper

References (10)

1. Beasley, J., "OR-Library: Distributing Test Problems by Electronic Mail"; e-mail: o.rlibrary@ic.ac.uk.
2. Chu, P. and Beasley, J. (1998). "A Genetic Algorithm for the Multi-constraint Knapsack Problem", Journal of Heuristics, Vol. 4, pp. 63-86.
3. Dorigo M. and G. Di Caro (1999). "The Ant Colony Optimization Meta-Heuristic". In D. Come, M. Dorigo and F. Glover (eds), New Ideas in Optimization. McGraw-Hill, 1999. (Also available as: Tech. Rep. IRIDIA/99-1, Universite Libre de Bruxelles, Belgium.)
4. Dorigo M. and L. M. Gambardella (1997). "Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem". IEEE Transactions on Evolutionary Computation, Vol. 1, No. 1, pp. 53-66.
5. Dorigo M., V. Maniezzo, and A. Colorni (1991). "Positive feedBäck as a search strategy". Tech. Rep. No. 91-016, Politecnico di Milano, Italy.
6. Leguizamon, G.; Crespo, M. L.; Kavka, C. and Cena, M. (1997). "The Ant Colony Metaphor for Multiple Knapsack Problem". Proceedings of the 3th Congreso Argentino en Ciencias de la Computacion. pp. 1080-1090. La Plata, Argentina. October 1997.
7. Leguizamon, G.; Crespo, M. L.; Kavka, C. and Cena, M. (1998). "A Study of Performance of an Ant Colony System applied to Multiple Knapsack Problem". Proceedings of EIS-98, E. Apayd (ed), pp. 567-573. ICSC Academic.
8. Leguizamon, G. and Michalewicz, Z. (1999). "Ant Systems for Subset Problems", in preparation.
9. Khuri, S.; Bäck, T. and Heitkotter, J. (1994). "The Zero/One Multiple Knapsack Problem and Genetic Algorithms". Proceedings of the 1994 ACM Symposium on Applied Computing, E. Deaton and D. Oppenheim and J. Urban and H. Berghel (eds), pp. 188-193. ACM Press, New York.
10. Wilkinson, B. and Allen, M. (1997). "Parallel Programming Techniques and Application Using Networked Workstations". Preliminary Draft. Prentice Hall.