欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
现有的共乘路径算法只专注优化路径总权值而很少考虑到达时间准确性，针对这一现状提出一种预约机制下的共乘路径最优算法。采集乘客的预约搭乘信息，引入分类的概念对乘客信息进行团体分类，对团体内使用Bellman-Ford算法，团体间使用到达时间路径算法，得出了预约机制下的共乘路径最优算法CPPAO，使得该算法兼顾到达时间的准确和行驶代价的消耗。
英文摘要：
For the reason that existing carpooling path algorithms focus only on the minimum of the total weight of pathrather 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 passengerinformation 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 accuracyof arriving time and consumption of travel cost.
同期刊论文项目
同项目期刊论文
Traffic Information Collecting Algorithms for Road Selection Decision Support in Vehicle Ad Hoc Netw
Gossip Consensus Algorithm Based on Time-Varying Influence Factors and Weakly Connected Graph for Op
期刊信息
位置：