A cellular heuristic for the multisource Weber problem.

Gamal, M.D.H. and Salhi, Said (2003) A cellular heuristic for the multisource Weber problem. Computers and Operations Research, 30 (11). pp. 1609-1624. ISSN 0305-0548. (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)
Official URL
http://dx.doi.org/10.1016/S0305-0548(02)00095-3

Abstract

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.

Item Type: Article
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: 23 Apr 2014 10:17
Resource URI: http://kar.kent.ac.uk/id/eprint/5235 (The current URI for this page, for reference purposes)
  • Depositors only (login required):