首页> 外文期刊>Operations Research: The Journal of the Operations Research Society of America >An intersection-movement-based dynamic user optimal route choice problem
【24h】

An intersection-movement-based dynamic user optimal route choice problem

机译:基于交叉口运动的动态用户最优路径选择问题

获取原文
获取原文并翻译 | 示例
       

摘要

In this paper a novel variational inequality (VI) formulation of the dynamic user optimal (DUO) route choice problem is proposed using the concept of approach proportion. An approach proportion represents the proportion of travelers that select a turning or through movement when leaving a node. Approach proportions contain travelers' route information so that the realistic effects of physical queues can be captured in a formulation when a physical-queue traffic flow model is adopted, and so that route enumeration and path-set generation can be avoided in the solution procedure. In addition, the simple structure of the approach proportion representation allows us to decompose the constraint set for solving large-scale DUO route choice problems. This paper also discusses the existence and uniqueness of the solutions to the VI problem and develops a solution algorithm based on the extragradient method to solve the proposed VI problem. This solution algorithm makes use of the decomposition property of the constraint set and is convergent if the travel time functions are pseudomonotone and Lipschitz continuous. It is not necessary to know the Lipschitz constant of the travel time functions in advance. Finally, numerical examples are given to demonstrate the properties of the proposed model and the performance of the solution algorithm.
机译:本文采用进场比例的概念,提出了一种动态的用户最优(DUO)路径选择问题的变分不等式(VI)的新形式。进场比例表示离开节点时选择转弯或通过运动的旅行者比例。进近比例包含旅行者的路线信息,因此在采用物理队列交通流模型时,可以在公式中捕获物理队列的现实效果,从而可以避免求解过程中的路线枚举和路径集生成。此外,进场比例表示的简单结构使我们能够分解约束集,以解决大规模DUO路线选择问题。本文还讨论了VI问题解的存在性和唯一性,并开发了一种基于超梯度方法的求解算法来解决所提出的VI问题。如果行进时间函数是伪单调和Lipschitz连续,则该求解算法利用约束集的分解属性,并且收敛。不必事先知道旅行时间函数的Lipschitz常数。最后,通过数值例子说明了所提出模型的性质和求解算法的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号