Skip to main content

A Perturbation-Based Heuristic for the Capacitated Multi-Source Weber Problem

Zainuddin, Zaitul Marlizawati, Salhi, Said (2007) A Perturbation-Based Heuristic for the Capacitated Multi-Source Weber Problem. European Journal of Operational Research, 179 (3). pp. 1194-1207. ISSN 0377-2217. (doi:10.1016/j.ejor.2005.09.050) (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:5281)

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. (Contact us about this Publication)
Official URL
http://dx.doi.org/10.1016/j.ejor.2005.09.050

Abstract

This paper proposes a perturbation-based heuristic for the capacitated multisource Weber problem. This procedure is based on an effective use of borderline customers. Several implementations are considered and the two most appropriate are then computationally enhanced by using a reduced neighbourhood when solving the transportation problem. Computational results are presented using data sets from the literature, originally used for the uncapacitated case, with encouraging results.

Item Type: Article
DOI/Identification number: 10.1016/j.ejor.2005.09.050
Uncontrolled keywords: capacitated; location-allocation; continuous space; heuristics
Subjects: H Social Sciences
Divisions: Faculties > Social Sciences > Kent Business School > Management Science
Faculties > Social Sciences > Kent Business School > Centre for Logistics and Heuristic Organisation (CLHO)
Depositing User: Said Salhi
Date Deposited: 24 Jul 2008 15:05 UTC
Last Modified: 08 Feb 2020 04:00 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/5281 (The current URI for this page, for reference purposes)
Salhi, Said: https://orcid.org/0000-0002-3384-5240
  • Depositors only (login required):