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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Crainic, T.G., P.J. Dejax, and L. Delorme. (1989). “Models for Multimode Multicommodity Location Problems with Interdepot Balancing Requirements.” Annals of Operations Research 18, 279–302.
Crainic, T.G. and L. Delorme. (1993). “Dual-Ascent Procedures for Multicommodity Location–Allocation Problems with Balancing Requirements.” Transportation Science 27, 90–101.
Crainic, T.G., L. Delorme, and P.J. Dejax. (1993). “A Branch-and-Bound Method for Multicommodity Location with Balancing Requirements.” European Journal of Operational Research 65, 368–382.
Crainic, T.G., M. Gendreau, and P. Soriano. (1993). “A Tabu Search Procedure for Multicommodity Location/ Allocation with Balancing Requirements.” Annals of Operations Research 41, 359–383.
Gendron, B. and T.G. Crainic. (1995). “A Branch-and-Bound Algorithm for Depot Location and Container Fleet Management.” Location Science 3, 39–53.
Gendron, B. and T.G. Crainic. (1997). “A Parallel Branch-and-Bound Algorithm for Multicommodity Location with Balancing Requirements.” Computers & Operations Research 24, 829–847.
Gendron, B., J.-Y. Potvin, and P. Soriano. (1999). “Tabu Search with Exact Neighbor Evaluation for Multicommodity Location with Balancing Requirements.” INFOR 37, 255–270.
Glover, F. and M. Laguna. (1997). Tabu Search. Boston: Kluwer Academic.
ILOG. (1999). ILOG CPLEX 6.6.
Kim, D. and P.M. Pardalos. (1999). “A Solution Approach to the Fixed Charge Network Flow Problem using a Dynamic Slope Scaling Procedure.” Operations Research Letters 24, 195–203.
Kim, D. and P.M. Pardalos. (2000a). “Dynamic Slope Scaling and Trust Interval Interval Techniques for Solving Concave Piecewise-Linear Network Flow Problems.” Networks 35, 216–222.
Kim, D. and P.M. Pardalos. (2000b). “A Dynamic Domain Contraction Algorithm for Nonconvex Piecewise Linear Network Flow Problems.” Journal of Global Optimization 17, 225–234.
Sridharan, R. (1995). “The Capacitated Plant Location Problem.” European Journal of Operational Research 87, 203–213.
Whitley, D. (1989). “The GENITOR Algorithm: Why Rank-Based Allocation of Reproductive Trials Is Best.” In J.D. Schaffer (ed.), Proceedings of the Third International Conference on Genetic Algorithms. San Mateo: Morgan Kaufmann, pp. 116–121.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gendron, B., Potvin, JY. & Soriano, P. A Tabu Search with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements. Annals of Operations Research 122, 193–217 (2003). https://doi.org/10.1023/A:1026102724889
Issue Date:
DOI: https://doi.org/10.1023/A:1026102724889