Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
483182 | European Journal of Operational Research | 2007 | 14 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Z.M. Zainuddin, S. Salhi,