Research Article
The Multiagent Planning Problem
Table 1
Comparison between the proposed GAID, the Ant Colony Optimization, and the Modified Genetic Algorithm methods. Results are averaged over simulations. The number of targets is included in the TSPLIB problem name. is the maximum number of targets an agent can visit. For each case, the fixed number of agents is considered, starting from the same location (one-depot problem). Only the greedy initialization method is used.
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||