Constructive Heuristics for the Uncapacitated Continuous Location-allocation Problem

Gamal, M.D.H. and Salhi, S. (2001) Constructive Heuristics for the Uncapacitated Continuous Location-allocation Problem. Journal of the Operational Research Society, 52 (7). pp. 821-829. ISSN 0160-5682 . (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)

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
Uncontrolled keywords: heuristics; location; continuous space
Subjects: H Social Sciences
Divisions: Faculties > Social Sciences > Kent Business School > Management Science
Depositing User: Said Salhi
Date Deposited: 31 Aug 2008 18:19
Last Modified: 06 Feb 2014 16:28
Resource URI: http://kar.kent.ac.uk/id/eprint/5233 (The current URI for this page, for reference purposes)
  • Depositors only (login required):