计算机科学 ›› 2026, Vol. 53 ›› Issue (10): 123-133.doi: 10.11896/jsjkx.260300162

• 大模型与多模态智能感知 • 上一篇    下一篇

面向电动网约车在线调度的LLM评判引导启发式进化框架

杨明楚, 陈伟能, 魏凤凤, 史宣莉, 杨圣   

  1. 华南理工大学计算机科学与工程学院 广州 510006
  • 收稿日期:2026-03-31 修回日期:2026-06-10 发布日期:2026-10-13
  • 通讯作者: 陈伟能(cschenwn@scut.edu.cn)
  • 作者简介:(mingcyang@163.com)
  • 基金资助:
    国家重点研发计划(2023YFE0206200);国家自然科学基金重大研究计划培育项目(92582115)

LLM-assisted Evolution of Heuristic with Critic Guidance for Online Dispatching of ElectricRide-hailing Vehicles

YANG Mingchu, CHEN Weineng, WEI Fengfeng, SHI Xuanli, YANG Sheng   

  1. School of Computer Science and Engineering,South China University of Technology,Guangzhou 510006, China
  • Received:2026-03-31 Revised:2026-06-10 Online:2026-10-13
  • About author:YANG Mingchu,born in 2002,Ph.D candidate,is a member of CCF(No.A08181G).His main research interests include evolutionary computation,reinforcement learning and large language model.
    CHEN Weineng,born in 1983,Ph.D,professor,Ph.D supervisor,is a member of CCF(No.27739D).His main research interests include multi-agent systems,swarm intelligence and intelligent optimization.
  • Supported by:
    National Key Research and Development Program of China(2023YFE0206200) and Cultivation Project of Major Research Plan of National Natural Science Foundation of China(92582115).

摘要: 随着电动网约车规模的扩大,其在线调度面临实时性要求高与决策复杂度高的挑战。传统启发式规则因具备实时性与可解释性而在工业界得到广泛应用,但其高度依赖人工设计,且难以适应复杂动态环境。传统遗传规划等启发式自动设计方法受限于预定义的模块化组件,难以充分利用问题语义信息;而现有基于大语言模型(LLM)的启发式自动设计方法虽具备语义表达能力,却缺乏有效的局部优化引导,通常需要多轮交互才能获得高质量规则。针对上述问题,提出了一种结合评判引导的LLM启发式进化框架LEHR-C。通过构建LLM驱动的进化搜索机制,在基于LLM的子代生成阶段,仅利用交叉与变异算子实现对启发式规则设计思想与代码结构的语义级全局引导;并提出LLM评判机制对候选规则进行缺陷分析与反馈,从而为规则演化提供针对性的局部优化方向。在真实路网数据集上的实验结果表明,相比代表性LLM启发式自动设计方法,LEHR-C能够在减少约45%的LLM交互次数与推理开销的情况下,生成具有良好泛化能力的高质量启发式规则,有效提升在线动态订单处理与车辆路径构建效率,并在启发式规则质量与训练成本之间取得良好平衡。

关键词: 电动汽车, 车辆路径规划问题, 在线调度, 大语言模型, 启发式自动设计

Abstract: With the expansion of electric vehicle ride-hailing fleets,their online dispatching faces stringent real-time requirements and complex decision making.Traditional heuristic rules are widely adopted in industry because they offer both real-time efficiency and interpretability.However,they rely heavily on manual design and adapt poorly to complex dynamic environments.Conventional automatic heuristic design methods,such as genetic programming,are often constrained by predefined modular components and struggle to exploit the semantic information of the problem.Although existing large language model(LLM)-based heuristic design methods exhibit semantic representation capabilities,they lack effective guidance for local optimization,typically requiring multiple rounds of interaction to obtain high-quality rules.To address these issues,an LLM-assisted heuristic rule evolution framework with critic guidance,termed LEHR-C,is proposed.Within the constructed LLM-driven evolutionary search mechanism,only crossover and mutation operators are employed during the LLM-based offspring generation stage to achieve semantic-level global guidance over the design concepts and code structures of the heuristic rules.Furthermore,an LLM-based critic mechanism is introduced to perform defect analysis and provide feedback on candidate rules,thereby offering targeted local optimization directions for rule evolution.Experimental results on real-world road network datasets show that,compared with representative LLM-based automated heuristic design methods,LEHR-C can generate high-quality heuristic rules with strong generalization capabilities whilecutting LLM interactions and inference overhead by approximately 45%.The proposed method effectively improves the efficiency of online dynamic request handling and vehicle route construction,achieving a favorable trade-off between heuristic quality and training cost.

Key words: Electric vehicle, Vehicle routing problem, Online dispatching, Large language model, Automated heuristic design

中图分类号: 

  • TP181
[1] MERCURE J F,LAM A,BUXTON J E,et al.Evidence of a cascading positive tipping point towards electric vehicles[J].Nature Communications,2025,17(1):240.
[2] JENN A.Emissions benefits of electric vehicles in Uber and Lyft ride-hailing services[J].Nature Energy,2020,5(7):520-525.
[3] LIU W L,GONG Y J,CHEN W N,et al.Coordinated Charging Scheduling of Electric Vehicles:A Mixed-Variable Differential Evolution Approach[J].IEEE Transactions on Intelligent Transportation Systems,2020,21(12):5094-5109.
[4] DONG H,LUO Z,HUANG N,et al.The electric vehicle dial-a-ride problem:Integrating ride-sharing and time-of-use electricity pricing[J].Transportation Research Part E:Logistics and Transportation Review,2025,194:103946.
[5] BASSO R,KULCSÁR B,SANCHEZ-DIAZ I,et al.Dynamicstochastic electric vehicle routing with safe reinforcement lear-ning[J].Transportation Research Part E:Logistics and Transportation Review,2022,157:102496.
[6] JIA Y H,MEI Y,ZHANG M.Confidence-Based Ant ColonyOptimization for Capacitated Electric Vehicle Routing Problem With Comparison of Different Encoding Schemes[J].IEEE Transactions on Evolutionary Computation,2022,26(6):1394-1408.
[7] WANG T,WU D,ZHAO W.Minimizing Indirect Contacts in Urban Pick-Up and Delivery Services During COVID-19 Pandemic[J].IEEE Transactions on Systems,Man,and Cyberne-tics:Systems,2023,53(12):7876-7887.
[8] YANG M C,CHEN W N,WEI F F,et al.Gene Expression Programming-Based Ride Insert Policy for Online Electric Vehicle Ride-Hailing Optimization[J].IEEE Transactions on Intelligent Transportation Systems,2025,26(12):22136-22150.
[9] MAVROVOUNIOTIS M,MENELAOU C,TIMOTHEOU S,et al.Benchmark Set for the IEEE WCCI-2020 Competition on Evolutionary Computation for the Electric Vehicle Routing Problem[EB/OL].https://mavrovouniotis.github.io/EVRPcompetition2020/TR-EVRP-Competition.pdf.
[10] YILMAZ Y,KALAYCI C B.Variable Neighborhood Search Al-gorithms to Solve the Electric Vehicle Routing Problem with Simultaneous Pickup and Delivery[J].Mathematics,2022,10(17):3108.
[11] LIU Z,ZUO X,ZHOU M,et al.Electric Vehicle Routing Problem With Variable Vehicle Speed and Soft Time Windows for Perishable Product Delivery[J].IEEE Transactions on Intelligent Transportation Systems,2023,24(6):6178-6190.
[12] JIA Y H,CHEN W N,GU T,et al.A Dynamic Logistic Dispatching System With Set-Based Particle Swarm Optimization[J].IEEE Transactions on Systems,Man,and Cybernetics:Systems,2018,48(9):1607-1621.
[13] TAHAMI H,RABADI G,HAOUARI M.Exact approaches for routing capacitated electric vehicles[J].Transportation Research Part E:Logistics and Transportation Review,2020,144:102126.
[14] LERA-ROMERO G,MIRANDA BRONT J J,SOULIGNAC F J.A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows[J].European Journal of Operational Research,2024,312(3):978-995.
[15] GUO Z F,LI Y,JIANG X D,et al.The electric vehicle routing problem with time windows using genetic algorithm[C]//2017 IEEE 2nd Advanced Information Technology,Electronic and Automation Control Conference(IAEAC).2017:635-639.
[16] MONTEMANNI R,GAMBARDELLA L M,RIZZOLI A E,et al.Ant colony system for a dynamic vehicle routing problem[J].Journal of Combinatorial Optimization,2005,10(4):327-343.
[17] XIANG X,TIAN Y,ZHANG X,et al.A Pairwise ProximityLearning-Based Ant Colony Algorithm for Dynamic Vehicle Routing Problems[J].IEEE Transactions on Intelligent Transportation Systems,2022,23(6):5275-5286.
[18] SHAHBAZIAN R,CIACCO A,MACRINA G,et al.Knowl-edge-guided hybrid deep reinforcement learning for the dynamic multi-depot electric vehicle routing problem[J].Computers & Operations Research,2025,184:107217.
[19] LI P,HAO J,TANG H,et al.Bridging Evolutionary Algorithms and Reinforcement Learning:A Comprehensive Survey on Hybrid Algorithms[J].IEEE Transactions on Evolutionary Computation,2025,29(5):1707-1728.
[20] GIL-GALA F J,-DURASEVIĆ M,JAKOBOVIĆ D.Evolvingrouting policies for electric vehicles by means of genetic programming[J].Applied Intelligence,2024,54(23):12391-12419.
[21] HUANG W,MEI Y,RAIDL G,et al.Genetic Programming Hy-per-Heuristic for the Dynamic Electric Dial-a-Ride Problem[C]//2025 IEEE Congress on Evolutionary Computation(CEC).2025:1-8.
[22] O’NEILL M,VANNESCHI L,GUSTAFSON S,et al.Open issues in genetic programming[J].Genetic Programming and Evolvable Machines,2010,11(3/4):339-363.
[23] ZHAO W X,ZHOU K,LI J,et al.A Survey of Large Language Models[J].arXiv:2303.18223,2023.
[24] LIU F,ZHANG R,XIE Z,et al.LLM4AD:A Platform for Algorithm Design with Large Language Model[J].arXiv:2412.17287,2026.
[25] LI R,WANG L,SANG H,et al.LLM-Assisted AutomaticMemetic Algorithm for Lot-Streaming Hybrid Job Shop Scheduling With Variable Sublots[J].IEEE Transactions on Evolutionary Computation,2026,30(4):1377-1389.
[26] YE H,WANG J,CAO Z,et al.ReEvo:Large Language Models as Hyper-Heuristics with Reflective Evolution[J].Advances in Neural Information Processing Systems,2024,37:43571-43608.
[27] ROMERA-PAREDES B,BAREKATAIN M,NOVIKOV A,et al.Mathematical discoveries from program search with large language models[J].Nature,2024,625(7995):468-475.
[28] MO S,WU K,GAO Q,et al.AutoSGNN:Automatic Propagation Mechanism Discovery for Spectral Graph Neural Networks[J].Proceedings of the AAAI Conference on Artificial Intelligence,2025,39(18):19493-19502.
[29] HOF J,SCHNEIDER M,GOEKE D.Solving the battery swap station location-routing problem with capacitated electric vehicles using an AVNS algorithm for vehicle-routing problems with intermediate stops[J].Transportation Research Part B:Methodological,2017,97:102-112.
[30] YANG Q,WANG H,TONG M,et al.Leveraging Reward Consistency for Interpretable Feature Discovery in Reinforcement Learning[J].IEEE Transactions on Systems,Man,and Cybernetics:Systems,2024,54(2):1014-1025.
[31] LIU F,YAO Y,GUO P,et al.A Systematic Survey on LargeLanguage Models for Algorithm Design[J].ACM Computing Surveys,2026,58(8):218:1-218:32.
[32] YANG X,ZHANG L,QIAN H,et al.HeurAgenix:Leveraging LLMs for Solving Complex Combinatorial Optimization Challenges[J].arXiv:2506.15196,2025.
[33] XIE Z,LIU F,WANG Z,et al.LLM-Driven NeighborhoodSearch for Efficient Heuristic Design[C]//2025 IEEE Congress on Evolutionary Computation(CEC).2025:1-8.
[34] LIU F,TONG X L,YUAN M X,et al.Evolution of Heuristics:Towards Efficient Automatic Algorithm Design Using Large Language Model[C]//Forty-first International Conference on Machine Learning.2024.
[35] SHI Y,ZHOU J,SONG W,et al.Generalizable Heuristic Gene-ration Through LLMs with Meta-Optimization[C]//The Fourteenth International Conference on Learning Representations.2025.
[36] SATOPAA V,ALBRECHT J,IRWIN D,et al.Finding a“Kneedle” in a Haystack:Detecting Knee Points in System Behavior[C]//2011 31st International Conference on Distributed Computing Systems Workshops.2011:166-171.
[37] LIAO X C,CHEN W N,JIA Y H,et al.Towards Scalable Dynamic Traffic Assignment With Streaming Agents:A Decentra-lized Control Approach Using Genetic Programming[J].IEEE Transactions on Emerging Topics in Computational Intelligence,2024,8(1):942-955.
[38] LIAO X C,JIA Y H,HU X M,et al.Uncertain Commuters Assignment Through Genetic Programming Hyper-Heuristic[J].IEEE Transactions on Computational Social Systems,2024,11(2):2606-2619.
[39] WEI F F,CHEN W N,ZHAO T F,et al.A Survey on Distributed Evolutionary Computation[J].IEEE Computational Intelligence Magazine,2025,20(3):41-62.
[40] WEI F F,CHEN W N,GUO X Q,et al.CrowdEC:Crowdsourcing-Based Evolutionary Computation for Distributed Optimization[J].IEEE Transactions on Services Computing,2024,17(6):3286-3299.
[41] CHEN T Y,CHEN W N,WEI F F,et al.The Confluence ofEvolutionary Computation and Multi-Agent Systems:A Survey[J].IEEE/CAA Journal of Automatica Sinica,2025,12:1-19.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!