TRV-2026-2177Version 1 · Certified

Written 2026-10-22 18:13:52 UTC · current record

Reason for this version

Certified into the record

Canonical text (the exact bytes fingerprinted)

TRUVACE RECORD VERSION
record: TRV-2026-2177
version: 1
kind: certified
reason: Certified into the record
timestamp: 2026-10-22T18:13:52.414807Z
status: published
lens: g_space
sector: climate
headline: Decision intelligence for electric bus charging scheduling through LLM-driven reward shaping and reinforcement learning
dek: The rapid expansion of electric bus fleets has made charging scheduling a critical decision-intelligence problem in urban fleet-energy logistics. Reinforcement learning (RL) is promising for this problem, but reward function design still relies on manual trial-and-error and transfers poorly across scenarios. This paper develops an artificial intelligence and operations research (AI-OR) decision intelligence framework that integrates large language model (LLM)-driven reward shaping with RL-based sequential decisi…
gain_title: An LLM-driven reward iteration framework for reinforcement learning scheduled electric bus charging at lower cost than traditional methods across synthetic and real-world Guangzhou bus station scenarios.
problem_title: (none)
trace_subject: (none)
gain_reading: An LLM-driven reward iteration framework for reinforcement learning scheduled electric bus charging at lower cost than traditional methods across synthetic and real-world Guangzhou bus station scenarios.
gain_evidence: LLM-driven reward iteration outperforms traditional methods across all scenarios | reducing costs by up to 32.6 % in nominal within-day charging cost
problem_reading: (none)
problem_evidence: (none)
quick_read: Researchers built a decision-intelligence framework in which a large language model writes and revises reward functions as executable code, and a reinforcement learning agent uses them to schedule electric bus charging. It was tested on one synthetic scenario and two real bus stations in Guangzhou, using three mainstream LLMs under different initialization conditions.

The work matters because growing electric bus fleets make charging scheduling hard, and manual reward design transfers poorly between settings. Automating that step could ease deployment and help shift charging to valley periods. The evidence comes from simulated experiments at a few stations, so real-world operation is not yet shown.
limitation: The reported savings are nominal within-day charging costs, and the lower 22.5 % figure relies on an approximate adjustment for energy left on board.
tag: Evidence-backed gain
key_points: The framework has four modules: reward initializer, performance analysis, reward exploration, and rollback. | An event-triggered two-stage charging reallocation mechanism enforces operational constraints through action masking. | Costs fell by up to 32.6 % in nominal within-day charging cost versus traditional methods. | After an approximate adjustment for energy left on board, savings were up to 22.5 %. | Ablation and sensitivity analyses supported each module and compatibility with multiple RL algorithms.
rundown: The paper frames electric bus charging scheduling as a decision-intelligence problem in urban fleet-energy logistics. Reinforcement learning is promising, but reward design currently depends on manual trial-and-error.

The approach represents reward functions as executable code that the LLM iteratively optimizes. Battery safety bounds are managed through readiness conditions, reward shaping, and the acceptance criterion.

Experiments compared three mainstream LLMs on a synthetic case and two Guangzhou bus stations. Analysis of how the rewards evolved identified design principles for charging efficiency, valley-period energy shifting, and fleet-energy logistics resilience.
sources:
- peer_reviewed | Transportation Research Part C: Emerging Technologies | https://doi.org/10.1016/j.trc.2026.106090 | 2026-10-21
prev: 0000000000000000000000000000000000000000000000000000000000000000
sha256
0e181642d5da91c19b6cabd0bdde3f9d4bc44c0ca2f699cbfe4c508b8913e856
previous
0000000000000000000000000000000000000000000000000000000000000000
Verify this record
How to verify without trusting this page

Fetch the canonical text of any version from /api/record/TRV-2026-2177 and hash it yourself — for example shasum -a 256 on the saved canonical field. The result must equal content_hash, and each version’s text ends with prev:followed by the prior version’s hash (version 1 chains to 64 zeros). If a single character of any version had been altered since certification, the chain would not reproduce.