Several heuristic methods have been developed to solve the location-allocation problem in continuous space. Typically, these algorithms attempt to move in descent directions by examining the neighbouring structure obtained from one or more exchanges in the set of allocations. In this paper we show that these algorithms are readily augmented by a Tabu Search. Computational results are given for the H3 heuristic (see Love, Morris and Wesolowsky, (1988, Chapter 7)).
Published September 1994 , 13 pages
This cahier was revised in August 1995