Abstract
This paper presents a hybrid tabu search strategy for lot sizing problems. This strategy allows the exploitation of the quality of the well-known relax-and-fix heuristic, inside a tabu search framework which enforces diversity.
The computational results show an advantage of this strategy when compared to a version of the relax-and-fix heuristic and to time constrained branch-and-bound.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Belvaux, G., Wolsey, L.A.: Modelling issues and a specialized branch-and-cut system bc-prod. In: Discussion Paper 9849, Center for Operations Research and Econometrics. Université Catholique de Louvain, Louvain-la-Neuve, Belgium (1998)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)
Kuik, R., Salomon, M.: Batching decisions: Structure and models. European Journal and Operational Research 75, 243–260 (1994)
Makhorin, A.: GLPK – GNU Linear Programming Kit. Free Software Foundation (2005), http://www.gnu.org (Version 4.8)
Pedroso, J.P.: Hybrid tabu search for lot sizing problems: an implementation in the Python programming language. Internet repository, version 0.1 (2005), http://www.ncc.up.pt/~jpp/lsize
Pochet, Y., Wolsey, L.A.: Algorithms and reformulations for lot sizing problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 20, pp. 245–293 (1995)
van Rossum, G., et al.: Python Documentation. PythonLabs (2005), http://www.python.org (Release 2.3.5)
Van Vyve, M., Pochet, Y.: General heuristics for production planning problems. INFORMS Journal on Computing 16, 316–332 (2004)
Wolsey, L.: Integer Programming. John Wiley & Sons, Chichester (1998)
Wolsey, L.A.: LOTSIZELIB. Internet repository, version 3.0 (1996), http://www.core.ucl.ac.be/wolsey/lotsizel.htm
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pedroso, J.P., Kubo, M. (2005). Hybrid Tabu Search for Lot Sizing Problems. In: Blesa, M.J., Blum, C., Roli, A., Sampels, M. (eds) Hybrid Metaheuristics. HM 2005. Lecture Notes in Computer Science, vol 3636. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11546245_7
Download citation
DOI: https://doi.org/10.1007/11546245_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28535-9
Online ISBN: 978-3-540-31898-9
eBook Packages: Computer ScienceComputer Science (R0)