Jia Hao Wu

Jia Hao Wu
W & S Solutions

About

19
Publications
2,000
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
911
Citations
Citations since 2017
1 Research Item
166 Citations
2017201820192020202120222023051015202530
2017201820192020202120222023051015202530
2017201820192020202120222023051015202530
2017201820192020202120222023051015202530
Introduction
Skills and Expertise

Publications

Publications (19)
Conference Paper
This paper mainly analyzes the present situation of domestic transit reserved lane operation with low utilizations and poor managements. Based on the practical experience of HOV and HOT lane management in U.S., we develop a concept of applying the HOV idea to relax bus reserved lane operation to a mix flow operation, which allows the HOV vehicles d...
Article
In this paper, we will first review literature of the land use and transportation interaction and then develop a new land use allocation methodology called Three Stages-Two-Feedback Method (Integration Method) for both land use allocation and the transportation policy options with a practical implementation. Then we apply this method in an urban ge...
Article
Full-text available
A transportation network plays a crucial role in delivering emergency goods to people affected by natural and man made disasters. The purpose of emergency goods transportation is to rapidly provide the appropriate emergency supplies to the disaster-struck areas. This requires a systemic coordination to prioritize the allocation of goods to desired...
Article
Full-text available
The analysis of mixed traffic, which includes both private and trucks has received more attention recently due to the rapid development of urban truck traffic in many cities and regions of the world. In this paper, we consider a multi-class network equilibrium model where several classes of traffic, with their own travel times, interact on the link...
Article
The purpose of this paper is to present two improved numerical algorithms for the continuous dynamic network loading problem. These methods, which may be considered to be event-based simulations, represent a major improvement over the functional equations approaches which was developed by Wu et al. [Transportation Research 32 (1998) 173] and the so...
Article
Full-text available
We consider a multi-class multi-mode variable demand network equilibrium model where the mode choice model is given by aggregate hierarchical logit structures and the destination choice is specified as a multi- proportional entropy type trip distribution model. The travel time of transit vehicles depends on the travel time of other vehicles using t...
Conference Paper
Full-text available
The analytical approaches to dynamic traffic assignment did not consider until now the limited capacity of arcs. In this paper a model and an algorithm are developed for this problem. The method was coded and computational results were obtained
Article
The continuous dynamic network loading problem (CDNLP) consists in determining, on a congested network, time-dependent arc volumes, together with arc and path travel times, given the time-varying path flow departue rates over a finite time horizon. This problem constitutes an intrinsic part of the dynamic traffic assignment problem. In this paper,...
Conference Paper
Full-text available
This paper provides a way to adjust some existing network models in order to take into account the spill-back of congestion. There are a number of models capable of performing Dynamic Network Loading (DNL), i.e., the reproduction of within-day variable link (or local) performances given the path flow rates, but none adequately address the problem o...
Technical Report
Full-text available
Short abstract: In this paper the problem of defining the analytical rules that govern flows at an intersection node is addressed. This problem pertains to flow based Dynamic Network Loading (DNL) models that consider the spill-back of queues. The limited resource of flow supply on the downstream links, of such a node, has to be distributed between...
Article
Full-text available
We present a framework for descent algorithms that solve the monotone variational inequality problem VIPv which consists in finding a solutionv *∈Ω v satisfyings(v *)T(v−v *)⩾0, for allv∈Ω v. This unified framework includes, as special cases, some well known iterative methods and equivalent optimization formulations. A descent method is developed f...
Article
In this paper, we present a long-step primal path-following algorithm and prove its global convergence under usual assumptions. It is seen that the short-step algorithm is a special case of the long-step algorithm for a specific selection of the parameters and the initial solution. Our theoretical result indicates that the long-step algorithm is mo...
Article
The continuous dynamic network loading problem aims to find, on a congested network, temporal arc volumes, arc travel times, and path travel times given time-dependent path flow rates for a given time period. This problem may be considered as a subproblem of a temporal (dynamic) traffic assignment problem. In this paper, we study this problem and f...
Article
Recently, several interior-point methods have been developed under a scaled Lipschitz condition which may be strong in general. In this paper, we develop a modified path-following scheme which does not require the above condition. Its global convergence is proved under only the assumptions of monotonicity and differentiability of the mapping. The s...
Article
In this paper, we first discuss the global convergence of symmetric projection methods for solving nonlinear monotone variational inequalities under a cocoercivity assumption. A similar analysis is applied to asymmetric projection methods, when the mapping is affine and monotone. Under a suitable choice of the projection matrix, decomposition can b...
Article
Full-text available
We propose a model for the transit equilibrium assignment problem (TEAP) and develop two algorithms for its solution. The behavior of the transit users is modeled by using the concept of hyperpaths (strategies) on an appropriate network (general network) which is obtained from the road network and the transit lines by a transformation which makes e...
Article
A transit equilibrium assignment problem assigns the passenger flows on to a congested transit (public transportation) network with asymmetric cost functions and a fixed origin-destination matrix. This problem which may be formulated in the space of hyperpath flows, is transformed into an equivalent problem in the space of total arc flows and an au...
Article
Sharing spatial information between a transportation planning software (like EMME/2) and a GIS (like ARC/INFO) is a complicated task, both in terms of data structure and informational needs. INRO Consultants established guidelines to standardize the creation of a transportation planning coverage and developed a set of tools to transfer information...

Network

Cited By