Salhi, S. and Gamal, M.D.H. (2003) A cellular heuristic for the multisource Weber problem. Computers & Operations Research, 30 (11). pp. 1609-1624. ISSN 0305-0548 .
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
The multisource location-allocation problem in the continuous space is investigated. A learning scheme which uses previous solutions to discretise the continuous space into well-defined cells is proposed. This cells-based technique takes into account frequency of occurrence of already found configurations as well as the compatibility of these configurations. Some results on existing test problems are presented.
|Uncontrolled keywords:||heuristic; location; continuous space; discrete approximation|
|Subjects:||H Social Sciences|
|Divisions:||Faculties > Social Sciences > Kent Business School > Management Science|
|Depositing User:||Said Salhi|
|Date Deposited:||05 Sep 2008 17:19|
|Last Modified:||14 Jan 2010 14:20|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/5235 (The current URI for this page, for reference purposes)|
- Depositors only (login required):