Multiple Ant Colony Systems for the Busstop Allocation Problem.

Jan J. de Jong, Wiering

2001 · 16 citations · 0 references

Full text

Open access

Concepts

Abstract

This paper introduces Multiple Ant Colony Systems, an optimization al-gorithm based on the Ant Colony System. The performance of this new algorithm is compared with the performance of a Greedy Algorithm and Simulated Annealing on a new optimization problem called the Busstop Al-location Problem (BAP). In the BAP, the goal is to construct a set of buslines (sequences of busstops) so that the average travel time of all passengers is minimized. Results show that the new algorithm outperforms the Greedy Algorithm and Simulated Annealing, which indeed makes it a promising acquisition to the range of existing Ant Algorithms. 1