Combinatorial online optimization
The paper discusses theoretical and practical issues related to combinatorial online optimization problems. Based on three logistics applications, namely the online control of elevator systems in a distribution center, the routing of commissioning vehicles and the routing of stacker cranes in an automatic storage system, it is demonstrated that the available theoretical concepts like competetive analysis have severe weaknesses when used to analyze different online algorithms for the solution of these problems. Alternatively, simulation analysis is used to evaluate and compare various algorithms, and computational results are presented both for random and real-world data. For the entire collection see [Zbl 0937.00057].
- On the on-line maintenance scheduling problem
- Online storage systems and transportation problems with applications. Optimization models and mathematical solutions.
- Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models
- scientific article; zbMATH DE number 1670658 (Why is no real title available?)
- Implementing Real-Time Optimization Models: A Case Application From The Motor Carrier Industry
- scientific article; zbMATH DE number 7014216 (Why is no real title available?)
- scientific article; zbMATH DE number 7525448 (Why is no real title available?)
- Algorithms – ESA 2004
- Euler is standing in line dial-a-ride problems with precedence-constraints
- Demanded scale for modern numerical optimisation
- Online TSP with known locations
- Bincoloring
This page was built for publication: Combinatorial online optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4494399)
