Constructive heuristics for the uncapacitated continuous location-allocation problem

Moh Gamal, Said Salhi

Research output: Contribution to journalArticle

29 Citations (Scopus)


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.
Original languageEnglish
Pages (from-to)821-829
Number of pages9
JournalOperational Research Society. Journal
Issue number7
Publication statusPublished - 1 Jul 2001


Dive into the research topics of 'Constructive heuristics for the uncapacitated continuous location-allocation problem'. Together they form a unique fingerprint.

Cite this