mlsanityData to 7 Oct 2026

A hybrid deep-learning-metaheuristic framework for bi-level network design problems

arXiv 2303.06024 ↗First posted 10 Mar 2023cs.NE cs.GT cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

This study proposes a hybrid deep-learning-metaheuristic framework with a bi-level architecture for road network design problems (NDPs). We train a graph neural network (GNN) to approximate the solution of the user equilibrium (UE) traffic assignment problem and use inferences made by the trained model to calculate fitness function evaluations of a genetic algorithm (GA) to approximate solutions for NDPs. Using three test networks, two NDP variants and an exact solver as benchmark, we show that on average, our proposed framework can provide solutions within 1.5% gap of the best results in less than 0.5% of the time used by the exact solution procedure. Our framework can be utilized within an expert system for infrastructure planning to determine the best infrastructure planning and management decisions under different scenarios. Given the flexibility of the framework, it can easily be adapted to many other decision problems that can be modeled as bi-level problems on graphs. Moreover, we foreseen interesting future research directions, thus we also put forward a brief research agenda for this topic. The key observation from our research that can shape future research is that the fitness function evaluation time using the inferences made by the GNN model was in the order of milliseconds, which points to an opportunity and a need for novel heuristics that 1) can cope well with noisy fitness function values provided by deep learning models, and 2) can use the significantly enlarged efficiency of the evaluation step to explore the search space effectively (rather than efficiently). This opens a new avenue for a modern class of metaheuristics that are crafted for use with AI-powered predictors.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 19 of its 41 references that are in the map. First posted on arXiv 10 Mar 2023.

Builds on

19 of 41 references.

References · 19

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2017Inductive Representation Learning on Large Graphscited by 6,284
  3. 2018How Powerful are Graph Neural Networks?cited by 4,355
  4. 2017Neural Message Passing for Quantum Chemistrycited by 3,460
  5. 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 875
  6. 2018Attention, Learn to Solve Routing Problems!cited by 646
  7. 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 612
  8. 2016Neural Combinatorial Optimization with Reinforcement Learningcited by 600
  9. 2017Learning Combinatorial Optimization Algorithms over Graphscited by 557
  10. 2018Deep Learning on Graphs: A Surveycited by 393
  11. 2018Reinforcement Learning for Solving the Vehicle Routing Problemcited by 327
  12. 2019Exact Combinatorial Optimization with Graph Convolutional Neural Networkscited by 313
7 more
  1. 2021Combinatorial optimization and reasoning with graph neural networkscited by 267
  2. 2020Reinforcement Learning for Combinatorial Optimization: A Surveycited by 235
  3. 2020Learning Combinatorial Optimization on Graphs: A Survey with Applications to Networkingcited by 70
  4. 2021Automated Machine Learning on Graphs: A Surveycited by 38
  5. 2021A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphscited by 26
  6. 2019Learning Heuristics over Large Graphs via Deep Reinforcement Learningcited by 23
  7. 2021Meta-Learning with Graph Neural Networks: Methods and Applicationscited by 7

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.