首页> 外文会议>2010 Sixth 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)模型,以对驾驶员路径选择的决策行为进行更精确的仿真。建立MOPO模型时,考虑了三个单目标路径优化(SOPO)模型。它们与累积距离(最短距离路径),经过的相交点(最小节点路径,LNP)和匝数(最小转弯路径,MTP)有关。为了解决提出的MOPO问题,开发了一种结合了路径遗传算法(PGA)和权重和方法的两阶段技术。为了展示MOPO模型在协助驾驶员选择道路方面的优势,使用两个具有不同道路类型和节点和链接数的真实道路网络进行了一些实证研究。实验结果表明,与传统的SDP相比,MOPO模型可为驾驶员提供更多样的信息和更丰富的信息。可以得出的结论是,借助GIS,PGA可以在短短几秒钟内轻松确定MOPO和SOPO问题的最佳路径,尽管这些问题非常复杂且难以手动解决。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号