|Title:||Descent-ascent technique for solving the multi-source Weber problem||Journal:||Yugoslav Journal of Operations Research||Volume:||5||Issue:||2||First page:||211||Last page:||219||Issue Date:||1-Dec-1995||ISSN:||0354-0243||Abstract:||
The multi-source Weber problem requires locating m new facilities in continuous space in order to minimize a sum of transportation costs to n fixed points or customers with known demands. Several heuristic methods have been developed to solve this problem. Typically, these algorithms move in descent directions from a specified starting solution until a local minimum is reached. In this paper, we consider the original heuristic proposed by Cooper (1963, 1964, 1972), which has no inherent neighbourhood structure. We show how a neighbourhood structure can be defined and a descent-ascent procedure employed to enhance the Cooper algorithm Computational results are reported.
|Publisher:||Faculty of Organizational Sciences, University of Belgrade|
Show full item record
checked on Sep 16, 2022
checked on Sep 28, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.