Constructive heuristics for the uncapacitated continuous location-allocation problem

Abstract

The multisource location-allocation problem in continuous space is investigated. Two constructive heuristic techniques are proposed to solve this problem. Both methods are based on designing suitable schemes for the generation of the initial solutions. The first considers the furthest distance rule and is enhanced by schemes borrowed from tabu search such as constructing the forbidden regions and freeing strategy. The second considers the discrete solutions found when solving the p-median problem. Some results on existing test problems are presented.

Keywords:

• heuristics
• location
• continuous space