The ant colony metaphor for searching continuous design spaces

  • G. Bilchev
  • I. C. Parmee
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 993)

Abstract

This paper describes a form of dynamical computational system—the ant colony—and presents an ant colony model for continuous space optimisation problems. The ant colony metaphor is applied to a real world heavily constrained engineering design problem. It is capable of accelerating the search process and finding acceptable solutions which otherwise could not be discovered by a GA. By integrating the Pareto optimality concept within the selection mechanism in GAs and Ant Colony it is possible to treat both hard and soft constraints. Hard constraints participate in a penalty term while soft constraints become part of a multi-criteria formulation of the problem.

Keywords

artificial ant colony co-operative searches dynamical computational systems evolutionary computing genetic algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D.E.Rumelhart and J.L.McClelland, Parallel Distributed Processing: Explorations in the Microstructure of Cognition, Volume 1, Bradford Books, Cambridge, MAGoogle Scholar
  2. Deniz Yuret, and Michael de la Maza, Dynamic Hill Climbing: Overcoming the limitations of optimization techniques, Technical report, Numinous Noetics Group, Artificial Intelligence Laboratory, MIT, MA 02139Google Scholar
  3. George Bilchev, Evolutionary Algorithms for the Bin-packing Problem, Chapter 4, Comparison between Ant Colony Search and Genetic Algorithms, MSc thesis, 1994, New Bulgarian University, Sofia 1125, Bulgaria (in Bulgarian)Google Scholar
  4. George Bilchev, and I.C. Parmee, Searching Heavily Constrained Design Spaces, Procs. of the 22nd International Conference on CAD-95, 8–13 May, 1995, Yalta, Ukraine.Google Scholar
  5. George Bilchev, and I.C. Parmee, Natural Self-organizing Systems, Internal Report PEDC-03-95, Engineering Design Centre, University of Plymouth, UKGoogle Scholar
  6. Gerard Weisbuch, Complex Systems Dynamics, Lecture Notes Volume II, Santa Fe Institute, Studies in the Sciences of Complexity, Addison-Wesley, 1991Google Scholar
  7. I.C.Parmee, and G.Purchase, The Development of a Directed Genetic Search Technique for Heavily Constrained Design Spaces, in Proc. of Adaptive Computing in Engineering Design and Control, Plymouth, 1994.Google Scholar
  8. I.C. Parmee and M.J. Denham, Emergent Computing Methods in Engineering Design, NATO Advanced Research Workshop, Nafplio, Greece, August 1994.Google Scholar
  9. J.H.Holland, Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications in Biology, Control, and Artificial Intelligence, University of Michigan Press, Ann Arbor, 1975Google Scholar
  10. J.Torreele, Optimization by Simulated Annealing. Introduction and Case Study, AI-MEMO 88-18, AI-lab VUB, BrusslesGoogle Scholar
  11. Jeffray Horn, N. Nafpliotis, and D.E.Goldberg, A Niched Pareto Genetic Algorithm for multiobjective optimization, in Proceedings of the First IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Intelligence, Volume 1, 1994, Piscataway, NJGoogle Scholar
  12. Jeffrey Horn, David E. Goldberg, and Kalyanmoy Deb, Long Path Problems, Proceedings of Parallel Problem Solving from Nature, Lecture Notes in Computer Science, Springer-Verlag, 1995Google Scholar
  13. L.Nadel and D.Stein, eds., Better than the Best: The Power of Cooperation, Complex Systems, 163–184, Addison-Wesley 1993Google Scholar
  14. L.Steels, Artificial Intelligence and Complex Systems, AI-MEMO 88-2, AI-lab VUB, BrusselsGoogle Scholar
  15. Marco Dorigo, The Ant Cycle Algorithm, Technical report, Free University of BrusselsGoogle Scholar
  16. P.J.Courtois. On line and Space Decomposition of Complex Structures, Comm. of the ACM, Vol.28, no.6Google Scholar
  17. S.Kirkpatrick, Gelatt C.D., M.P.Vechi, Optimisation by Simulated Annealing, Science, Vol.220, No.4598, May, 1983Google Scholar
  18. Scott H. Clearwater, Bernardo A. Huberman, and Tad Hogg, Cooperative Problem Solving, in B. Huberman, editor, Computation: The Micro and the Macro View, pages 33–70, World Scientific, Singapore, 1992Google Scholar
  19. W.Kinzel, Learning and Pattern Recognition in Spin Glass Models, 1985Google Scholar

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • G. Bilchev
    • 1
  • I. C. Parmee
    • 1
  1. 1.Plymouth Engineering Design CentreUniversity of PlymouthUSA

Personalised recommendations