Gamal, M.D.H., Salhi, Said (2001) Constructive Heuristics for the Uncapacitated Continuous Location-allocation Problem. Journal of the Operational Research Society, 52 (7). pp. 821-829. ISSN 0160-5682. (doi:10.1057/palgrave.jors.2601176) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:5233)
The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. | |
Official URL: https://doi.org/10.1057/palgrave.jors.2601176 |
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.
Item Type: | Article |
---|---|
DOI/Identification number: | 10.1057/palgrave.jors.2601176 |
Uncontrolled keywords: | heuristics; location; continuous space |
Subjects: | H Social Sciences |
Divisions: | Divisions > Kent Business School - Division > Department of Analytics, Operations and Systems |
Depositing User: | Said Salhi |
Date Deposited: | 31 Aug 2008 18:19 UTC |
Last Modified: | 05 Nov 2024 09:37 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/5233 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):