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. | |
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: | Divisions > Kent Business School - Division > Department of Analytics, Operations and Systems |
Depositing User: | Said Salhi |
Date Deposited: | 24 Jul 2008 15:05 UTC |
Last Modified: | 05 Nov 2024 09:37 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/5281 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):