Lune

Abstract

Many optimisation problems are of an online nature, where new information arrives and the problem must be resolved periodically in order to (a) improve previous decisions and (b) take the required new ones. Typically, building an online optimisation system requires substantial ad hoc coding, where the optimisation problem is continually adjusted and resolved, keeping track of which previous decisions may be committed and which new decisions need to be taken. In this paper we define a framework for automatically solving online decision problems. This is achieved by extending a model of the offline optimisation problem so that the online version is automatically constructed from this model, requiring no further implementation. In doing so, we formalise many of the aspects that arise in online optimisation problems. The same framework can be applied for automatically creating sliding window solving approaches for problems that extend over a large time domain. Experiments show that we can automatically create efficient online and sliding window solutions to problems.

Ask Lune

Know this paper in minutes, not an afternoon.

Lune can read every page of it and the top-tier papers that cite it, and gives you its claims, its evidence and its limits, each one cited to the paper it comes from. No skimming, no AI slop.

Questions to start from

Lune can draw on

the full paper · related work

Get the answer

Free to start. No credit card required.

Related papers

  1. The Primal-Dual method for Learning Augmented AlgorithmsÉtienne Bamas, Andreas Maggiori, Ola SvenssonNeurIPS 2020 · 171 citations
  2. Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based SketchesAlessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin ZhongSODA 2022 · 6 citations
  3. The Choice Function Framework for Online Policy ImprovementMurugeswari Issakkimuthu, Alan Fern, Prasad TadepalliAAAI 2020 · 1 citation
  4. Online Convex Optimisation: The Optimal Switching Regret for all Segmentations SimultaneouslyStephen Pasteris, Chris Hicks, Vasilios Mavroudis, Mark HerbsterNeurIPS 2024 · 4 citations
  5. Rolling Horizon Based Temporal Decomposition for the Offline Pickup and Delivery Problem with Time WindowsYoungseo Kim, Danushka Edirimanna, Michael Wilbur, Philip Pugliese et al.AAAI 2023 · 11 citations
Dusk over the sea between two cliffs drawn in fine vertical lines