A cellular heuristic for the multisource Weber problem.

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

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: 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
DOI/Identification number:	10.1016/S0305-0548(02)00095-3
Uncontrolled keywords:	heuristic; location; continuous space; discrete approximation
Subjects:	H Social Sciences
Institutional Unit:	Schools > Kent Business School
Former Institutional Unit:	Divisions > Kent Business School - Division > Department of Analytics, Operations and Systems
Depositing User:	Said Salhi
Date Deposited:	05 Sep 2008 17:19 UTC
Last Modified:	20 May 2025 11:59 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/5235 (The current URI for this page, for reference purposes)

University of Kent Author Information

Salhi, Said.

Creator's ORCID:	https://orcid.org/0000-0002-3384-5240
CReDIT Contributor Roles:

Depositors only (login required):

Altmetric

Total Views

Total unique views of this page since July 2020. For more details click on the image.