A simple tabu search for warehouse location

Abstract

The uncapacitated warehouse location problem (UWLP) is a heavily studied combinatorial optimization problem, which has been tackled by various approaches, such as linear-programming branch and bound, genetic algorithms, and local search. This paper presents an simple, yet robust and efficient, tabu search algorithm for the UWLP. The algorithm was evaluated… (More)
DOI: 10.1016/S0377-2217(03)00247-9

Topics

13 Figures and Tables

Cite this paper

@article{Michel2004AST, title={A simple tabu search for warehouse location}, author={Laurent D. Michel and Pascal Van Hentenryck}, journal={European Journal of Operational Research}, year={2004}, volume={157}, pages={576-591} }