AI 中文总结
研究分时电价下电池更换的无缺货充电调度问题，提出基于电池的混合整数线性规划及简化形式，设计价格引导的启发式算法，在综合缩放研究及商业站交换记录回放中验证算法有效性，大幅降低充电能源成本。
AI 中文摘要
电池更换站必须为每辆到达的车辆提供充电电池，同时将充电返回电池的分时成本降至最低。协调异构兼容性、特定车辆返回时间和有限的充电器容量需要在规划范围内做出服务感知充电决策。我们制定了一个基于电池的混合整数线性规划，在硬无缺货约束下捕捉这些操作特征，并推导出一个具有更少显式二元变量的可证明等效简化形式。在综合缩放研究中，一种价格引导的电池路径启发式算法为每个实例返回了一个全面服务的调度；制度级中位数求解时间为0.24至8.0秒。在中小规模下，其成本溢价中位数比认证参考成本高7-8%，在大规模和超大规模下，其认证事后最优差距上限为9-12%。对于每个操作基线，认证参考调度在基线完全服务且有认证参考的实例上，将充电能源成本降低了50-60%。在对一个商业站记录的1002次交换进行的30天回放中，简化模型和启发式滚动控制器服务了每一次交换，相对于立即充电，将充电能源成本降低了约50%。
英文摘要
A battery-swapping station must provide every arriving vehicle with a charged battery while minimizing the time-of-use cost of recharging returned units. Coordinating heterogeneous compatibility, vehicle-specific return times, and finite charger capacity requires service-aware recharge decisions across the planning horizon. We formulate a per-battery mixed-integer linear program that captures these operational features under a hard no-stockout constraint and derive a provably equivalent reduced form with fewer explicit binary variables. In the synthetic scaling study, a price-guided battery-path heuristic returned a full-service schedule for every instance; regime-level median solve times ranged from 0.24 to 8.0 seconds. Its median cost premiums were 7-8% over certified reference costs for small- and medium-scale instances, and its certified ex post optimality-gap upper bounds were 9-12% for large- and extra-large-scale instances. For each operational baseline, the certified reference schedules reduced charging-energy cost by 50-60% on instances that the baseline fully served and for which a certified reference was available. In a 30-day replay of 1,002 swaps recorded at a commercial station, the reduced-model and heuristic rolling controllers served every swap and reduced charging-energy cost by approximately 50% relative to immediate charging.
