HRHualing Ren

Hualing Ren

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Hualing Ren has a total of 23 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Dynamic User Equilibrium for Electric Vehicle Departure Time and Path–Charging Choices with Wireless and Fast Charging Services

    by Xiao Zhang, Hualing Ren

    This study investigates how coordinated wireless and fast charging services reshape electric vehicle departure time and path–charging choices when a trip-level charging requirement must be completed before arrival. A multi-class dynamic user equilibrium model is formulated for road networks containing wireless charging lanes and fast charging stations. An energy-aware dynamic network loading model propagates traffic and battery states, transfers upstream wireless energy into the residual station workload, and determines endogenous waiting. The equilibrium is expressed as a finite-dimensional variational inequality and solved by an energy-aware inertial fixed-point framework with safeguarded route swapping and independent verification. Experiments on the Nguyen–Dupuis and Sioux Falls networks show that low-state-of-charge users depart 6.91 min earlier on average, while exposure-informed wireless-charging placement can substantially reduce downstream station waiting and exhibits saturation once all behaviorally exposed links are active. Under compound demand and low-state-of-charge pressure, roadway queues activate more sharply than station waiting. In a common Sioux Falls algorithm benchmark, the inertial method reaches stable acceptance in 776.2 s compared with 1562.9 s for its non-inertial counterpart. The method of successive averages crosses the practical gap threshold earlier but does not satisfy the common flow-stability criterion within 3000 updates and 9018.1 s. Across 30 final Sioux Falls scenarios, all solutions satisfy the practical verified gap and physical feasibility gates, with 11 difficult cases requiring explicit route-swap continuation. The results clarify the complementary operational roles of corridor and station charging while delimiting the numerical and behavioral assumptions of the framework.

  • Open Access

    Construction of a novel emission trading scheme in bi-modal networks: A bi-level programming model

    by Wenyi Zhang, Hualing Ren, Yue Bao, Zaihan Gao, Zi-You Gao

    In the usual emission trading scheme involving the government and travelers, the travelers' travel choices are complicated, involving usage and trade of permits as well as mode and route choices. This paper constructs an efficient and stable emission trading scheme based on a dual-market mechanism involving the government and petroleum companies to reduce the difficulties associated with travel choices and trade of emission permits of all travelers. In the primary market, eligible companies apply for carbon emission permits in a paid way; the secondary market is established among companies for freely trading permit. Travelers solely choose travel modes and routes and pay for fuel consumption costs based on traffic petrol prices to complete their trips in a bi-modal network including private car and customized bus modes. The market trading processes and travel choice behaviors are formulated in a bi-level programming model: the upper level describes the trade behaviors of companies to maximize their profits, while the lower level obtains the link flow patterns by solving a bi-modal user equilibrium problem. A relaxation algorithm with multi-round iteration strategy is developed to efficiently solve the problem where a relaxation algorithm solves the bi-level model with a fixed number of permits in the inner loop and a multi-round iteration strategy reduces permit volumes in the outer loop. Numerical experiments are conducted on the Braess and Sioux Falls networks to verify the effectiveness of the proposed emission trading scheme in simplifying travel choices and model formulation. The results also reveal some insights into the oil pricing of petroleum companies.

  • Open Access

    Two-Step Optimization of Urban Rail Transit Marshalling and Real-Time Station Control at a Comprehensive Transportation Hub

    by Hualing Ren, Yingjie Song, Shubin Li, Zhiheng Dong

    Urban rail transit connecting with a comprehensive transportation hub should meet passenger demands not only within the urban area, but also from outer areas through high-speed railways or planes, which leads to different characteristics of passenger demands. This paper discusses two strategies to deal with these complex passenger demands from two aspects: transit train formation and real-time holding control. First, we establish a model to optimize the multi-marshalling problem by minimizing the trains’ vacant capacities to cope with the fluctuation of demand in different periods. Then, we establish another model to control the multi-marshalling trains in real time to minimize the passengers’ total waiting time. A genetic algorithm (GA) is designed to solve the integrated two-step model of optimizing the number, timetable and real-time holding control of the multi-marshalling trains. The numerical results show that the combined two-step model of multi-marshalling operation and holding control at stations can better deal with the demand fluctuation of urban rail transit connecting with the comprehensive transportation hub. This method can efficiently reduce the number of passengers detained at the hub station as well as the waiting time without increasing the passengers’ on-train time even with highly fluctuating passenger flow.


  • Open Access

    Variable Speed Limit Strategies Based on the Macro Hierarchical Control Traffic Flow Model

    by Shubin Li, Tao Wang, Hualing Ren, Baiying Shi, Xiangke Kong, Jianyong Chai, Xuejuan Wang

    The superior traffic control system can promote the efficiency of mainstream expressway. As the effective method to smooth traffic system, the variable speed limits (VSL) strategies are discussed in an expressway traffic network. The dynamic OD estimation model is used to produce the real traffic information, which is loaded to the traffic network. Then, the prediction information of traffic variables and the VSL strategy are introduced to macro hierarchical control traffic flow model. A solution algorithm is further developed to find the optimal parameters of VSL by minimizing the total travel time and delay. The simulation results show that the proposed strategy perfects well, the traffic congestion is effectively alleviated, and the traffic efficiency of the road section is significantly improved. This framework can be adopted by transit managers for traffic efficiency.


  • Open Access

    Optimization Model and Method of Variable Speed Limit for Urban Expressway

    by Shubin Li, Tao Wang, Hualing Ren, Baiying Shi, Xiangke Kong

    The urban expressway network is the main part of the urban traffic network carrying most of the city’s traffic pressure for its continuity and rapidity, but the control method of the traffic flow was too simple to other control methods in application in addition to the ramp control and the fixed speed control. In this paper, the theory of variable speed limit (VSL) was used to develop an optimal control model based on the improved traffic flow simulation model according to the characteristics of urban expressway traffic flow. The objective of the proposed model is to minimize the delay and maximize the traffic flow. It can adjust the traffic flow on the network in space time so that the whole network is in a state of equilibrium which not only is conducive to the control of the local traffic congestion and avoids the spread of congestion but also improves the traffic safety. The SPSA-based solution algorithm was proposed by taking into account the needs of real-time online applications. It can not only ensure the accuracy of the solution but also meet the requirements of the simulation time. The simulation results show that the variable speed limit can be optimized in moderate demand, and the proposed model and algorithm are effective and feasible in this paper. The conclusions are useful to help the traffic management department to formulate reasonable traffic control strategies.


  • Open Access

    Distributed Newton Methods for Strictly Convex Consensus Optimization Problems in Multi-Agent Networks

    by Dong Wang, Hualing Ren, Fubo Shao

    Various distributed optimization methods have been developed for consensus optimization problems in multi-agent networks. Most of these methods only use gradient or subgradient information of the objective functions, which suffer from slow convergence rate. Recently, a distributed Newton method whose appeal stems from the use of second-order information and its fast convergence rate has been devised for the network utility maximization (NUM) problem. This paper contributes to this method by adjusting it to a special kind of consensus optimization problem in two different multi-agent networks. For networks with Hamilton path, the distributed Newton method is modified by exploiting a novel matrix splitting techniques. For general connected multi-agent networks, the algorithm is trimmed by combining the matrix splitting technique and the spanning tree for this consensus optimization problems. The convergence analyses show that both modified distributed Newton methods enable the nodes across the network to achieve a global optimal solution in a distributed manner. Finally, the distributed Newton method is applied to solve a problem which is motivated by the Kuramoto model of coupled nonlinear oscillators and the numerical results illustrate the performance of the proposed algorithm.


  • A single-step-toll equilibrium for the bottleneck model with dropped capacity

    by Hualing Ren, Ying Xue, Jiancheng Long, Ziyou Gao

    The optimal time-varying tolling is cumbersome for practical implementation due to the incomplete knowledge of toll determination and high costs for toll collection. Alternatively, a step toll is easier to implement than an optimal time-varying toll and could have lower operation costs and has been developed to reduce queuing time. In this paper, it is assumed that some drivers are willing to brake, while other drivers may pass the bottleneck near the end of the tolling period, and the braking drivers queue on the lanes and can impede other drivers. Two novel single-step-toll equilibrium models are developed with consideration of dropped capacity due to lanes occupied by the brakers. We found that some existing step-toll models are special cases of the proposed models. The toll level is further optimised to minimise either the maximal queue length or the total social cost. Finally, a numerical example is developed to illustrate the effect of the optimised toll on system performance.


  • Passenger Assignment Model Based on Common Route in Congested Transit Networks

    by Hualing Ren, Jiancheng Long, Ziyou Gao, Penina Orenstein

    In this paper, the common line problem and passengers’ choice behaviors in transit networks are revisited and discussed. The concept of the common line problem is extended to represent a common route problem in transit networks. The transit routes are classified into various levels of attractive route sets according to route fixed costs and route frequencies. The transit passenger assignment problem on congested transit networks is defined to assign passenger flows on attractive route sets and is formulated as a variational inequality (VI) problem. In the proposed model, the effective frequency approach is applied to reflect the effects of passenger congestion on the waiting time at the stations. Compared with traditional models, the proposed passenger flow assignment model does not require a modification to the transit network nor a constant recomputation of the changing attractive line set. Finally, a simple example is used to illustrate the difference between common line and common route method...