首页> 外文会议>International conference on green intelligent transportation systems >The Personalized Multi-criteria Route Planning Problem in Repeated Travel and Its Solution Algorithm
【24h】

The Personalized Multi-criteria Route Planning Problem in Repeated Travel and Its Solution Algorithm

机译:重复旅行中的个性化多准则路线规划问题及其求解算法

获取原文

摘要

Existing research on the personalized multi-criteria route planning (PMRP) problem seldom considers drivers' travel characteristics for different types of travel, which significantly affects a driver's performance in reality. In this research, the PMRP problem in repeated travel is presented and defined. The relative differences between route-costs and their respective minimums are considered as the driver's route choice criteria for repeated travel. The range of each criterion value from the driver's experience data is introduced into the problem definition as the constraint. In addition, a travel-law-based route planning (TRP) algorithm is designed, implemented, and evaluated in comparison to the genetic algorithm (GA) for solving the proposed problem. The comparison results show that the TRP algorithm achieved better results in terms of running time, criteria values, and comprehensive objective function values. The experimental results also show that for the given cases, the TRP algorithm effectively avoided impractical solutions and achieved a 0.96-second average run time to reach approximate comprehensive objective function values for the routes chosen by two drivers in practice over a real-road network with 2000 nodes and 7014 edges using a PC with a 2.53-GHz-CoreTM i5-based dual-core processor.
机译:现有的关于个性化多准则路线规划(PMRP)问题的研究很少考虑驾驶员针对不同类型旅行的出行特征,这实际上影响了驾驶员的表现。在这项研究中,提出并定义了重复旅行中的PMRP问题。路线成本与其各自最小值之间的相对差异被视为驾驶员重复旅行的路线选择标准。来自驾驶员经验数据的每个标准值的范围作为约束条件引入到问题定义中。此外,与基于遗传算法(GA)的解决方案相比,设计,实施和评估了基于旅行法的路线规划(TRP)算法。比较结果表明,TRP算法在运行时间,标准值和综合目标函数值方面均取得了较好的结果。实验结果还表明,对于给定的情况,TRP算法有效地避免了不切实际的解决方案,并实现了0.96秒的平均运行时间,以达到在实际道路网络上两个驾驶员在实践中选择的路线的近似综合目标函数值使用带有基于2.53 GHz-CoreTM i5双核处理器的PC的2000个节点和7014个边缘。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号