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.
arXiv:2607. 20554v1 Announce Type: new Abstract: Reliable and low-latency NR-V2X communications are essential for smart mobility in dense urban environments.
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.
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.
arXiv:2608.28627v1 Announce Type: new Abstract: Designing high-performance tactical wireless networks under realistic operational constraints gives rise to challenging combinatorial optimization prob...
arXiv:2503. 03137v3 Announce Type: replace Abstract: Constructive neural combinatorial optimization (NCO) offers a promising paradigm for solving vehicle routing problems (VRPs) by directly learning to construct approximate optimal solutions, thereby reducing reliance on expert knowledge for algorithm design.
arXiv:2609.26275v1 Announce Type: new Abstract: The vehicle routing problems with real-world constraints (we consider vehicles capacity limits, time windows constrains, pickup-and-delivery multi-depo...
arXiv:2610. 00422v1 Announce Type: cross Abstract: Neural combinatorial optimization typically assumes a centralized solver that reads the whole instance.
arXiv:2607. 19270v1 Announce Type: cross Abstract: The Traffic Assignment Problem is a fundamental but computationally expensive component of transportation planning.
arXiv:2603. 06607v2 Announce Type: replace-cross Abstract: Radio resource allocation (RRA) is a critical function in cellular vehicle-to-everything (C-V2X) networks, where vehicles must share limited wireless resources to support safety-critical communications.
arXiv:2606. 03664v1 Announce Type: cross Abstract: Ultra Reliable and Low Latency Communications (URLLC) was one of the main motivations behind 5G, with 3GPP advertising 1-10 ms latency targets for applications such as industrial automation, Vehicle-To-Everything (V2X), tactical edge networking, and unmanned-system control.
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.
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.