Anzeige
Erschienen in:
2020 | OriginalPaper | Buchkapitel
7. Dynamic Lookahead Horizons
verfasst von : Jan Brinkmann
Erschienen in: Active Balancing of Bike Sharing Systems
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
As observed by Ghiani et al., Transp Res Part E: Logist Transp Rev 45(1):96–106, 2009, Voccia et al., Transp Sci, 2017, the length of a lookahead horizon has a significant impact on the solution quality when solving a stochastic-dynamic optimization problem. Therefore, the lookahead horizon must neither be too short nor too long. More precisely, the lookahead horizon needs to match the request pattern. In BSSs, we are facing spatio-temporal request patterns (Sect. 2.4). Therefore, in this chapter, we approach lookahead horizons for LAs changing in the course of the day. We define a dynamic LA (DLA) to be an LA with lookahead horizons individually selected for certain periods of the time horizon. To this end, we use a procedure originally introduced by Brinkmann et al., Comput Oper Res 106:260–279, 2019a.