A Descent-Ascent Technique for Solving the Multi-Source Weber Problem
Yugoslav journal of operations research, Tome 5 (1995) no. 2, p. 211
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
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 local minimum is reached. In this paper . we consider
the original heuristic proposed by Cooper (1963, 1964 , 1972), witch has no inherent
neighborhood structure. We show how a neighborhood structure can be defined and
a descent-ascent procedure employed to enhance the Cooper algorithm.
Computational results are reported.
Keywords:
@article{YJOR_1995_5_2_a3,
author = {Nenad Mladenovi\'c and Jack Brimberg},
title = {A {Descent-Ascent} {Technique} for {Solving} the {Multi-Source} {Weber} {Problem}},
journal = {Yugoslav journal of operations research},
pages = {211 },
year = {1995},
volume = {5},
number = {2},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_1995_5_2_a3/}
}
Nenad Mladenović; Jack Brimberg. A Descent-Ascent Technique for Solving the Multi-Source Weber Problem. Yugoslav journal of operations research, Tome 5 (1995) no. 2, p. 211 . http://geodesic.mathdoc.fr/item/YJOR_1995_5_2_a3/