Skip to content

Emergent Charging Coordination in Electric Delivery Fleets

Sep 2026 · 0 citations · 65 references
Computer Science Engineering

TL;DR

This coordination paradigm balances local urgency against public occupancy, reaching near-Oracle performance at minimal implementation cost is validated in simulation on real OpenStreetMap networks of twenty cities.

Abstract

In electric delivery fleets, mid-shift charging is non-trivial: each vehicle must decide when, where and how much to charge to finish on time with battery above a safety floor. The choices are coupled: queues build where too many vehicles pick the same station. Prior work resolves this coupling with central dispatching, precomputed schedules or reservations, machinery that charging infrastructure rarely supports. Instead, we use a family of learning agents under purely local control: every vehicle runs the same policy, deciding alone from its time budgets and broadcast station occupancies, leading to emergent coordination without central control or messaging. We validate this paradigm in simulation on real OpenStreetMap networks of twenty cities, each with a frozen scenario calibrated by an omniscient Oracle (99.5% of shifts completed on time), whereas a naive greedy rule (nearest station on low battery) completes just 73%. Agents trained with neuroevolution (NEAT) and policy gradients (PPO) on four cities and deployed zero-shot across all twenty, sixteen never seen in training, complete 96.8% and 98.6% of shifts, with the policy-gradient controllers proving more robust when demand or vehicle characteristics drift beyond the trained regime. In contrast, tuned threshold heuristics that read vehicle urgency alone fall short in contended cities (~80%). Through training, these learning agents rediscover partial charging and short opportunistic sessions, and route around busy stations, cutting per-session queue waits from about 45 minutes to under 2. In summary, this coordination paradigm balances local urgency against public occupancy, reaching near-Oracle performance at minimal implementation cost.

View source

Similar papers

Open access Sep 2026

Dynamic Dispatch of Heterogeneous Autonomous Electric Fleets under First-In–First-Out Traffic and Charging Constraints

Dynamic routing is operationally fragile when autonomous electric vehicles differ in capacity and energy use, traffic changes mid-arc, and charging delays redispatch. We formulate a bi-objective problem minimizing operating cost and customer response without time windows. The model combines FIFO-consistent piecewise tr...

Kashif Bashir, R. Rafiq, M. A. Shah et al. · 0 citations
Open access Sep 2026

Scheduling the Charging of Battery-Electric Vehicles Under Heterogeneous Scheduling Constraints

Adopting battery electric vehicles (EVs) for vehicle fleets requires scheduling charging alongside day-to-day operations. This problem is complicated by complex utility cost structures, limited battery capacity, and competition for shared charging resources. Existing methods that simultaneously schedule routes and char...

Justin Whitaker, G. Droge, Mario Harper · 0 citations
Open access Oct 2026

An Operational Mixed-Integer Programming Model for Autonomous Electric Ride-Hailing Fleets

In this article, we consider an operator of an autonomous electric ride-hailing fleet who must decide, for every vehicle and period, whether to remain in place, travel empty to a rider, carry a rider, or charge at a station. The proposed mixed-integer programming model combines five operational features: deadhead trave...

Hamza Adeinat, Iman Adeinat · 0 citations
Open access Oct 2026

Conformal Digital-Twin Planning for Pre-Dispatch Electric Vehicle Fleet Routing Under Communication Uncertainty

Electric-vehicle fleets plan from digital-twin traffic, energy, charging, and station-availability state before dispatch. Communication loss, backend delay, and sensor noise make that state stale or incomplete. We study whether a conservative planning state, rather than update frequency alone, improves electric vehicle...

Abdelkader Kaddour, Lamri Sayad · 0 citations
Open access Sep 2026

Congestion-Triggered Electric-Vehicle Charging Station Assignment Using Short-Term Cumulative Demand Forecasts

Short-term congestion at public electric-vehicle charging stations depends on both near-future demand and how vehicles are distributed across the network. We forecast cumulative station-level charging initiations and use the forecasts in congestion-triggered station assignment. The analysis reuses 441077 publicly relea...

Oğuzkağan Alıç · 0 citations
Open access Sep 2026

A Control-Theoretic and Spectral Architecture for Multi-Echelon Resilience under Electrified Logistics

This paper treats multi-echelon resilience under electrified logistics as a closed-loop control problem rather than a scorecard. The plant is an inventory-and-fleet system whose material balances are coupled to usable pack energy, so a shipment is infeasible when every vehicle that could carry it violates an energy flo...

P. B · 0 citations

Related blog posts

Microsoft Research Blog Nov 16, 2026

TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient

AI coding agents are increasingly help developers fix bugs and build features largely on their own, but every interaction with their models consumes tokens. In each session, an agent sends instructions, tool descriptions, and session history to its model. Most efforts to reduce this cost focus on individual tasks. Yet developers return to the same […] The post TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.