ISSN 1000-1239 CN 11-1777/TP

计算机研究与发展 ›› 2020, Vol. 57 ›› Issue (6): 1269-1283.doi: 10.7544/issn1000-1239.2020.20190484

• 人工智能 • 上一篇    下一篇



  1. (辽宁工程技术大学软件学院 辽宁葫芦岛 125100) (
  • 出版日期: 2020-06-01
  • 基金资助: 

Multi-Strategy Solution Space Graph Search Algorithm of Real-Time Ride-Sharing Problem

Guo Yuhan, Zhang Yu, Shen Xueli, Yu Junyu   

  1. (College of Software, Liaoning Technical University, Huludao, Liaoning 125100)
  • Online: 2020-06-01
  • Supported by: 
    This work was supported by the National Natural Science Foundation of China (61404069), the Natural Science Foundation of Liaoning Province of China (2019-ZD-0048), and the Basic Research Project of Liaoning Provincial Education Department (LJ2019JL012).

摘要: 车辆共乘旨在通过降低车辆空载率以提升运输效率、缓解交通拥堵、降低环境污染并节省出行资源. 首先针对即时车辆共乘问题构建了数学模型,以共享路程比率和绕行距离约束为手段对车辆合乘中车主资源的利用效率进行评估.然后提出离散排列问题的解空间图理论并对其原理进行了阐述和分析,继而基于此理论构建一种多策略解空间图搜索算法.该算法以并行化结构生成价值矩阵显著提升了传统方法的效率,并以多种控制策略操纵结合离散排列问题特点设计的不同搜索算子,指导搜索过程在解空间图中向更高价值方向移动以高效获取高质量的匹配方案.实验结果表明,该算法的求解质量可达最优解的95%以上,且求解效率明显优于对比实验中的其他算法.

关键词: 车辆共乘, 解空间图, 多策略搜索算法, 离散排列问题, 组合优化算法

Abstract: Ride-sharing can improve transportation efficiency, alleviate traffic congestion, reduce environmental pollution and save travel costs through decreasing the vehicle vacancy rate of all participants. Firstly, in this paper, a mathematical model is constructed for the real-time ride-sharing problem, where the utilization efficiency of the driver resources in the ride-sharing is evaluated by means of the shared route percentage and the detour distance constraint. Then, a solution space graph theory of discrete permutation problem is proposed and its principle is elaborated and analyzed. Based on this theory, a multi-strategy solution space graph search algorithm is constructed. The algorithm utilizes a parallel structure to generate the value matrix of driver-rider pairs, which greatly improves the efficiency of the algorithm compared with traditional approaches. Several different search operators, designed based on the characteristics of the discrete permutation problem, are manipulated by multiple control strategies proposed in this paper, which guide the search process to move to higher value directions of the solution space graph to obtain high quality matching results efficiently. The experimental results show that the quality of the algorithm can exceed 95% of the optimal solution, and the efficiency of the algorithm is significantly superior than the other algorithms compared in the experiment.

Key words: ride-sharing, solution space graph, multi-strategy search algorithm, discrete permutation problem, combinational optimization algorithm