首页> 外文会议>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秒的平均运行时间,以达到两个驱动程序在实践中使用的路线的近似综合目标函数值2000年节点和7014边缘使用具有2.53-GHz-CORETM I5的双核处理器的PC。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号