A Neural-Evolutionary Algorithm for Autonomous Transit Network Design
Not on the map. Why?
Abstract (arXiv)
Planning a public transit network is a challenging optimization problem, but essential in order to realize the benefits of autonomous buses. We propose a novel algorithm for planning networks of routes for autonomous buses. We first train a graph neural net model as a policy for constructing route networks, and then use the policy as one of several mutation operators in a evolutionary algorithm. We evaluate this algorithm on a standard set of benchmarks for transit network design, and find that it outperforms the learned policy alone by up to 20% and a plain evolutionary algorithm approach by up to 53% on realistic benchmark instances.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 25 of its 71 references that are in the map. First posted on arXiv 27 Feb 2024.
Builds on
25 of 71 references.
References · 25
- 2017Attention Is All You Needcited by 59,932
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Neural Message Passing for Quantum Chemistrycited by 3,460
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
- 2018Relational inductive biases, deep learning, and graph networkscited by 1,341
- 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,133
- 2013Spectral Networks and Locally Connected Networks on Graphscited by 1,097
- 2015Pointer Networkscited by 882
- 2021How Attentive are Graph Attention Networks?cited by 818
- 2015Convolutional Networks on Graphs for Learning Molecular Fingerprintscited by 751
- 2018Attention, Learn to Solve Routing Problems!cited by 646
- 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 612
13 more
- 2017Learning Combinatorial Optimization Algorithms over Graphscited by 557
- 2018Learning to Perform Local Rewriting for Combinatorial Optimizationcited by 183
- 2019Learning Improvement Heuristics for Solving Routing Problemscited by 162
- 2020Generalize a Small Pre-trained Model to Arbitrarily Large TSP Instancescited by 161
- 2019Neural Large Neighborhood Search for the Capacitated Vehicle Routing Problemcited by 117
- 2021Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformercited by 108
- 2020Learning 2-opt Heuristics for the Traveling Salesman Problem via Deep Reinforcement Learningcited by 100
- 2021Symbolic Regression via Neural-Guided Genetic Programming Population Seedingcited by 97
- 2021Learning Collaborative Policies to Solve NP-hard Routing Problemscited by 86
- 2022Simulation-guided Beam Search for Neural Combinatorial Optimizationcited by 84
- 2020Multi-Agent Routing Value Iteration Networkcited by 17
- 2017A History of Metaheuristicscited by 6
- 2021Deep Reinforcement Learning based Dynamic Optimization of Bus Timetablecited by 4
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026AlphaTransit: Learning to Design City-scale Transit Routes27 May 2026