The principles of simulated annealing and genetic algorithms are described in a general way. Both methods are applied to the optimization of the public transport system of a schematic but realistic city. The problem consists of choosing a limited number of routes from about twenty possible routes, such that an economic goal function is optimized. The results of these new algorithms are compared to the results obtained by a more conventional (greedy) algorithm. (A)
Abstract