arXiv Machine Learning
GATNextHop: A GAT for Shortest Path Routing with Cross-Topology Generalization
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Sep 18
Traffic Engineering in Large-scale Networks with Generalizable Graph Neural Networks
The paper introduces TELGEN, a traffic engineering algorithm that uses graph neural networks to predict an optimal TE algorithm rather than a direct solution. TELGEN generalizes across diverse network topologies and traffic patterns, achieving less than a 3% optimality gap on networks up to 5,000 nodes and 3.6 million links, while reducing solving time by up to 84% and training time by up to 79.6% compared to existing methods.
arXiv AI
Oct 15
GREAT: A Graph Edge Attention Network for the Electric Vehicle Routing Problem with Asymmetric Costs
The paper introduces GREAT, a Graph Edge Attention Network that operates directly on edge space to handle asymmetric energy costs in the Electric Vehicle Routing Problem (EVRP). Integrated into a reinforcement learning framework, GREAT jointly optimizes routing and charging decisions, outperforming a strong HGS-based heuristic by up to 8.78% in energy savings and reducing runtime by a factor of 60. It also shows competitive performance against a custom adaptive large neighborhood search and achieves state‑of‑the‑art results on other asymmetric routing benchmarks such as TSP, CVRP, and Orienteering.
arXiv AI
Jul 7
Graph Neural Networks are Heuristics
arXiv:2601. 13465v4 Announce Type: replace Abstract: Graph neural networks are usually treated as auxiliaries for combinatorial optimization: they imitate algorithms, guide search, or supply scores to classical procedures.
arXiv Machine Learning
2d ago
GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction
arXiv:2507.07138v2 Announce Type: replace Abstract: Graph Neural Networks (GNNs) often struggle to capture the link-specific structural patterns crucial for accurate link prediction, as their node-ce...
arXiv Machine Learning
Jun 18
AGDN: Learning to Solve Traveling Salesman Problem with Anisotropic Graph Diffusion Network
arXiv:2606. 19185v1 Announce Type: new Abstract: The Traveling Salesman Problem (TSP) is a cornerstone of combinatorial optimization and arises in many practical scenarios.
arXiv AI
Jul 22
GUIDED Network-Agnostic Feature Initialization for Spatial Transferability in GNN-based Models
arXiv:2607. 19270v1 Announce Type: cross Abstract: The Traffic Assignment Problem is a fundamental but computationally expensive component of transportation planning.