An Intersection-Movement-Based Dynamic User Optimal Route Choice Problem

• 成果类型: Article
• 署名作者: Long, Jiancheng; Huang, Hai-Jun; Gao, Ziyou; Szeto, W. Y.
• 署名单位: Hefei University of Technology; Beihang University; Beijing Jiaotong University; University of Hong Kong
• 刊物名称: OPERATIONS RESEARCH
• ISSN/ISSBN: 0030-364X
• DOI: 10.1287/opre.2013.1202
• 发表日期: 2013
• 页码: 1134-1147
• 关键词: variational inequality formulation; traffic assignment; network; MODEL; algorithm; equilibria; FLOWS

摘要

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.