Journal
1. Abbaspour, K.C., R. Schulin and M.Th. van Genuchten, “Estimating unsaturated soil hydraulic parameters using ant colony optimization,” Advances in Water Resources , vol. 24, Issue. 8, pp. 827-841, August, 2001.
2. Boi, Silvia, Vincenzo Capasso and Daniela Morale, “Modeling the aggregative behavior of ants of the species Polyergus rufescens,” Nonlinear Analysis: Real World Applications, vol. 1, Issue. 1, pp. 163-176, March, 2000.
3. Brandts, Wendy A. M., A. Longtin and L.E.H. Trainor, “Two-category Model of Task Allocation with Application to Ant Societies,” Bulletin of Mathematical Biology, vol. 63, Issue. 6, pp. 1125-1161, November, 2001.
4. Britton, N. F., L. W. Partridge and N.R. Franks, “A mathematical model for the population dynamics of army ants,” Bulletin of Mathematical Biology , vol. 58, Issue. 3, pp. 471-492, May, 1996.
5. Chang, C.S., L. Tian and F.S. Wen, “A new approach to fault section estimation in power systems using Ant system,” Electric Power Systems Research, vol. 49, Issue. 1, pp. 63-70, February 15, 1999.
6. Changizi, M. A., M.A. Mcdannald and D. Widders, “Scaling of Differentiation in Networks: Nervous Systems, Organisms, Ant Colonies, Ecosystems, Businesses, Universities, Cities, Electronic Circuits, and Legos,” Journal of Theoretical Biology, vol. 218, Issue. 2, pp. 215-237, September 21, 2002.
7. Colorni A., M. Dorigo, F. Maffioli, V. Maniezzo, G. Righini and M. Trubian, “Heuristics from Nature for Hard Combinatorial Problems,” International Transactions in Operational Research, pp. 3(1):1-21, 1996.
8. Corbara, Bruno, Alain Dejean and Jérôme Orivel, “Ant gardens, a unique epiphyte-ant association,” lAnnee Biologique, vol. 38, Issue. 2, pp. 73-89, April 6, 1999.
9. Crist, Thomas O. and J.W. Haefner, “Spatial Model of Movement and Foraging in Harvester Ants (Pogonomyrmex) (II): The Roles of Environment and Seed Dispersion,” Journal of Theoretical Biology, vol. 166, Issue. 3, pp. 315-323, February 7, 1994.
10. Davidson, Diane W, “The role of resource imbalances in the evolutionary ecology of tropical arboreal ants,” Biological Journal of the Linnean Society, vol. 61, Issue. 2, pp. 153-181, June, 1997.
11. de Campos, Luis M., J.M. Fernández-Luna, J.A. Gámez and J.M. Puerta, “Ant colony optimization for learning Bayesian networks,” International Journal of Approximate Reasoning ,vol. 31, Issue. 3, pp. 291-311, November, 2002.
12. Dorigo, M. and L.M. Gambardella, ”Ant colony system: a cooperative learning approach to the traveling salesman problem,” IEEE Transactions on Evolutionary Computation, vol. 1, pp. 53-66, 1997.
13. Dorigo, M., L.M. Gambardella, M. Middendorf and T. Stutzle, ”Guest editorial: special section on ant colony optimization,” IEEE Transactions on Evolutionary Computation, vol. 6, pp. 317-319, 2002.
14. Dorigo, M., V. Maniezzo and A. Colorni, ”Ant system: optimization by a colony of cooperating agents,” IEEE Transactions on Systems, Man and Cybernetics, Part B, vol. 26, pp. 29-41, 1996.
15. Dorigo, Marco and L.M.Gambardella, “Ant colonies for the travelling salesman problem,” Biosystems , vol. 43, Issue. 2, pp. 73-81. July, 1997.
16. Dorigo, Marco, Eric Bonabeau and Guy Theraulaz, “Ant algorithms and stigmerg,” Future Generation Computer Systems , vol. 16, Issue. 8, pp. 851-871, June, 2000.
17. Dorigo, Marco, Gianni Di Caro and Thomas Stu¨tzle, “Ant algorithms,” Future Generation Computer Systems, vol.16, Issue. 8, pp. v-vii, June, 2000.
18. Eggers, Jan, Dominique Feillet, Steffen Kehl, W.M. Oliver and Bernard Yannou, “Optimization of the keyboard arrangement problem using an Ant Colony algorithm,” European Journal of Operational Research ,vol. 148, Issue. 3, pp. 672-686, August 1, 2003.
19. Elmes, G. W., J.A. Thomas, M.L. Munguira and K. Fiedler, “Larvae of lycaenid butterflies that parasitize ant colonies provide exceptions to normal insect growth rules,” Biological Journal of the Linnean Society, vol. 73, Issue. 3, pp. 259-278, July, 2001.
20. Evans, K.S. , C. Unsal and J.S. Bay, ”A reactive coordination scheme for a many-robot system,” IEEE Transactions on Systems, Man and Cybernetics, vol. 27, pp. 598-610, 1997.
21. Feener, Jr, Donald H., L.F. Jacobs, and J.O. Schmidt, “Specialized parasitoid attracted to a pheromone of ants,” Animal Behaviour, vol. 51, Issue. 1, pp. 61-66, January, 1996.
22. Gajardo, A., A. Moreira and E. Goles, “Complexity of Langton's ant,” Discrete Applied Mathematics, vol. 117, Issue. 1-3, pp. 41-50, March 15, 2002.
23. Gámez, José A. and J.M. Puerta, “Searching for the best elimination sequence in Bayesian networks by using ant colony optimization,” Pattern Recognition Letters ,vol. 23, Issue. 1-3, pp. 261-277, January, 2002.
24. Gravel, Marc, W.L. Price and Caroline Gagné, “Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic,” European Journal of Operational Research , vol. 143, Issue. 1, pp. 218-229, November 16, 2002.
25. Gutjahr, Walter J., “A Graph-based Ant System and its convergence,” Future Generation Computer Systems ,vol. 16, Issue. 8, pp. 873-888, June, 2000.
26. Gutjahr, Walter J., “ACO algorithms with guaranteed convergence to the optimal solution,” Information Processing Letters, vol. 82, Issue. 3, pp. 145-153, May 16, 2002.
27. Haefner, James W. and T.O. Crist, “Spatial Model of Movement and Foraging in Harvester Ants (Pogonomyrmex) (I): The Roles of Memory and Communication,” Journal of Theoretical Biology, vol. 166, Issue. 3, 1994, pp. 299-313, February 7.
28. Heck, P.S. and S. Ghosh, ”A study of synthetic creativity: behavior modeling and simulation of an ant colony,” IEEE [see also IEEE Expert] Intelligent Systems, vol. 15, pp. 58-66, 2000.
29. Helms Cahan, Sara, “Cooperation and conflict in ant foundress associations: insights from geographical variation,” Animal Behaviour , vol. 61, Issue 4, pp. 819-825, April, 2001.
30. Holway, David A. and T.J. Case, “Mechanisms of dispersed central-place foraging in polydomous colonies of the Argentine ant,” Animal Behaviour, vol. 59, Issue. 2, pp. 433-441, February, 2000.
31. Hoshyar, R. , S.H. Jamali and C. Locus, ”Ant colony algorithm for finding good interleaving pattern in turbo codes,” IEE Proceedings- Communications, vol. 147, pp. 257-262, 2000.
32. Huang Shyh-Jier, ”Enhancement of hydroelectric generation scheduling using ant colony system based optimization approaches,” IEEE Transactions on Energy Conversion, vol. 16, pp. 296-301, 2001.
33. Kube, C. Ronald and Eric Bonabeau, “Cooperative transport by ants and robots,” Robotics and Autonomous Systems, vol. 30, Issue. 1-2, pp. 85-101, January 31, 2000.
34. Lee, Zne-Jung, Chou-Yuan Lee and Shun-Feng Su, “weapon–target assignment problem,” Applied Soft Computing Journal , vol. 2, Issue. 1, pp. 39-47, August, 2002.
35. Maniezzo, V. and A. Colorni, ”The ant system applied to the quadratic assignment problem,” IEEE Transactions on Knowledge and Data Engineering, vol. 11, pp. 769-778, 1999.
36. Maniezzo, Vittorio and Antonella Carbonaro, “An ANTS heuristic for the frequency assignment problem,” Future Generation Computer Systems, vol. 16, Issue. 8, pp. 927-935, June, 2000.
37. Martin, Marc, Bastien Chopard and Paul Albuquerque, “Formation of an ant cemetery: swarm intelligence or statistical accident?,” Future Generation Computer Systems, vol. 18, Issue. 7, pp. 951-959, August, 2002.
38. McMullen, Patrick R., “An ant colony optimization approach to addressing a JIT sequencing problem with multiple objectives,” Artificial Intelligence in Engineering ,vol. 15, Issue. 3, pp. 309-317, July, 2001.
39. Merkle, D., M. Middendorf and H. Schmeck, ”Ant colony optimization for resource-constrained project scheduling,” IEEE Transactions on Evolutionary Computation, vol. 6, pp. 333-346, 2002.
40. Monmarche´, N., G. Venturini and M. Slimane, “On how Pachycondyla apicalis ants suggest a new search algorithm,” Future Generation Computer Systems , vol. 16, Issue. 8, pp. 937-946, June, 2000.
41. Montemanni, R., D.H. Smith and S.M. Allen, ”An ANTS algorithm for the minimum-span frequency-assignment problem with multiple interference,” IEEE Transactions on Vehicular Technology, vol. 51, pp. 949-953, 2002.
42. Nemes, L. and T. Roska, ”A CNN model of oscillation and chaos in ant colonies: a case study,” IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol. 42, pp. 741-745, 1995.
43. Nicolis, S. C. and J.L. Deneubourg, “Emerging Patterns and Food Recruitment in Ants: an Analytical Study,” Journal of Theoretical Biology , vol. 198, Issue. 4, pp. 575-592, June 21, 1999.
44. Parpinelli, R.S., H.S. Lopes and A.A. Freitas, ”Data mining with an ant colony optimization algorithm,” IEEE Transactions on Evolutionary Computation, vol. 6, pp. 321-332, 2002.
45. Rajesh, J., Kapil Gupta1, H.S. Kusumakar1, V.K. Jayaraman and B.D. Kulkarni, “Dynamic optimization of chemical processes using ant colony framework,” Computers and Chemistry ,vol. 25, Issue. 6, pp. 583 - 595, November, 2001.
46. Randall, Marcus and Andrew Lewis, “A Parallel Implementation of Ant Colony Optimization,” Journal of Parallel and Distributed Computing , vol. 62, Issue. 9, pp. 1421-1432, September, 2002.
47. Rust, Jes and Møller Andersen, N., “Giant ants from the Paleogene of Denmark with a discussion of the fossil history and early evolution of ants (Hymenoptera: Formicidae),” Zoological Journal of the Linnean Society, vol. 125, Issue. 3, pp. 331-348, March, 1999.
48. Sánchez-Piñero, F. and J.M. Gómez, “Use of ant-nest debris by darkling beetles and other arthropod species in an arid system in south Europe,” Journal of Arid Environments, vol. 31, Issue. 1, pp. 91-104, September, 1995.
49. Sekamatte, B., M. Latigo and S.A Russell, “The potential of protein- and sugar-based baits to enhance predatory ant activity and reduce termite damage to maize in Uganda,” Crop Protection, vol. 20, Issue. 8, pp. 653-662, September, 2001.
50. Sendova-Franks, Ana B. and Jan Vanlent, “Random Walk Models of Worker Sorting in Ant Colonies,” Journal of Theoretical Biology, vol. 217, Issue. 2, pp. 255-274, July 21, 2002.
51. Solnon, C., ”Ants can solve constraint satisfaction problems,” IEEE Transactions on Evolutionary Computation, vol. 6, pp. 347-357, 2002.
52. Song Yong-Hua and M.R. Irving, ”Optimisation techniques for electrical power systems. II. Heuristic optimisation methods,” Power Engineering Journal, vol. 15, pp. 151-160, 2001.
53. Song, Y.H., C.S. Chou and T.J. Stonham, “Combined heat and power economic dispatch by improved ant colony search algorithm,” Electric Power Systems Research, vol. 52, Issue. 2, pp. 115 - 121, November 1, 1999.
54. Stu¨tzle, Thomas and H.H. Hoos,” MAX–MIN Ant System,” Future Generation Computer Systems, vol. 16, Issue. 8, pp. 889-914, June, 2000.
55. Stutzle, T. and M. Dorigo, ”A short convergence proof for a class of ant colony optimization algorithms,” IEEE Transactions on Evolutionary Computation, vol. 6, pp. 358-365, 2002.
56. Subrata, R. and A.Y. Zomaya, ”A comparison of three artificial life techniques for reporting cell planning in mobile computing,” IEEE Transactions on Parallel and Distributed Systems, vol. 14, pp. 142-153, 2003.
57. Sumpter, D. J. T., G.B. Blanchard and D.S. Broomhead, “Ants and Agents: a Process Algebra Approach to Modelling Ant Colony Behaviour,” Bulletin of Mathematical Biology, vol. 63, Issue. 5, pp. 951-980, September, 2001.
58. Talbi, E.-G., O.Roux, C.Fonlupt and D.Robillard, “Parallel Ant Colonies for the quadratic assignment problem,” Future Generation Computer Systems, vol. 17, Issue. 4, pp. 441-449, January, 2001.
59. Teng Jen-Hao and Yi-Hwa Liu, ”A novel ACS-based optimum switch relocation method,” IEEE Transactions on Power Systems, vol. 18, pp. 113-120, 2003.
60. T'kindt, Vincent, Nicolas Monmarché, Fabrice Tercinet and Daniel Laügt, “An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem,” European Journal of Operational Research ,vol. 142, Issue. 2, pp. 250-257, October 16, 2002.
61. Torres, José-Leonel and L.E.H. Trainor, “Energy Function for a Model of Ant Colonies,” Journal of Theoretical Biology, vol. 165, Issue. 2, pp. 177-184, November 21, 1993.
62. Verbeeck, K. and A. Nowe, ”Colonies of learning automata,” IEEE Transactions on Systems, Man and Cybernetics, Part B, vol. 32, pp. 772-780, 2002.
63. Wagner, Israel A., Michael Lindenbaum and A.M. Bruckstein, “ANTS: Agents on Networks, Trees, and Subgraphs,” Future Generation Computer Systems , vol. 16, Issue. 8, pp. 915-926, June, 2000.
64. West, Bruce J. and Theo Nonnenmacher, “An ant in a gurge,” Physics Letters A , vol. 278, Issue. 5, pp. 255-259, January 8, 2001.
65. Whitehouse, Mary E. A. and Klaus Jaffe, “Ant wars: combat strategies, territory and nest defence in the leaf-cutting antAtta laevigata,” Animal Behaviour, vol. 51, Issue. 6, pp. 1207-1217, June, 1996.
66. Yu, I.K. and Y.H. Song, “A novel short-term generation scheduling technique of thermal units using ant colony search algorithms,” International Journal of Electrical Power and Energy Systems, vol. 23, Issue. 6, pp. 471-479, August, 2001.
Conference Papers
1. Abbass, H.A., Hoai Xuan and R.I. McKay, ”AntTAG: a new method to compose computer programs using colonies of ants,” Proceedings of the 2002 Congress on Evolutionary Computation(CEC '02), pp. 1654-1659, 2002.
2. Abbattista, F., N. Abbattista and L. Caponetti, ”An evolutionary and cooperative agents model for optimization,” IEEE International Conference on Evolutionary Computation, vol. 2, pp. 668-671, 1995.
3. Bauer, A., B. Bullnheimer, R.F. Hartl and C. Strauss, ”An ant colony optimization approach for the single machine total tardiness problem,” Proceedings of the 1999 Congress on Evolutionary Computation(CEC ’99), vol. 2, 1999.
4. Bendtsen, C.N. and T. Krink, ”Phone routing using the dynamic memory model,” Proceedings of the 2002 Congress on Evolutionary Computation(CEC '02), pp. 992-997, 2002.
5. Blum, C.and M. Sampels, ”Ant colony optimization for FOP shop scheduling: a case study on different pheromone representations,” Proceedings of the 2002 Congress on Evolutionary Computation(CEC '02), pp. 1558-1563, 2002.
6. Brun, O. and J.-M. Garcia, ”Ressource allocation in communication networks,” 5th IEEE International Conference on High Speed Networks and Multimedia Communications, pp. 229-233, 2002.
7. Bullnheimer B., R.F. Hartl and C. Strauss, “An Improved Ant system Algorithm for the Vehicle Routing Problem,” Annals of Operations Research, May 21-23, 1999.
8. Chu Chao-Hsien, JunHua Gu , Xiang Dan Hou and Qijun Gu, ”A heuristic ant algorithm for solving QoS multicast routing problem.,” Proceedings of the 2002 Congress on Evolutionary Computation(CEC '02),” pp. 1630-1635, 2002.
9. Cicirello, V.A.and S.F. Smith, ” Ant colony control for autonomous decentralized shop floor routing,” Proceedings. 5th International Symposium on Autonomous Decentralized Systems, pp. 383-390, 2001.
10. Colorni A., M. Dorigo and V. Maniezzo, “An Investigation of Some Properties of an Ant Algorithm,” Proceedings of the Parallel Problem Solving from Nature Conference (PPSN 92), Brussels, Belgium, pp.509-520, 1992.
11. Colorni A., M. Dorigo and V. Maniezzo, “Distributed Optimization by Ant Colonies,” Proceedings of the First European Conference on Artificial Life, Paris, France, pp.134-142, 1992.
12. Colorni A., M. Dorigo and V. Maniezzo, “New Results of an Ant System Approach Applied to the Asymmetric TSP,” Proceedings of the Metaheuristics International Conference, Hilton Breckenridge, Colorado, pp.356-360, 1995.
13. de A Silva, R.M. and G.L. Ramalho, ”Ant system for the set covering problem,” 2001 IEEE International Conference on Systems, Man, and Cybernetics, vol. 5, pp. 3129-3133, 2001.
14. Demir, S., ” Matching circuit design using ant colony optimization method,” IEEE Society International Conference on Anetnnas and Propagation, pp. 84-87, 2003.
15. Di Caro, G. and M. Dorigo, ”Mobile agents for adaptive routing,” Proceedings of the Thirty-First Hawaii International Conference on System Sciences, vol. 7, pp. 74-83, 1998.
16. Dorigo M. and L.M. Gambardella, “A Study of Some Properties of Ant-Q,” Proceedings of PPSN IV-Fourth International Conference on Parallel Problem Solving From Nature, Berlin, Germany, Berlin, pp. 656-665, September 22-27, 1996.
17. Dorigo, M. and G. Di Caro, ”Ant colony optimization: a new meta-heuristic,” Proceedings of the 1999 Congress on Evolutionary Computation (CEC ’99), vol. 2, 1999.
18. Dorigo, M., ”Learning by probabilistic Boolean networks,” IEEE World Congress on Computational Intelligence, IEEE International Conference on Neural Networks, vol. 2, pp. 887-891, 1994.
19. Forsyth P. and A. Wren, “An Ant System for Bus Driver Scheduling,” Presented at the 7th International Workshop on Computer-Aided Scheduling of Public Transport, Boston, August 1997.
20. Fournier, O., P. Lopez and J.-D. Lan Sun Luk, ”Cyclic scheduling following the social behavior of ant colonies,” 2002 IEEE International Conference on Systems, Man and Cybernetics, vol. 3, pp. 5, 2002.
21. Gambardella L.M. and M. Dorigo, “Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem,” Proceedings of ML-95, Twelfth International Conference on Machine Learning, Tahoe City, CA, pp. 252-260, 1995.
22. Gambardella, L.M. and M. Dorigo, ”Solving symmetric and asymmetric TSPs by ant colonies,” Proceedings of IEEE International Conference on Evolutionary Computation, pp. 622-627, 1996.
23. Gosavi, S. , S. Das, S. Vaze, G. Singh and E. Buehler, ”Obtaining subtrees from graphs: an ant colony approach,” Proceedings of the 2003 IEEE on Swarm Intelligence Symposium(SIS '03), pp. 160-166, 2003.
24. Gunes, M., U. Sorges and I. Bouazizi, ”ARA-the ant-colony based routing algorithm for MANETs,” International Conference on Parallel Processing Workshops, pp. 79-85, 2002.
25. Guntsch, M. , M. Middendorf, B. Scheuermann, O. Diessel, H. ElGindy, H. Schmeck and K. So, ”Population based ant colony opt.imization on FPGA,” Proceedings. 2002 IEEE International Conference on Field-Programmable Technology, pp. 125-132, 2002.
26. Heck, P.S. and S. Ghosh, ”A study of synthetic creativity through behavior modeling and simulation of an ant colony,” 5th International Symposium on Autonomous Decentralized Systems, pp. 391-397, 2001.
27. Hou Yun-He, Yao-Wu Wu , Li-Juan Lu and Xin-Yin Xiong, ”Generalized ant colony optimization for economic dispatch of power systems,” International Conference on Power System Technology, vol. 1, pp. 225-229, 2002.
28. Isaacs, J.C., R.K. Watkins and S.Y. Foo, ”Evolving ant colony systems in hardware for random number generation,” Proceedings of the 2002 Congress on Evolutionary Computation(CEC '02), pp. 1450-1455, 2002.
29. Islam, M.T., P. Thulasiraman and R.K. Thulasiram, ” A parallel ant colony optimization algorithm for all-pair routing in MANETs,” Proceedings on Parallel and Distributed Processing Symposium, pp. 259-266, 2003.
30. Kaji, T.,”Approach by ant tabu agents for Traveling Salesman Problem,” 2001 IEEE International Conference on Systems, Man, and Cybernetics, vol. 5, pp. 3429-3434, 2001.
31. Kawamura, H. and A. Ohuchi, ”Evolutionary emergence of collective intelligence with artificial pheromone communication,” 2000. IECON 2000. 26th Annual Confjerence of the IEEE on Industrial Electronics Society, vol. 4, pp. 2831-2836, 2000.
32. Konishi, M., T. Nishi, K. Nakano and K. Sotobayashi, ”Evolutionary routing method for multi mobile robots in transportation,” Proceedings of the 2002 IEEE Internatinal Symposium on Intelligent Control, pp. 490-495, 2002.
33. Korosec, P. , J. Silc and B. Robic, ”Mesh partitioning: a multilevel ant-colony-optimization algorithm,” Proceedings on Parallel and Distributed Processing Symposium, pp. 146-153, 2003.
34. Kubo, M. and Y. Kakazu, ”Simulating a competition for foods between ant colonies as a coordinated model of autonomous agents,” 'Systems Engineering in the Service of Humans', Conference Proceedings., International Conference on Systems, Man and Cybernetics, vol. 5, pp. 142-148, 1993.
35. Kumar M, V. and F. Sahin, ”A swarm intelligence based approach to the mine detection problem,” 2002 IEEE International Conference on Systems, Man and Cybernetics, vol. 3, pp. 6, 2002.
37. Lee Seung Gwan, Ung Jung Tae and Choong Chung Tae, ”An effective dynamic weighted rule for ant colony system optimization,” Proceedings of the 2001 Congress on Evolutionary Computation, vol. 2, pp. 1393-1397, 2001.
38. Leguizamon, G. and Z. Michalewicz, ”A new version of ant system for subset problems,” Proceedings of the 1999 Congress on Evolutionary Computation(CEC ’99), vol. 2, 1999.
39. Li Lianyuan, Zemin Liu and Zheng Zhou, ”A new dynamic distributed routing algorithm on telecommunication networks,” International Conference on Communication Technology Proceedings, vol. 1, pp. 849-852, 2000.
40. Li Yanjun and Tie-Jun Wu, ”A nested ant colony algorithm for hybrid production scheduling,” Proceedings of the 2002 on American Control Conference, vol. 2, pp. 1123-1128, 2002.
41. Liang Yun-Chia and A.E. Smith, ”An ant system approach to redundancy allocation,” Proceedings of the 1999 Congress on Evolutionary Computation(CEC ’99), vol. 2, 1999.
42. Liang Yun-Chia, Kulturel-Konak, S. and A.E. Smith, ”Meta heuristics for the orienteering problem,” Proceedings of the 2002 Congress on Evolutionary Computation(CEC '02), pp. 384-389, 2002.
43. Lucic, P. and D. Teodorovic, ”Transportation modeling: an artificial life approach,” 14th IEEE International Conference on Tools with Artificial Intelligence, pp. 216-223, 2002.
44. Merkle, D. , M. Middendorf and H. Schmeck, ”Pheromone evaluation in Ant Colony Optimization,” 26th Annual Confjerence of the IEEE on Industrial Electronics Society, vol. 4, pp. 2726-2731, 2000.
45. Merkle, D. and M. Middendorf, ”Fast ant colony optimization on reconfigurable processor arrays,” Proceedings 15th International on Parallel and Distributed Processing Symposium, pp. 1465-1472, 2001.
46. Merz, P. and B. Freisleben, ”A comparison of memetic algorithms, tabu search, and ant colonies for the quadratic assignment problem,” Proceedings of the 1999 Congress on Evolutionary Computation(CEC ’99), vol. 3, 1999.
47. Meshoul, S. and M. Batouche, ”Ant colony system with extremal dynamics for point matching and pose estimation,” Proceedings. 16th International Conference on Pattern Recognition, vol. 3, pp. 823-826, 2002.
48. Mostefai, N. and A. Bourjault, ”A modular approach using object-oriented Petri-nets to model ethology inspired scenarios for cooperative mobile minirobotics,” 1997 IEEE International Conference on Systems, Man, and Cybernetics, vol. 4, pp. 3827-3832, 1997.
49. Navarro Varela G. and M.C. Sinclair, “Ant Colony Optimization for Virtual-Wavelength-Path Routing and Wavelength Allocation,” Proceedings of the Congress on Evolutionary Computation (CEC'99), Washington DC, USA, July 1999.
50. Piriyakumar, D.A.L. and P. Levi, ”A new approach to exploiting parallelism in ant colony optimization,” Proceedings of 2002 International Symposium on Micromechatronics and Human Science, pp. 237-243, 2002.
51. Schoofs, L. and B. Naudts, ”Ant colonies are good at solving constraint satisfaction problems,” Proceedings of the 2000 Congress on Evolutionary Computation, vol. 2, pp. 1190-1195, 2000.
52. Schoofs, L. and B. Naudts, ”Swarm intelligence on the binary constraint satisfaction problem,” Proceedings of the 2002 Congress on Evolutionary Computation(CEC '02), pp. 1444-1449, 2002.
53. Schreyer, M. and G.R. Raidl, ”Letting ants labeling point features [sic.: for 'labeling' read 'label'],” Proceedings of the 2002 Congress on Evolutionary Computation(CEC '02), pp. 1564-1569, 2002.
54. Semet, V., E. Lutton and P. Collet, ”Ant colony optimisation for e-learning: observing the emergence of pedagogic suggestions,” Proceedings of the 2003 IEEE on Swarm Intelligence Symposium(SIS ’03), pp. 46-52, 2003.
55. Sim Kwang Mong and Weng Hong Sun, ”Multiple ant-colony optimization for network routing,” Proceedings. First International Symposium on Cyber Worlds, pp. 277-281, 2002. 1
56. Sisworahardjo, N.S. and A.A. El-Keib, ”Unit commitment using the ant colony search algorithm,” 2002 Large Engineering Systems Conference on Power Engineering , pp. 2-6, 2002.
57. Stützle T. and H. Hoos, “Improvements on the Ant System: Introducing the MAX-MIN Ant System,” ICANNGA97 - Third International Conference on Artificial Neural Networks and Genetic Algorithms, University of East Anglia, Norwich, UK, 1997.
58. Stutzle, T. and H. Hoos, ”MAX-MIN Ant System and local search for the traveling salesman problem,” IEEE International Conference on Evolutionary Computation, pp. 309-314, 1997.
59. Sun Ruoying, S. Tatsumi and Gang Zhao, ”Multiagent reinforcement learning method with an improved ant colony system,” IEEE International Conference on Systems, Man, and Cybernetics, vol. 3, pp. 1612-1617, 2001.
60. Sun Zhi-Guo and Hong-Fei Teng, ”An ant colony optimization based layout optimization algorithm,” Proceedings. 2002 IEEE Region 10 Conference on Computers, Communications, Control and Power Engineering , pp. 675 -678, 2002.
61. Teng Jen-Hao and Yi-Hwa Li, ”Application of the ant colony system for optimum switch adjustment,” Transmission and Distribution Conference and Exhibition 2002 , vol. 2, pp. 751-756, 2002.
62. Tsai Cheng-Fa and Chun-Wei Tsai,”A new approach for solving large traveling salesman problem using evolutionary ant rules,” Proceedings of the 2002 International Joint Conference on Neural Networks(IJCNN '02), pp. 1540-1545, 2002.
63. Tsai Cheng-Fa, Chun-Wei Tsai and Ching-Chang Tseng, ”A new approach for solving large traveling salesman problem,” Proceedings of the 2002 Congress on Evolutionary Computation(CEC '02), pp. 1636-1641, 2002.
64. Tsai Cheng-Fa, Han-Chang Wu and Chun-Wei Tsai, ”A new data clustering approach for data mining in large databases,” Proceedings. International Symposium on Parallel Architectures, Algorithms and Networks(I-SPAN '02), pp. 278-283, 2002.
65. Varela, G.N.and M.C. Sinclair, ”Ant colony optimisation for virtual-wavelength-path routing and wavelength allocation,” Proceedings of the 1999 Congress on Evolutionary Computation(CEC ’99), vol. 3, 1999.
66. Wagner, I.A. and A.M. Bruckstein, ”Hamiltonian(t)-an ant-inspired heuristic for recognizing Hamiltonian graphs,” Proceedings of the 1999 Congress on Evolutionary Computation(CEC ’99), vol. 2, 1999.
67. Wang Lei and Qidi Wu, ”Ant system algorithm for optimization in continuous space,” Proceedings of the 2001 IEEE International Conference on Control Applications(CCA ’01), pp. 395-400, 2001.
68. Wang Lei and Qidi Wu, ”Further example study on ant system algorithm based continuous space optimization,” Proceedings of the 4th World Congress on Intelligent Control and Automation, vol. 3, pp. 2541-2545, 2002.
69. Wang Lei and Qidi Wu, ”Linear system parameters identification based on ant system algorithm,” Proceedings of the 2001 IEEE International Conference on Control Applications (CCA '01), pp. 401-406, 2001.
70. Wang Lei and Qidi Wu, ”Performance evaluation of ant system optimization processes,” Proceedings of the 4th World Congress on Intelligent Control and Automation, vol. 3, pp. 2546-2550, 2002.
71. Wang Lei, Xiao-Ping Wang and Qi-Di Wu, ”Ant System algorithm based Rosenbrock function optimization in multi-dimension space,” Proceedings. 2002 International Conference on Machine Learning and Cybernetics, vol. 2, pp. 710-714, 2002.
72. Wang Xiao-rong and Tie-Jun Wu, ”Ant colony optimization for intelligent scheduling,” Proceedings of the 4th World Congress on Intelligent Control and Automation, vol. 1, pp. 66-70, 2002.
73. Wang Ying and Jianying Xie, ”Ant colony optimization for multicast routing,” The 2000 IEEE Asia-Pacific Conference on Circuits and Systems, pp. 54-57, 2000.
74. Wilson, M., C. Melhuish and A. Sendova-Franks, ”Creating annular structures inspired by ant colony behaviour using minimalist robots,” 2002 IEEE International Conference on Systems, Man and Cybernetics, pp. 53-58, 2002.
75. Wu bin and Zhongzhi Shi, ”A clustering algorithm based on swarm intelligence,” International Conferences on Info-tech and Info-net, Beijing, vol. 3, pp. 58-66, 2001.
76. Wu Bin, Yi Zheng, Shaohui Liu and Zhongzhi Shi, ”CSIM: a document clustering algorithm based on swarm intelligence,” Proceedings of the 2002 Congress on Evolutionary Computation(CEC '02), pp. 477-482, 2002.
77. Xiong Wei-Qing and Ping Wei, ”A kind of ant colony algorithm for function optimization,” Proceedings. 2002 International Conference on Machine Learning and Cybernetics, vol. 1, pp. 552-555, 2002.
78. Yang Xin-bin, Jing-gao Sun and Dao Huang, ”A new clustering method based on ant colony algorithm,” Proceedings of the 4th World Congress on Intelligent Control and Automation, vol. 3, pp. 2222-2226, 2002.
79. Yu In-Keun, C.S. Chou and Y.H. Song, ”Application of the ant colony search algorithm to short-term generation scheduling problem of thermal units,” International Conference on Power System Technology(POWERCON ’98), vol. 1, pp. 552-556, 1998.
Book Chapters
1. Dorigo M. and G. Di Caro, The Ant Colony Optimization Meta-Heuristic, McGraw-Hill, 1999.
2. Stützle T. and M. Dorigo, ACO Algorithms for the Traveling Salesman Problem, Evolutionary Algorithms in Engineering and Computer Science, 1999.
3. Stützle T. and M. Dorigo, ACO Algorithms for the Quadratic Assignment Problem, McGraw-Hill, 1999.
Technical Reports
1. Di Caro G. and M. Dorigo, “AntNet: A Mobile Agents Approach to Adaptive Routing,” Tech. Rep. IRIDIA/97-12, Université Libre de Bruxelles, Belgium
2. Dorigo M., V. Maniezzo and A. Colorni, “The Ant System: An Autocatalytic Optimizing Process,” Technical Report No. 91-016 Revised, Politecnico di Milano, Italy.
3. Maniezzo V., A. Colorni and M. Dorigo, “The Ant System Applied to the Quadratic Assignment Problem,” Tech. Rep. IRIDIA/94-28, Université Libre de Bruxelles, Belgium.
國內文獻
1. 吳志盛，” 啟發式演算法於最佳化與分群問題之研究”， 朝陽科技大學 資訊管理系碩士班，2002。
2. 李正彬，”一個新的神經網路學習法─蟻窩演算法”， 元智大學工業工程與管理研究所，2002。
3. 洪啟舜，” 行動式連續媒體伺服器之決策方法”， 淡江大學 資訊工程學系，2000。
4. 徐婕婷，” 最長共同子序列之研究”， 靜宜大學 資訊管理學系，2001。
5. 許為元，”複合式自我學習之基因演算法應用於旅行推銷員問題”， 臺灣大學 資訊工程學研究所，1999。
6. 陳隆熙，” 一個解決TSP問題最佳解的穩定方法—以TA演算法為例”， 大葉大學 工業工程研究所，2001。
7. 黃蕙華，”以電子地圖為基礎之電子商務物流系統”， 淡江大學 資訊工程學系，2000。
8. 蔡崇煒，” 多重搜尋基因演算法：一個新的有效解決通訊網路及資料庫中複雜問題之方法”， 屏東科技大學 資訊管理系，2001。
9. 蕭宗勝，”螞蟻族群演算法應用在組合問題之研究”， 銘傳大學 資訊管理研究所，2001。
10. 藍坤銘，”應用資料挖掘之順序樣式法於螞蟻理論之改善”，台北科技大學 生產系統工程與管理研究所，2002。
11. 何采燕，” 以巨集啟發式演算法求解旅行採購員問題”， 中華大學 科技管理研究所，2002。
12. 許宏賓，” 群蟻演算法於開放型排程問題求解模式建構”，大葉大學 工業工程研究所，2002。
13. 方志成，” 應用蟻群系統於自動化排程之研究”， 佛光人文社會學院 資訊學研究所，2002。
14. 劉源宏，”應用蟻群最佳化於時間序列資料探勘之研究”，輔仁大學 資訊管理學系，2002。
15. 林獻堂，”蟻元合作系統於投資決策之應用”，輔仁大學 資訊管理學系，2002。
16. 熊鴻鈞，” 螞蟻族群演算法於生產排程之應用”， 暨南國際大學 資訊管理學系，2002。
17. 朱文正，” 考量旅行時間可靠度之車輛途程問題─螞蟻族群演算法之應用”，國立交通大學 交通運輸研究所，2002。
18. 陳其斌，” 一個新的有效率智慧型方法-植基於疫苗的螞蟻系統”，屏東科技大學資訊管理系，2002。
19. 徐誠佑，” 螞蟻演算法求解零壹多限制式背包問題”，國立清華大學 工業工程與工程管理學系，2002。
20. 陳毓山，” 螞蟻演算法最佳化倒傳遞類神經網路於土層剪力波速評估之研究”，國立臺灣大學 土木工程學研究所，2002。
21. 陳建勛，” 蟻拓尋優法為基的擴充式零工生產排程器”，國立臺灣大學 工業工程學研究所，2002。
22. 劉昌憲，” 蟻拓物件分群尋優法及系統開發礎架”，國立臺灣大學 業工程學研究所，2002。
23. 蔡懷寬，”以TSP為基礎之演化式策略解生物資訊上生物晶片,定序,序列比對及演化學的問題”，國立臺灣大學 訊工程學研究所，2002。
24. 應國卿，”蟻群系統於排程問題之應用”，國立台灣科技大學 工業管理系，2002。
25. 江朋南，”蟻族系統在零工型排程問題之應用”，國立台灣科技大學 工業管理系，2002。
26. 劉昕岱，”蟻族系統求解週期市場問題之旅行序列策略”，國立台灣科技大學 工業管理系，2002。
27. 黃敏華，”應用螞蟻演算法於多階層供應鏈配送批量和車輛途程之訂定”，國立台灣科技大學 工業管理系，2002。
28. 林純行，”多階平行機器零工式多目標排程之模式化與系統之研究”，東海大學/工業工程學系，2002。
29. 林依潔，”整合模糊理論與螞蟻演算法於含時窗限制之車輛途程問題”，國立台北科技大學 生產系統工程與管理研究所，2002。
30. 詹金淩，”整合螞蟻理論與案例式推理於知識管理之應用”，國立台北科技大學生產系統工程與管理研究所，2002。
31. 周仕雄，”應用螞蟻系統於資料挖礦之集群分析”，國立台北科技大學生產系統工程與管理研究所，2002。
32. 陳偉星，”最少化與群組化整備策略在印刷電路板組裝之研究”，元智大學工業工程與管理學系，2002。
33. 黃宇辰，”應用混合螞蟻演算法於可靠度串並聯系統元件配置問題之研究”，元智大學工業工程與管理學系，2002。
34. 高秀梅，”蟻群最佳化演算法於時窗限制之車輛途程問題的研究”，元智大學工業工程與管理學系，2002。
35. 羅敏華，”蟻群最佳化演算法於載重限制之車輛途程問題的研究”，元智大學工業工程與管理學系，2002。
36. 蘇伯達，”以螞蟻系統探索關聯性規則”，國立清華大學工業工程與工程管理學系，2001。
相關連結
1. ANTS'2002 - From Ant Colonies to Artificial Ants: Third International Workshop on Ant Algorithms, Brussels, Belgium, 11.-14. September 2002. http://iridia.ulb.ac.be/~ants/ants2002/index.html
2. Ant Colony Optimization，http://iridia.ulb.ac.be/~mdorigo/ACO/index.html
3. An Introduction to Ant Algorithms and to Ant Colony Optimization, at ANTS'2000 - From Ant Colonies to Artificial Ants: Second International Workshop on Ant Algorithms, Brussels, Belgium, September 7, 2000. http://iridia.ulb.ac.be/~ants/ants2000/index.html
4. Ant Colony Optimization，http://www.alife.human.nagoya-u.ac.jp/~nakamiti/aco/