Swarm Engineering for TSP (ResearchIndex)

See this document in CiteSeerX!

Swarm Engineering for TSP (Make Corrections)
D. Lee, S. Kazadi, R. Goodman Jisan Research Institute

Rate this article:

(Enter summary)
Abstract: Swarm engineering is the development of a swarm of cooperating agents commensurate to some criterion designed to produce a global outcome. Once the swarm has satised this criterion, it will accomplish the desired task. We present a theoretical formalism for understanding how swarm-based TSP optimization algorithms work. We generate a swarm criterion and show that two of the algorithms of Marco Dorigo satisfy these conditions, but to diering degrees. Finally, we present a new method of... (Update)

Active bibliography (related documents): More All
0.3: Evolving Finite-State Machine Strategies for Protecting Resources - Spears, Gordon (2000) (Correct)
0.3: Evolution of Strategies for Resource Protection Problems - Spears, Gordon (2000) (Correct)
0.0: Multiple Ant Colony Systems for the Busstop Allocation Problem - de Jong, Wiering (Correct)

Similar documents based on text: More All
0.8: Effects of Swarm Size on Cooperative Particle Swarm.. - van den Bergh, Engelbrecht (2001) (Correct)
0.6: Design and Implementation of the Swarm Storage Server - Rajesh Sundaram (1998) (Correct)
0.5: Programming the Swarm - Evans (2000) (Correct)

BibTeX entry: (Update)

@misc{ goodman-swarm,
  author = "Lee Kazadi Goodman",
  title = "Swarm Engineering for TSP",
  url = "citeseer.ist.psu.edu/439016.html" }