计算机应用研究2024，Vol.41Issue(6)：1714-1721,8.DOI:10.19734/j.issn.1001-3695.2023.09.0438
考虑实时订单更新的拼车调度双层规划模型
Double-layer scheduling model for carpooling service considering dynamic order-updating
摘要
Abstract
To effectively address the real-time updates of passenger demand orders on online carpooling platforms,this paper proposed an algorithm for continuously assigning orders to drivers with unfinished orders.The proposed algorithm ensured an increase in driver earnings while enhancing the dispatch efficiency of the carpooling platform.Specifically,this paper devel-oped a double-layer scheduling model which maximized the total driver revenue on the basis of the service quality and opera-tional costs of the carpooling system,and proposed a double-layer algorithm for this model.The bottom layer involved the con-struction of a model for the carpooling routing problem,which was solved by using an improved genetic algorithm.The upper layer determined the order of task assignments,which adopted the greedy algorithm to call the model in the botton layer and compared revenue changes to obtain the final scheduling result.The model demonstrated its effectiveness and feasibility through a specific example,validating the prompt determination of order matching results and travel routes.The calculated re-sults faithfully reflect real-world scenarios.Comparative experiments shows that the model not only achieves the goal of increas-ing driver earnings,but also effectively reduces delay time and travel distances.This has positive reference significance for re-lated studies on carpooling scheduling problems in the context of real-time order updates.关键词
网约拼车/匹配策略/路径优化/双层算法Key words
ridesplitting/matching strategy/routing optimization/double-layer algorithm分类
信息技术与安全科学引用本文复制引用
李佶霖,袁鹏程,林徐勋,胡凯..考虑实时订单更新的拼车调度双层规划模型[J].计算机应用研究,2024,41(6):1714-1721,8.基金项目
国家自然科学基金资助项目(71601118) （71601118）
