A search for a robust optimization methodology for addressing dynamic problems in business and engineering has been in research for the past decade. One such tool in the array of algorithms is the Ant algorithms, inspired by the behavior of the real ants.
4. Conclusions
Ant algorithms belong to a class of Meta heuristics, which have a gamut of application to practical problems faced in business and industrial environments. The various applications described above highlights that ant algorithms can be applied to many of these practical scenarios. These algorithms are basically inspired by the observation of and applying the various behaviors of real ants such as foraging and brooding behaviors which can provide good solutions to real time optimization problems. The indirect communication and the co-operative interaction of the artificial ant agents, which is inspired from their real living counterpart, exhibit great flexibility and responsiveness to dynamic problems. The application of these algorithms and experimental validation of them is greatly researched owing to their capability to provide near global optimal solution to a given complex problem structure like local search, image mapping and compression, database search. Other than the examples enumerated above there are many unexplored paths where in the ant algorithms can be successfully applied and latest research emphasis is on the use of such swarm-intelligence methodologies.
References
1. Laguna, M., Global Optimization and Meta-heuristics, Encyclopedia of Life Support Systems (To appear)
<doc.guandang.net; (29 September 2001).
2. Digalakis, J., and Margaritis, K., 2000, A Survey for Metaheuristic Algorithms, Internal Report 04, University
of Macedonia, Parallel Distributed Processing Laboratory Thessaloniki, Greece. <doc.guandang.net; (29 September 2001).
3. Hao, J.K., April 2001, Metaheuristics for Combinatorial Optimization (slides of a tutorial).
<doc.guandang.net; (29 September 2001).
4. Anderson, C., and Bartholdi, J.J., 2000, “ Centralized Versus Decentralized Control in Manufacturing: Lessons
from Social Insects”, Proceedings of Complexity and Complex Systems in Industry, September 19-20, University of Warwick, 92-105.
5. Bios Group, 2001, Bios Group Inc. <doc.guandang.net; (27 December 2001)
6. Dorigo,M., Di Caro, G., and Gambardella, M, L.,1999, Ant Algorithms for Discrete Optimization, Artificial
Life, 5(2), 137-172.
7. Dorigo M., Maniezzo, V., and Colorni, A., 1991, Positive Feedback as a Search Strategy. Technical Report No.
91-016, Politecnico di Milano, Italy.
8. Dorigo, M., Maniezzo, V., and Colorni, A., 1996, Ant System: Optimization by a Colony of Cooperating
Agents. IEEE Transactions on Systems, Man, and Cybernetics - Part B: Cybernetics, 26(1), 29-41.
9. Anthes, H, G., Ant Colony IT, 2001, Computer World
<doc.guandang.net; (27 December 2001)
10. Dorigo, M., Maniezzo, V., and Colorni, A., 1991, The Ant System: An Autocatalytic Optimizing Process,
Technical Report No. 91-016 Revised, Politecnico di Milano, Italy.
11. Dorigo, M., and Di caro, G., 1999, “The Ant Colony Optimization Meta-Heuristic”, appears in New Ideas in
Optimization, Corne D., Dorigo, M., and Glover, F., (eds), McGraw-Hill, England, 11-32.
12. Dorigo, M., and Stuetzle, T., 2000, The Ant Colony Optimization Metaheuristic: Algorithms, Applications and
Advances, Technical Report IRIDIA/2000-32, IRIDIA, Universite Libre de Bruxelles, Belgium.
13. Stützle, T., and Dorigo, M., 2001, “An Experimental Study of the Simple Ant Colony Optimization
Algorithm”, Proceedings of the 2001 WSES International Conference on Evolutionary Computation (EC'01), WSES-Press International.
14. Cartwright, M.H., and Hopkins, A.J., 1996, “Evolutionary Design of Synthetic Routes in Chemistry”
Proceedings of the AISB Conference on Evolutionary Computing, University of Sussex, Brighton, UK, 34-48.
15. Maniezzo, V., and Carbonaro, A., 1999, “Ant Colony Optimization: An Overview”, Proceedings of MIC'99 III
Metaheuristics International Conference, Brazil.
16. Zwaan, S.V., and Marques, C.,1999, “Ant Colony Optimization for Job Shop Scheduling”, Proceedings of the
'99 Workshop on Genetic Algorithms and Artficial Life GAAL'99, Lisbon, Portugal.
17. Cicirello, V.A., and Smith S, 2001, “Ant Colony Control for Autonomous Decentralized Shop Floor Routing”,
ISADS-2001: Fifth International Symposium on Autonomous Decentralized Systems, IEEE Computer Society.
18. Gravel M., Price W., Gagn C., 2001, Scheduling Continuous Casting of Aluminum using a Multiple-Objective
Ant Colony Optimization Metaheuristic, Document de Travail, Facult des Sciences de l' Administration, University of Laval, Quebec, Canada. (Submitted for publication).
19. Bland, J.A., 2001, Optimal Structural Design by Ant Colony Optimization, Engineering Optimization, 33, 425-
443.
Ant algorithms Review an... 7页 免费 Ant Algorithms...Future Generation Computer Systems 16 (2000) v–...applications of ant algorithms to adaptive routing...
Ant algorithms Review an... 7页 免费 Review of Approximation ... 10页 ...Algorithms for Communications Systems and their Applications Main Contents ? ?...
Abstract Applications of... 暂无评价 8页 免费 Ant algorithms Review an......Abstract Methodological Review Traversing the tangle Algorithms and applications ...
Ant algorithms Review an... 7页 免费 The ant colony optimizat... 42页 ...Ant Algorithms 4.1 Chapter 4 Some applications of distributed intelligence —...
review of applications of Ant Search (AS) being...Algorithms (ASGA) system and provides an overview...future work that is planned with this system and...
Recent applications cover problems like vehicle routing, sequential ordering, graph coloring, routing in communications networks, and so on. Ant algorithms ...
and Heuristic Applications Conclusions and future ...Neural network, Simulated annealing, Ant colony algorithm...everyone can create different algorithms flexibly S...
Ant Algorithms Solve Difficult Optimization Problems Abstract. The ant algorithms research field builds on the idea that the study of the behavior of ant co...
Recent applications cover problems like vehicle routing, sequential ordering, graph coloring, routing in communications networks, and so on. Ant algorithms ...
The research team applied these two applications of the meta-scheme to a ...2. Meta-Scheme of Ant Algorithms 2.1. Ant Algorithms and Ant Colony ...
热门文档