首页> 外文会议>International Conference on Natural Computation >A genetic algorithm for multiobjective path optimisation problem
【24h】

A genetic algorithm for multiobjective path optimisation problem

机译:一种多目标路径优化问题的遗传算法

获取原文

摘要

The conventional information used to guide drivers in selecting their driving paths is the shortest-distance path (SDP). However, driver path selection is a multiple criteria decision process. This paper presents a multiobjective path optimisation (MOPO) model to make a more precise simulation of the decision-making behaviour of driver path selection. Three single-objective path optimisation (SOPO) models were taken into account to establish the MOPO model. They relate to cumulative distance (shortest-distance path), passed intersections (least-node path, LNP) and number of turns (minimum-turn path, MTP). To solve the proposed MOPO problem, a two-stage technique which incorporates a path genetic algorithm (PGA) and weight-sum method were developed. To demonstrate the advantages of the MOPO model in assisting drivers in path selection, several empirical studies were conducted using two real road networks with different roadway types and numbers of nodes and links. The experimental results demonstrate the advantage that the MOPO model provides drivers more diverse and richer information than the conventional SDP. It can be concluded that with the aids of the GIS, the optimal paths of the MOPO and SOPO problems can be easily identified by the PGA in just a matter of seconds, despite the fact that these problems are highly complex and difficult to solve manually.
机译:用于指导选择其驱动路径的驱动器的传统信息是最短距离路径(SDP)。但是,驱动程序路径选择是多标准决策过程。本文介绍了多目标路径优化(MOPO)模型,以更精确地模拟驱动路径选择的决策行为。考虑了三种单目标路径优化(SOPO)模型以建立MOPO模型。它们与累积距离(最短距离路径)相关,通过交叉口(最小节点路径,LNP)和匝数(最小转向路径,MTP)。为了解决所提出的MOPO问题,开发了一种包括路径遗传算法(PGA)和重量和方法的两级技术。为了证明MOPO模型在辅助路径选择中辅助驱动程序的优势,使用具有不同巷道类型和节点数量的实际道路网络和链路的两个真正的道路网络进行了若干实证研究。实验结果表明,MOPO模型提供了比传统SDP更多样化和更丰富的信息的驱动程序。可以得出结论,随着GIS的艾滋病,PGA可以在几秒钟内容易地识别MOPO和SOPO问题的最佳路径,尽管这些问题非常复杂并且手动难以解决。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号