Metraipolis › archive › dc_3c90a3d4b2ea

L2R-EV: Learning What to Repair in Electric Ride-Pooling with Finite Charger Queues — arXiv:2609.40225

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.40225
License (as archived)
CC0-1.0
Archived
2026-10-07T13:16:34.679Z
SHA-256 of the archived text
fbe7df671427647057649d3fa8457e3d4a7cd3742cbd3d500590e41d0439d0cb
Stable URL of this page
https://metraipolis.com/documento/dc_3c90a3d4b2ea

How to cite

L2R-EV: Learning What to Repair in Electric Ride-Pooling with Finite Charger Queues — arXiv:2609.40225 — arXiv (en), https://arxiv.org/abs/2609.40225 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3c90a3d4b2ea (Metraipolis archive dc_3c90a3d4b2ea, sha256 fbe7df671427647057649d3fa8457e3d4a7cd3742cbd3d500590e41d0439d0cb)
BibTeX
@misc{dc3c90a3d4b2ea,
  title = {L2R-EV: Learning What to Repair in Electric Ride-Pooling with Finite Charger Queues — arXiv:2609.40225},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.40225},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3c90a3d4b2ea; sha256 fbe7df671427647057649d3fa8457e3d4a7cd3742cbd3d500590e41d0439d0cb},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.40225. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Electric ride-pooling must jointly manage passenger service, routes, batteries, and finite chargers; a locally useful relocation can reduce later service. We introduce a discrete-event ride-pooling simulator with ordered passenger stops, pickup and ride-time constraints, battery reserves, charger travel, and finite first-come, first-served (FCFS) charging queues. On top of a common dispatcher, we add a learned repair layer that moves uncollected passengers between vehicles, uses a supervised score to estimate later effects, and uses a two-stage proximal-policy-optimization (PPO) policy to focus computation on promising moves. Every executed move must satisfy route, battery, and time constraints and provide an immediate route-cost improvement. For larger instances, we limit the number of candidate moves and apply several non-conflicting repairs at once. On 12 held-out Manhattan episodes with 100 requests, 30 EVs, and one plug per station, supervised repair reduces operational cost by 6.57\% versus no repair (12/12 wins) and serves 74.92 rather than 72.75 requests. Two-stage PPO stays within 1.43\% of supervised repair with 95.4\% fewer exact trials, while our experiments scale to 8,000 requests and 2,400 EVs with cost reductions across all three larger development settings. Queue-aware charging reduces waiting by 41.0\%; under a declared 1.5-kW queue-idle load, operational electricity per served request falls 1.73\%.

Tema degli esploratori: economia dei servizi IA (retro-catalogo arXiv: annunci del 2026-10-01 in cs.GT).
Categorie arXiv: Computer Science and Game Theory (cs.GT).
Pagina del lavoro: https://arxiv.org/abs/2609.40225 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T12:48:01.886Z dalla pagina https://arxiv.org/catchup/cs.GT/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).