Article ID: | iaor20021075 |
Country: | United Kingdom |
Volume: | 52 |
Issue: | 7 |
Start Page Number: | 821 |
End Page Number: | 829 |
Publication Date: | Jul 2001 |
Journal: | Journal of the Operational Research Society |
Authors: | Salhi S., Gamal M.D.H. |
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