Authors: Giovanni Righini, Luca Zaniboni
Addresses: Dipartimento di Tecnologie dell'Informazione, Universita degli Studi di Milano, Via Bramante 65, 26013 Crema, Italy. ' Dipartimento di Tecnologie dell'Informazione, Universita degli Studi di Milano, Via Bramante 65, 26013 Crema, Italy
Abstract: We present a branch-and-price algorithm for the exact solution of the multi-source Weber problem, a classical NP-hard optimisation problem in location science with binary variables and non-linear objective. The algorithm is based on a set covering reformulation whose linear relaxation is solved via column generation at every node of a search tree. The pricing subproblem is equivalent to a single-source Weber problem with limited distances. The algorithm solved to optimality several previously unsolved instances with some thousands of points and some hundreds of sources. Computational experiments show that the algorithm is particularly effective at solving instances in which the ratio between the number of sources and the number of points is high.
Keywords: location theory; multi-source Weber problem; column generation; branch-and-bound algorithms; set covering reformulation; linear relaxation; operational research.
International Journal of Operational Research, 2007 Vol.2 No.2, pp.188 - 207
Published online: 14 Feb 2007 *Full-text access for editors Access for subscribers Purchase this article Comment on this article