Online design of dynamic networks
Not on the map. Why?
Abstract (arXiv)
Designing a network (e.g., a telecommunication or transport network) is mainly done offline, in a planning phase, prior to the operation of the network. On the other hand, a massive effort has been devoted to characterizing dynamic networks, i.e., those that evolve over time. The novelty of this paper is that we introduce a method for the online design of dynamic networks. The need to do so emerges when a network needs to operate in a dynamic and stochastic environment. In this case, one may wish to build a network over time, on the fly, in order to react to the changes of the environment and to keep certain performance targets. We tackle this online design problem with a rolling horizon optimization based on Monte Carlo Tree Search. The potential of online network design is showcased for the design of a futuristic dynamic public transport network, where bus lines are constructed on the fly to better adapt to a stochastic user demand. In such a scenario, we compare our results with state-of-the-art dynamic vehicle routing problem (VRP) resolution methods, simulating requests from a New York City taxi dataset. Differently from classic VRP methods, that extend vehicle trajectories in isolation, our method enables us to build a structured network of line buses, where complex user journeys are possible, thus increasing system performance.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 11 of its 56 references that are in the map. First posted on arXiv 11 Oct 2024.
Builds on
11 of 56 references.
References · 11
- 2017Spatio-Temporal Graph Convolutional Networks: A Deep Learning Framework for Traffic Forecastingcited by 1,136
- 2018Deep Learning on Graphs: A Surveycited by 393
- 2021Graph Neural Network for Traffic Forecasting: A Surveycited by 261
- 2021Graph Learning: A Surveycited by 141
- 2022Hindsight Learning for MDPs with Exogenous Inputscited by 26
- 2019Combining Q-Learning and Search with Amortized Value Estimatescited by 19
- 2014Online Distributed Optimization on Dynamic Networkscited by 15
- 2021An Efficient Procedure for Mining Egocentric Temporal Motifscited by 7
- 2022Generating Synthetic Mobility Networks with Generative Adversarial Networkscited by 5
- 2021The pickup and delivery problem with synchronized en-route transfers for microtransit planningcited by 2
- 2024How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphscited by 1
Built on by
Not cited yet.