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:2610.14792v1 Announce Type: new Abstract: Online, same-day delivery requires operators to constantly update their routes, and the routing cost for deliveries increases with the number of custom...
arXiv:2606. 01987v1 Announce Type: cross Abstract: We show that the Vehicle Routing Problem (VRP) can be reformulated as a Graph Edit Distance (GED) maximization problem.
SynthCharge is a parametric generator that creates diverse, feasibility‑screened instances of the electric vehicle routing problem with time windows (EVRPTW). It produces instances ranging from 5 to 100 customers (up to 500 in theory) with adaptive energy capacity scaling and range‑aware charging station placement, filtering out unsolvable cases via a fast feasibility screening process. This dynamic benchmarking infrastructure enables systematic evaluation of learning‑based routing and data‑driven approaches.
arXiv:2607. 23467v1 Announce Type: new Abstract: We study an integrated pickup-and-delivery problem on sparse, non-Euclidean networks that jointly optimizes cyclic routing, cargo flow allocation, and cross-cycle service.
arXiv:2602. 00488v3 Announce Type: replace Abstract: Solving large-scale capacitated vehicle routing problems (CVRP) is hindered by the high complexity of classical heuristics and the limited generalization of neural solvers.
arXiv:2607. 16875v1 Announce Type: cross Abstract: We introduce the vehicle routing problem with stochastic demands and outsourcing options (VRP-SDO), in which a logistics service provider partitions customer requests into customers outsourced to a common carrier and customers committed to its fixed fleet.
arXiv:2607. 19270v1 Announce Type: cross Abstract: The Traffic Assignment Problem is a fundamental but computationally expensive component of transportation planning.
arXiv:2606. 04167v1 Announce Type: cross Abstract: We tackle the Metro Network Expansion Problem (MNEP), a subset of the Transport Network Design Problem (TNDP), which focuses on expanding metro systems to satisfy travel demand.
arXiv:2607. 22356v1 Announce Type: new Abstract: In recent years, the growing complexity of last-mile pickup operations has increased the need for fast and accurate decision-making on logistics platforms.
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:2608.23917v1 Announce Type: new Abstract: Common shortest-path algorithms, such as Dijkstra's (SPF), that OSPF uses, provide exact routing solutions but must be recomputed for each network topo...
arXiv:2608. 13212v1 Announce Type: new Abstract: Networked systems, from power grids to traffic networks and cloud clusters, carry loads across nodes with limited capacity.