arXiv:2608. 16435v1 Announce Type: new Abstract: In collection operations, accumulating payload progressively slows the vehicle, imposing a cumulative penalty on routing efficiency.
arXiv:2607. 06066v1 Announce Type: new Abstract: The Vehicle Routing Problem (VRP) and its variants represent some of the most practically consequential optimization challenges in modern logistics and urban mobility.
arXiv:2606. 30680v1 Announce Type: cross Abstract: Truck-drone delivery is an emerging last-mile logistics mode combining the long-haul capacity of trucks with the flexible service capability of drones.
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. 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 paper introduces MEMENTO, a memory‑enhanced neural solver that improves routing problem solutions by using online data from repeated attempts to adjust action distributions during inference. It targets NP‑hard routing tasks such as the Traveling Salesman and Capacitated Vehicle Routing problems, outperforming existing tree‑search and policy‑gradient fine‑tuning methods. MEMENTO demonstrates strong scalability and data efficiency, achieving state‑of‑the‑art results on 11 of 12 evaluated tasks and enabling zero‑shot integration with diversity‑based solvers.
arXiv:2507. 19712v3 Announce Type: replace-cross Abstract: In this paper, we explore mission assignment and task offloading in an Open Radio Access Network (Open RAN)-based intelligent transportation system (ITS), where autonomous vehicles leverage mobile edge computing for efficient processing.
arXiv:2501. 17377v4 Announce Type: replace-cross Abstract: Deep Reinforcement Learning (DRL) has emerged as a promising approach for solving Combinatorial Optimization (CO) problems, such as the 3D Bin Packing Problem (3D-BPP), Traveling Salesman Problem (TSP), or Vehicle Routing Problem (VRP), but these neural solvers often exhibit brittleness when facing distribution shifts.
arXiv:2605. 13221v2 Announce Type: replace Abstract: In cloud manufacturing, unmanned aerial vehicles (UAVs) can support both product collection and mobile edge computing (MEC).
arXiv:2607. 05683v1 Announce Type: new Abstract: Battery charging of Autonomous Mobile Robots (AMRs) in warehouses is a critical operational challenge that heavily impacts both order processing times and throughput.
The paper introduces IQACO, an implicit Q‑learning‑bootstrapped ant colony optimization algorithm for scheduling maritime moving‑target observations with agile Earth‑observation satellites. IQACO embeds an offline implicit Q‑learning module into the ant colony framework to adaptively adjust pheromone, heuristic, and evaporation parameters based on a compact search‑state representation. Experiments on 14 scenarios show IQACO outperforms conventional ant colony optimization, improving mean observation benefit by 3.40%–9.40%, accelerating convergence, and maintaining stability across different objective‑weight settings.
arXiv:2608. 02343v1 Announce Type: cross Abstract: Many operational problems are constrained sequential decision processes with large, combinatorial action spaces and interdependent feasibility constraints.
arXiv:2511. 06229v3 Announce Type: replace Abstract: This paper focuses on dynamic origin-destination matrix estimation (DODE), a crucial calibration process necessary for the effective application of microscopic traffic simulations.