Abstract
We address a location-allocation problem that requires deciding the location of a set of facilities, the allocation of customers to those facilities under facility capacity constraints, and the allocation of the customers to trucks at those facilities under per truck travel-distance constraints. We present a hybrid approach that combines integer programming and constraint programming using logic-based Benders’ decomposition. Computational performance against an existing integer programming model and a tabu search approach demonstrates that the Benders’ model is able to find and prove optimal solutions an order of magnitude faster than an integer programming model while also finding better feasible solutions in less time for the majority of problem instances when compared to the tabu search.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Drezner, Z.: Facility Location. A Survey of Applications and Methods. Springer Series in Operations Research. Springer, New York (1995)
Albareda-Sambola, M., Fernández, E., Laporte, G.: The capacity and distance constrained plant location problem. Computers & Operation Research 36(2), 597–611 (2009)
Hooker, J.N., Ottosson, G.: Logic-based benders decomposition. Mathematical Programming 96 (2003)
Hooker, J.N.: A hybrid method for planning and scheduling. Constraints 10, 385–401 (2005)
Shaw, P.: A constraint for bin packing. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 648–662. Springer, Heidelberg (2004)
Barceló, J., Fernández, E., Jornsten, K.: Computational results from a new lagrangean relaxation algorithm for the capacitated plant locating problem. European Journal of Operational Research 53, 38–45 (1991)
Laporte, G.: Location-routing problems. In: Golden, B.L., Assad, A.A. (eds.) Vehicle routing: methods and studies, pp. 163–197. North-Holland, Amsterdam (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fazel-Zarandi, M.M., Beck, J.C. (2009). Solving a Location-Allocation Problem with Logic-Based Benders’ Decomposition. In: Gent, I.P. (eds) Principles and Practice of Constraint Programming - CP 2009. CP 2009. Lecture Notes in Computer Science, vol 5732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04244-7_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-04244-7_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04243-0
Online ISBN: 978-3-642-04244-7
eBook Packages: Computer ScienceComputer Science (R0)