A variable neighbourhood algorithm for solving the continuous location–allocation problem

Local descent methods typically employ a single neighbourhood structure to conduct the search around a candidate solution. In this paper, we propose a methodology which uses a structured set of pre-defined neighbourhoods to systematically induce a larger search radius over the solution space. This approach is termed the variable neighbourhood algorithm. Initial testing on the continuous location–allocation problem demonstrates the potential of this method for solving large problem sizes.