|
|
容量约束电动汽车路径问题的Q-Learning超启发式优化模型与动态规划充电策略
|
Abstract:
本文研究容量约束电动汽车路径问题(CEVRP),在车辆载重与电池电量双重约束下,建立以车队总行驶距离最小为目标的0-1混合整数规划模型。令客户集、充电站副本集和扩展节点集分别为 、 和 。以 表示弧选择变量,以 和 表示载重与剩余电量状态,目标函数为 ,并以唯一服务、流守恒、载重递推和电量递推约束定义可行域。针对该NP难组合优化问题,将低层启发式算子选择建模为有限马尔可夫决策过程 ,依据Bellman最优方程更新
| [1] | Cataldo-Díaz, C., Linfati, R. and Escobar, J.W. (2023) Mathematical Models for the Electric Vehicle Routing Problem with Time Windows Considering Different Aspects of the Charging Process. Operational Research, 24, Article No. 1. https://doi.org/10.1007/s12351-023-00806-5 |
| [2] | Ceselli, A., Felipe, Á., Ortuño, M.T., Righini, G. and Tirado, G. (2021) A Branch-and-Cut-and-Price Algorithm for the Electric Vehicle Routing Problem with Multiple Technologies. Operations Research Forum, 2, Article No. 8. https://doi.org/10.1007/s43069-020-00052-x |
| [3] | Froger, A., Mendoza, J.E., Jabali, O. and Laporte, G. (2019) Improved Formulations and Algorithmic Components for the Electric Vehicle Routing Problem with Nonlinear Charging Functions. Computers & Operations Research, 104, 256-294. https://doi.org/10.1016/j.cor.2018.12.013 |
| [4] | Lysgaard, J., Letchford, A.N. and Eglese, R.W. (2004) A New Branch-and-Cut Algorithm for the Capacitated Vehicle Routing Problem. Mathematical Programming, 100, 423-445. https://doi.org/10.1007/s10107-003-0481-8 |
| [5] | Rastani, S. and Çatay, B. (2021) A Large Neighborhood Search-Based Matheuristic for the Load-Dependent Electric Vehicle Routing Problem with Time Windows. Annals of Operations Research, 324, 761-793. https://doi.org/10.1007/s10479-021-04320-9 |
| [6] | Kullman, N.D., Froger, A., Mendoza, J.E. and Goodson, J.C. (2021) Frvcpy: An Open-Source Solver for the Fixed Route Vehicle Charging Problem. INFORMS Journal on Computing, 33, 1277-1283. https://doi.org/10.1287/ijoc.2020.1035 |
| [7] | Bacci, T., Gentile, C. and Pizzari, E. (2026) On Tackling Non-Linear Charging Functions in the Electric Vehicle Routing Problem. Optimization Letters. https://doi.org/10.1007/s11590-026-02319-4 |
| [8] | Tarhini, A., Danach, K. and Harfouche, A. (2020) Swarm Intelligence-Based Hyper-Heuristic for the Vehicle Routing Problem with Prioritized Customers. Annals of Operations Research, 308, 549-570. https://doi.org/10.1007/s10479-020-03625-5 |
| [9] | Fitzpatrick, J., Ajwani, D. and Carroll, P. (2024) A Scalable Learning Approach for the Capacitated Vehicle Routing Problem. Computers & Operations Research, 171, Article ID: 106787. https://doi.org/10.1016/j.cor.2024.106787 |
| [10] | Pulyassary, H., Kollias, K., Schild, A., Shmoys, D. and Wu, M. (2025) Network Flow Problems with Electric Vehicles. Mathematical Programming, 216, 489-520. https://doi.org/10.1007/s10107-025-02295-0 |
| [11] | Karimi-Mamaghan, M., Mohammadi, M., Meyer, P., Karimi-Mamaghan, A.M. and Talbi, E. (2022) Machine Learning at the Service of Meta-Heuristics for Solving Combinatorial Optimization Problems: A State-of-the-Art. European Journal of Operational Research, 296, 393-422. https://doi.org/10.1016/j.ejor.2021.04.032 |
| [12] | Burke, E.K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., et al. (2013) Hyper-Heuristics: A Survey of the State of the Art. Journal of the Operational Research Society, 64, 1695-1724. https://doi.org/10.1057/jors.2013.71 |
| [13] | Alissa, M., Sim, K. and Hart, E. (2023) Automated Algorithm Selection: From Feature-Based to Feature-Free Approaches. Journal of Heuristics, 29, 1-38. https://doi.org/10.1007/s10732-022-09505-4 |
| [14] | Drake, J.H., Kheiri, A., Özcan, E. and Burke, E.K. (2020) Recent Advances in Selection Hyper-Heuristics. European Journal of Operational Research, 285, 405-428. https://doi.org/10.1016/j.ejor.2019.07.073 |
| [15] | Meignan, D., Koukam, A. and Créput, J. (2009) Coalition-Based Metaheuristic: A Self-Adaptive Metaheuristic Using Reinforcement Learning and Mimetism. Journal of Heuristics, 16, 859-879. https://doi.org/10.1007/s10732-009-9121-7 |
| [16] | Lee, D., Hu, J. and He, N. (2023) A Discrete-Time Switching System Analysis of Q-Learning. SIAM Journal on Control and Optimization, 61, 1861-1880. https://doi.org/10.1137/22m1489976 |