Locating a transit line using tabu search

This article addresses the problem of locating a metro or rapid transit line. An alignment comprising n stations must be located in a territory, subject to minimum and maximum station interspacings. The objective is to maximize the total population covered by the alignment. A tabu search heuristic is developed and computational tests on randomly generated instances are presented. Sensitivity analyses are performed on a number of paramters used in the algorithm.