Abstract
We consider reoptimization (i.e., the solution of a problem based on information available from solving a similar problem) for branch-and-bound algorithms and propose a generic framework to construct a reoptimizing branch-and-bound algorithm. We apply this to an elevator scheduling algorithm solving similar subproblems to generate columns using branch-and-bound. Our results indicate that reoptimization techniques can substantially reduce the running times of the overall algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ausiello, G., Bonifaci, V., Escoffier, B.: Complexity and Approximation in Reoptimization. In: Computability in Context: Computation and Logic in the Real World. Imperial College Press/World Scientific (2011)
Desrochers, M., Soumis, F.: A reoptimization algorithm for the shortest path problem with time windows. European J. Oper. Res. 35, 242–254 (1988)
DIP – Decomposition for Integer Programming, https://projects.coin-or.org/Dip
Friese, P., Rambau, J.: Online-optimization of a multi-elevator transport system with reoptimization algorithms based on set-partitioning models. Discrete Appl. Math. 154(13), 1908–1931 (2006)
Galati, M.: Decomposition in Integer Linear Programming. PhD thesis, Lehigh University (2009)
Gamrath, G.: Generic branch-cut-and-price. Diploma thesis, TU Berlin (2010)
Gamrath, G., Lübbecke, M.E.: Experiments with a generic Dantzig-Wolfe decomposition for integer programs. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 239–252. Springer, Heidelberg (2010)
GCG – Generic Column Generation, http://www.or.rwth-aachen.de/gcg/
Hiller, B.: Online Optimization: Probabilistic Analysis and Algorithm Engineering. PhD thesis, TU Berlin (2009)
Hiller, B., Klug, T., Tuchscherer, A.: An exact reoptimization algorithm for the scheduling of elevator groups. Flexible Services and Manufacturing Journal (to appear)
Krumke, S.O., Rambau, J., Torres, L.M.: Real-time dispatching of guided and unguided automobile service units with soft time windows. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 637–648. Springer, Heidelberg (2002)
Létocart, L., Nagih, A., Plateau, G.: Reoptimization in Lagrangian methods for the quadratic knapsack problem. Comput. Oper. Res. 39(1), 12–18 (2012)
Miller-Hooks, E., Yang, B.: Updating paths in time-varying networks with arc weight changes. Transportation Sci. 39(4), 451–464 (2005)
Witzig, J.: Effiziente Reoptimierung in Branch&Bound-Verfahren für die Steuerung von Aufzügen. Bachelor thesis, TU Berlin (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hiller, B., Klug, T., Witzig, J. (2013). Reoptimization in Branch-and-Bound Algorithms with an Application to Elevator Control. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds) Experimental Algorithms. SEA 2013. Lecture Notes in Computer Science, vol 7933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38527-8_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-38527-8_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38526-1
Online ISBN: 978-3-642-38527-8
eBook Packages: Computer ScienceComputer Science (R0)