A perturbation-based heuristic for the capacitated multisource weber problem
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 neighbourhoo...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier B.V.
2007
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/8780/ http://eprints.utm.my/8780/1/ZMZainuddin2007_Aperturbationbasedheuristicforthecapacitatedmultisource.pdf |
| _version_ | 1848891765979873280 |
|---|---|
| author | Zainuddin, Zaitul Marlizawati Salhi, S. |
| author_facet | Zainuddin, Zaitul Marlizawati Salhi, S. |
| author_sort | Zainuddin, Zaitul Marlizawati |
| building | UTeM Institutional Repository |
| collection | Online Access |
| description | 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 |
| first_indexed | 2025-11-15T21:03:10Z |
| format | Article |
| id | utm-8780 |
| institution | Universiti Teknologi Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T21:03:10Z |
| publishDate | 2007 |
| publisher | Elsevier B.V. |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | utm-87802017-03-14T08:24:16Z http://eprints.utm.my/8780/ A perturbation-based heuristic for the capacitated multisource weber problem Zainuddin, Zaitul Marlizawati Salhi, S. QA Mathematics 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 Elsevier B.V. 2007-06 Article PeerReviewed application/pdf en http://eprints.utm.my/8780/1/ZMZainuddin2007_Aperturbationbasedheuristicforthecapacitatedmultisource.pdf Zainuddin, Zaitul Marlizawati and Salhi, S. (2007) A perturbation-based heuristic for the capacitated multisource weber problem. European Journal of Operational Research, 179 (3). pp. 1194-1207. ISSN 0377-2217 http://dx.doi.org/10.1016/j.ejor.2005.09.050 10.1016/j.ejor.2005.09.050 |
| spellingShingle | QA Mathematics Zainuddin, Zaitul Marlizawati Salhi, S. A perturbation-based heuristic for the capacitated multisource weber problem |
| title | A perturbation-based heuristic for the capacitated multisource weber problem |
| title_full | A perturbation-based heuristic for the capacitated multisource weber problem |
| title_fullStr | A perturbation-based heuristic for the capacitated multisource weber problem |
| title_full_unstemmed | A perturbation-based heuristic for the capacitated multisource weber problem |
| title_short | A perturbation-based heuristic for the capacitated multisource weber problem |
| title_sort | perturbation-based heuristic for the capacitated multisource weber problem |
| topic | QA Mathematics |
| url | http://eprints.utm.my/8780/ http://eprints.utm.my/8780/ http://eprints.utm.my/8780/ http://eprints.utm.my/8780/1/ZMZainuddin2007_Aperturbationbasedheuristicforthecapacitatedmultisource.pdf |