Computer Engineering and Applications ›› 2016, Vol. 52 ›› Issue (20): 92-97.

Previous Articles     Next Articles

Carpool path planning strategy under reservation mechanism

LIU Xiao, LI Demin, ZHANG Guanglin, TANG Hainie   

  1. 1.College of Information Science & Technology, Donghua University, Shanghai 201620, China
    2.Engineering Research Center of Digitized Textile & Fashion Technology,Ministry of Education, Donghua University, Shanghai 201620, China
  • Online:2016-10-15 Published:2016-10-14

预约机制下的共乘路径规划策略

刘  潇,李德敏,张光林,汤海涅   

  1. 1.东华大学 信息科学与技术学院,上海 201620
    2.东华大学 数字化纺织服装技术教育部工程研究中心,上海 201620

Abstract: For the reason that existing carpooling path algorithms focus only on the minimum of the total weight of path rather than the accuracy of arrival time, it proposes an optimal algorithm of carpooling path under the mechanism of appointment. It collects the information of appointment ride, introduces the concept of classification to classify the passenger information in group. Then it utilizes the Bellman-Ford algorithm intragroup, and arriving time path algorithm intergroup, so that it comes up with Carpooling Path Planning Algorithm in Order(CPPAO), which takes into account both the accuracy of arriving time and consumption of travel cost.

Key words: ride-sharing, reservation mechanism, arrival time, group, Bellman-Ford algorithm

摘要: 现有的共乘路径算法只专注优化路径总权值而很少考虑到达时间准确性,针对这一现状提出一种预约机制下的共乘路径最优算法。采集乘客的预约搭乘信息,引入分类的概念对乘客信息进行团体分类,对团体内使用Bellman-Ford算法,团体间使用到达时间路径算法,得出了预约机制下的共乘路径最优算法CPPAO,使得该算法兼顾到达时间的准确和行驶代价的消耗。

关键词: 共乘, 预约机制, 到达时间, 团体, Bellman-Ford算法