A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements

A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements

0.00 Avg rating0 Votes
Article ID: iaor20042486
Country: Netherlands
Volume: 122
Issue: 1
Start Page Number: 193
End Page Number: 217
Publication Date: Sep 2003
Journal: Annals of Operations Research
Authors: , ,
Keywords: tabu search
Abstract:

In this paper, a tabu search heuristic is combined with slope scaling to solve a discrete depot location problem, known as the multicommodity location problem with balancing requirements. Although the uncapacitated version of this problem has already been addressed in the literature, this is not the case for the more challenging capacitated version, where each depot has a fixed and finite capacity. The slope scaling approach is used during the initialization phase to provide the tabu search with good starting solutions. Numerical results are reported on various types of large-scale randomly generated instances. The quality of the heuristic is assessed by comparing the solutions obtained with those of a commercial mixed-integer programming code.

Reviews

Required fields are marked *. Your email address will not be published.