mlsanityData to 7 Oct 2026

A Neural-Evolutionary Algorithm for Autonomous Transit Network Design

arXiv 2403.07917 ↗First posted 27 Feb 2024cs.NE cs.LGcited by 1

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

  1. 2017Attention Is All You Needcited by 59,932
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  3. 2017Neural Message Passing for Quantum Chemistrycited by 3,460
  4. 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
  5. 2018Relational inductive biases, deep learning, and graph networkscited by 1,341
  6. 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,133
  7. 2013Spectral Networks and Locally Connected Networks on Graphscited by 1,097
  8. 2015Pointer Networkscited by 882
  9. 2021How Attentive are Graph Attention Networks?cited by 818
  10. 2015Convolutional Networks on Graphs for Learning Molecular Fingerprintscited by 751
  11. 2018Attention, Learn to Solve Routing Problems!cited by 646
  12. 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 612
13 more
  1. 2017Learning Combinatorial Optimization Algorithms over Graphscited by 557
  2. 2018Learning to Perform Local Rewriting for Combinatorial Optimizationcited by 183
  3. 2019Learning Improvement Heuristics for Solving Routing Problemscited by 162
  4. 2020Generalize a Small Pre-trained Model to Arbitrarily Large TSP Instancescited by 161
  5. 2019Neural Large Neighborhood Search for the Capacitated Vehicle Routing Problemcited by 117
  6. 2021Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformercited by 108
  7. 2020Learning 2-opt Heuristics for the Traveling Salesman Problem via Deep Reinforcement Learningcited by 100
  8. 2021Symbolic Regression via Neural-Guided Genetic Programming Population Seedingcited by 97
  9. 2021Learning Collaborative Policies to Solve NP-hard Routing Problemscited by 86
  10. 2022Simulation-guided Beam Search for Neural Combinatorial Optimizationcited by 84
  11. 2020Multi-Agent Routing Value Iteration Networkcited by 17
  12. 2017A History of Metaheuristicscited by 6
  13. 2021Deep Reinforcement Learning based Dynamic Optimization of Bus Timetablecited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.