The paper introduces an AI-driven Learning-to-Optimise framework that uses Graph Neural Networks to select real‑time multi‑hop relays in NR‑V2X networks for smart cities. By modelling the vehicular network as a graph and training a GINE model with MILP‑derived optimal decisions, the method achieves near‑optimal connectivity, improving connectivity by up to 11.3% and speeding up computation by up to 100×. This enables scalable, real‑time network control suitable for Industry 4.0 and smart‑city deployments.
arXiv:2607. 20554v1 Announce Type: new Abstract: Reliable and low-latency NR-V2X communications are essential for smart mobility in dense urban environments.
arXiv:2607. 14176v1 Announce Type: new Abstract: Reliable, low-latency uplink connectivity is a key requirement for C-V2X networks in dense urban environments, where fast channel variations and blockages often degrade direct vehicle-to-infrastructure links.
The paper proposes that Learning-to-Optimize (L2O) should serve as a missing architectural layer in AI-native communication networks, bridging optimisation and AI intelligence. It redefines optimisation algorithms as offline knowledge generators that produce supervisory data for neural surrogate models, enabling low‑latency inference in dynamic environments. A four‑stage workflow—optimisation, knowledge generation, surrogate learning, and runtime inference—is introduced, and demonstrated on an NR‑V2X relay‑selection problem where a Graph Neural Network learns near‑optimal decisions from MILP solutions.
The Traffic Assignment Problem is a fundamental but computationally expensive component of transportation planning. While Graph Neural Networks have emerged as fast, data-driven surrogates, their practical deployment is severely constrained by a spatial generalization gap.
arXiv:2607. 19270v1 Announce Type: cross Abstract: The Traffic Assignment Problem is a fundamental but computationally expensive component of transportation planning.
arXiv:2606. 13848v1 Announce Type: cross Abstract: Mobile networks continue to grow in complexity and next generation networks are expected to support both increasing traffic loads and more diverse services.
arXiv:2607. 23792v1 Announce Type: cross Abstract: Traffic shockwaves are stop-and-go waves that propagate upstream through the streams of vehicles and are one of the major causes of traffic congestion, fuel inefficiency, and increased accident rates in modern transportation systems.
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.
The paper introduces GNN-ISAC, a graph neural network–based power allocation algorithm for vehicular integrated sensing and communication networks. It models two edge types—inter‑provider interference and intra‑provider power‑budget sharing—to maximize communication sum‑rate while meeting sensing SINR constraints. Trained without labels via a sensing‑penalized sum‑rate loss, GNN‑ISAC achieves near‑optimal performance compared to WMMSE, with lower sensing‑link violations, reduced computation, and better generalization to larger 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:2608.28627v1 Announce Type: new Abstract: Designing high-performance tactical wireless networks under realistic operational constraints gives rise to challenging combinatorial optimization prob...
The paper presents an end‑to‑end framework that uses constraint‑oriented hypergraphs and reinforcement learning to solve vehicle routing problems. It introduces a dynamic hyperedge reconstruction strategy for better hypergraph representation and a double‑pointer attention decoder for iterative solution generation. Experiments on benchmark datasets show that the method removes the need for complex heuristic operators while improving solution quality.