Summary
In “classical” optimization, all data of a problem instance are considered given. The standard theory and the usual algorithmic techniques apply to such cases only. Online optimization is different. Many decisions have to be made before all data are available. In addition, decisions once made cannot be changed. How should one act “best” in such an environment?
In this paper we survey online problems coming up in combinatorial optimization. We first outline theoretical concepts, such as competitiveness against various adversaries, to analyze online problems and algorithms. The focus, however, lies on real-world applications. We report, in particular, on theoretical investigations and our practical experience with problems arising in transportation and the automatic handling of material.
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.
References
S. Albers. Competitive online algorithms. BRICS Lecture Series LS-96-2, 1996.
S. Albers. Competitive online algorithms. OPTIMA, 54:2–8, June 1997.
T. Altiok. Performance Analysis of Manufacturing Systems. Springer Series in Operations Research. Springer, 1996.
AMSEL-A Modeling and Simulation Environment Library, 1997. Developed at the Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB). See http://www.zib.de/ascheuer/AMSEL.
N. Ascheuer. Hamiltonian Path Problems in the On-line Optimization of Flexible ManufacturingSystems. PhD thesis, Tech. Univ. Berlin, 1995.Avail, at URL {rfhttp://www.zib.de/ZIBbib/Publications URL}.
N. Ascheuer, M. Fischetti, and M. Grötschel. A polyhedral study of the asymmetric travellingsalesman problem with time windows. Preprint SC 97–11, Konrad-Zuse-Zentrum Berlin, 1997.Avail, at URL {rfhttp: //www. zib. de/ZIBbib/Publications URL}.
N. Ascheuer, M. Fischetti, and M. Grötschel. Solving ATSP with time windows by branch-and-cut. Technical report, ZIB Berlin, 1998. (In preparation).
N. Ascheuer, M. Grötschel, N. Kamin, and J. Rambau. Combinatorial online optimization in practice. OPTIMA, 57:1–6, March 1998.
N. Ascheuer, M. Jünger, and G. Reinelt. A branch & cut algorithm for theasymmetric Hamiltonian path problem with precedence constraints. Technical Report SC 97-70, ZIB Berlin, 1997. Avail, at URL {rfhttp://www.zib.de/ZIBbib/Publications}.
N. Ascheuer, S.O. Krumke, and J. Rambau. Competitive scheduling of elevators. Technical report, ZIB Berlin, 1998. (Paper in preparation).
G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, and M. Talamo. Serving requests with on-line routing. In Proceedings of the 4th Scandinavian Workshop on Algorithm Theory, 1994.
G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, and M. Talamo. Competitive algorithms for the on-line traveling salesman. In Workshop on Algorithms and Data Structures, 1995.
A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
E. Feuerstein and L. Stougie. On-line single server dial-a-ride problems. (In preparation), 1998.
A. Fiat and G.J. Woeginger. Online algorithms — The state of the art. Lecture Note in Computer Science. Springer, 1998.
M. Fischetti and P. Toth. An additive bounding procedure for the asymmetric TSP. Mathematical Programming, 53:173–197, 1992.
G. Galambos and G.J. Woeginger. Repacking helps in bounded space on-line bin-packing. Computing, 49:329–338, 1993.
G. Galambos and G.J. Woeginger. On-line bin-packing — a restricted survey. ZOR— Mathematical Methods of Operations Research, 42:25–45, 1995.
D.J. Guan. Routing a vehicle of capacity greater than one. Discrete Applied Mathematics, 81(l):41–57, January 1998.
D.J. Guan and X. Zhu. Multiple capacity vehicle routing on paths. Technical Report, Department of Applied Mathematics, National Sun Yat-Sen University, Kaoshiung, Taiwan, March 1997.
Herlitz PBS AG. Information available via WWW at URL http://www.herlitz.de.
S. Irani and A.R. Karlin. Online computation. In D.S. Hochbaum, editor, Approximation algorithms for NP-hard problems, chapter 13, pages 521–564 PWS Publishing Company, 1997.
N. Kamin. On-Line Optimization of Order Picking in an Automated Warehouse. PhD thesis, Technische Universitat Berlin, 1998.
C.C. Lee and D.T. Lee. A simple on-line bin-packing algorithm. J. Assoc. Comput. Mach., 32:562–572, 1985.
M.B. Richey. Improved bounds for harmonic based bin packing algorithms. Discrete AppliedMathematics, 34:203–227, 1991.
A. van Vliet. On the asymptotic worst case behavior of harmonic fit. Journal of Algorithms, 20:113–136, 1996.
T. Winter and U. Zimmermann. Discrete online and real-time optimization. In Proceedings ofthe 15th IFIP World Computer Congress, Budapest/Vienna, Augusts31-September 4, 1998. (To appear).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ascheuer, N., Grötschel, M., Krumke, S.O., Rambau, J. (1999). Combinatorial Online Optimization. In: Kall, P., Lüthi, HJ. (eds) Operations Research Proceedings 1998. Operations Research Proceedings 1998, vol 1998. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58409-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-58409-1_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65381-3
Online ISBN: 978-3-642-58409-1
eBook Packages: Springer Book Archive