Development potential of the Northeast Passage based on a multinomial-logit-based stochastic user equilibrium model

We developed a multinomial-logit-based stochastic user equilibrium(MNL SUE)model incorporating time value of cargo to investigate future proportions of cargo flow through the Northeast Passage(NEP)and the Suez Canal Route between representative ports.We studied navigation during the ice-free and ice-covered seasons using sea ice projections for 2070 based on 1991–2021 NEP ice data.Sailing distance and time between selected ports are lower via the NEP than the Suez Canal Route.Under the scenario of year-round operation of the NEP,the proportion of cargo flow through the NEP is estimated to be 68.5%,which represents considerable commercial potential.Proportions are higher for the ice-free season and for ports at high latitudes.We also assessed flow under different scenarios.Under the scenario of fuel price increase,proportion of flow through the NEP in the ice-covered season is expected to increase.If time value is ignored,flow through the NEP is expected to increase all year round.If shippers become more cost-conscious,flow through the NEP is also expected to increase.

Sensitivity analysis for stochastic user equilibrium with elastic demand assignment model

This paper puts forward a rigorous approach for a sensitivity analysis of stochastic user equilibrium with the elastic demand （SUEED） model. First, proof is given for the existence of derivatives of output variables with respect to the perturbation parameters for the SUEED model. Then by taking advantage of the gradient-based method for sensitivity analysis of a general nonlinear program, detailed formulae are developed for calculating the derivatives of designed variables with respect to perturbation parameters at the equilibrium state of the SUEED model. This method is not only applicable for a sensitivity analysis of the logit-type SUEED problem, but also for the probit-type SUEED problem. The application of the proposed method in a numerical example shows that the proposed method can be used to approximate the equilibrium link flow solutions for both logit-type SUEED and probit-type SUEED problems when small perturbations are introduced in the input parameters.

Alpha-reliable combined mean traffic equilibrium model with stochastic travel times

Based on the reliability budget and percentile travel time(PTT) concept, a new travel time index named combined mean travel time(CMTT) under stochastic traffic network was proposed. CMTT here was defined as the convex combination of the conditional expectations of PTT-below and PTT-excess travel times. The former was designed as a risk-optimistic travel time index, and the latter was a risk-pessimistic one. Hence, CMTT was able to describe various routing risk-attitudes. The central idea of CMTT was comprehensively illustrated and the difference among the existing travel time indices was analyzed. The Wardropian combined mean traffic equilibrium(CMTE) model was formulated as a variational inequality and solved via an alternating direction algorithm nesting extra-gradient projection process. Some mathematical properties of CMTT and CMTE model were rigorously proved. Finally, a numerical example was performed to characterize the CMTE network. It is founded that that risk-pessimism is of more benefit to a modest(or low) congestion and risk network, however, it changes to be risk-optimism for a high congestion and risk network.

A mixed stochastic user equilibrium model considering influence of advanced traveller information systems in degradable transport network

Advanced traveler information systems （ATIS） can not only improve drivers＇ accessibility to the more accurate route travel time information, but also can improve drivers＇ adaptability to the stochastic network capacity degradations. In this paper, a mixed stochastic user equilibrium model was proposed to describe the interactive route choice behaviors between ATIS equipped and unequipped drivers on a degradable transport network. In the proposed model the information accessibility of equipped drivers was reflected by lower degree of uncertainty in their stochastic equilibrium flow distributions, and their behavioral adaptability was captured by multiple equilibrium behaviors over the stochastic network state set. The mixed equilibrium model was formulated as a fixed point problem defined in the mixed route flows, and its solution was achieved by executing an iterative algorithm. Numerical experiments were provided to verify the properties of the mixed network equilibrium model and the efficiency of the iterative algorithm.

Robust user equilibrium model based on cumulative prospect theory under distribution-free travel time

The assumption widely used in the user equilibrium model for stochastic network was that the probability distributions of the travel time were known explicitly by travelers. However, this distribution may be unavailable in reality. By relaxing the restrictive assumption, a robust user equilibrium model based on cumulative prospect theory under distribution-free travel time was presented. In the absence of the cumulative distribution function of the travel time, the exact cumulative prospect value(CPV) for each route cannot be obtained. However, the upper and lower bounds on the CPV can be calculated by probability inequalities.Travelers were assumed to choose the routes with the best worst-case CPVs. The proposed model was formulated as a variational inequality problem and solved via a heuristic solution algorithm. A numerical example was also provided to illustrate the application of the proposed model and the efficiency of the solution algorithm.

Supply chain network equilibrium model with capacity constraints

The supply chain network with capacity constraints of manufacturers and retailers is considered.The linkage between supply chain network equilibrium and transportation network equilibrium is investigated.By analyzing the relationships among the manufacturers,retailers and consumers in the supply chain network and their own decisions concerning maximum profits,a combined variational inequality for the supply chain network equilibrium mode is proposed.Then an equivalent supernetwork of the supply chain network is constructed by adding additional links which denote the producing of manufactures and the handling of retailers.By the supernetwork,the supply chain network equilibrium model can be reformulated as a transportation network equilibrium model.Equivalent mathematical programming is,therefore,obtained based on the principle of a Wardrop user equilibrium.The corresponding Lagrange multiplier of the capacity constraints can be explained as the extra cost of marginal production when capacity is exceeded.A numerical example is given to illustrate the rationality of the model and the validity of the results.

A self-regulating pairwise swapping algorithm to search reliability-based user equilibrium

The violation of monotonicity on reliability measures(RMs)usually makes the mathematical programming algorithms less efficient in solving the reliability-based user equilibrium(RUE)problem.The swapping algorithms provide a simple and convenient alternative to search traffic equilibrium since they are derivative-free and require weaker monotonicity.However,the existing swapping algorithms are usually based on linear swapping processes which cannot naturally avoid overswapping,and the step-size parameter update methods do not take the swapping feature into account.In this paper,we suggest a self-regulating pairwise swapping algorithm(SRPSA)to search RUE.SRPSA comprises an RM-based pairwise swapping process(RMPSP),a parameter self-diminishing operator and a termination criterion.SRPSA does not need to check the feasibility of either solutions or step-size parameter.It is suggested from the numerical analyses that SRPSA is effective and can swap to the quasi-RUE very fast.Therefore,SRPSA offers a good approach to generate initial points for those superior local search algorithms.

Cumulative prospect theory-based user equilibrium model with stochastic perception errors

The cumulative prospect theory(CPT) is applied to study travelers' route choice behavior in a degradable transport network. A cumulative prospect theory-based user equilibrium(CPT-UE) model considering stochastic perception error(SPE) within travelers' route choice decision process is developed. The SPE is conditionally dependent on the actual travel time distribution, which is different from the deterministic perception error used in the traditional logit-based stochastic user equilibrium. The CPT-UE model is formulated as a variational inequality problem and solved by a heuristic solution algorithm. Numerical examples are provided to illustrate the application of the proposed model and efficiency of the solution algorithm. The effects of SPE on the reference point determination, cumulative prospect value estimation, route choice decision and network performance evaluation are investigated.

A stochastic user equilibrium model solving overlapping path and perfectly rational issues

Traffic assignment has been recognized as one of the key technologies in supporting transportation planning and operations.To better address the perfectly rational issue of the expected utility theory(EUT)and the overlapping path issue of the multinomial logit(MNL)model that are involved in the traffic assignment process,this paper proposes a cumulative prospect value(CPV)-based generalized nested logit(GNL)stochastic user equilibrium(SUE)model.The proposed model uses CPV to replace the utility value as the path performance within the GNL model framework.An equivalent mathematical model is provided for the proposed CPV-based GNL SUE model,which is solved by the method of successive averages(MSA).The existence and equivalence of the solution are also proved for the equivalent model.To demonstrate the performance of the proposed CPV-based GNL SUE model,three road networks are selected in the empirical test.The results show that the proposed model can jointly deal with the perfectly rational issue and the overlapping path issue,and additionally,the proposed model is shown to be applicable for large road networks.

Modified origin-based algorithm for traffic equilibrium assignment problems

Key tactics of origin-based user equilibrium (OUE) algorithm was studied,which involved the algorithm procedure and several implementation issues.To speed up the convergence,update policies of flows,costs and bushes were proposed.The methods of step-size searching and bush construction are proved to be practical.The modified OUE algorithm procedure was also optimized to take the advantage of multi-thread process.Convergence performances were compared with those of other algorithms by different sizes of urban transportation networks.The result shows this modified OUE algorithm is more efficient and consumes less time to achieve the reasonable relative gap in practical applications.

Generalized nested logit-based stochasticuser equilibrium model with distance constraint of electric vehicles

Considering the range anxiety issue caused by the limited driving range and the scarcity of battery charging stations,the conventional multinomial logit(MNL)model with the overlapping path issue was used in route choice modeling to describe the route choice behavior of travelers effectively.Furthermore,the generalized nested logit-based stochastic user equilibrium(GNL-SUE)model with the constraints of multiple user classes and distance limits was proposed.A mathematical model was developed and solved by the method of successive averages.The mathematical model was proven to be analytically equivalent to the modified GNL-SUE model,and the uniqueness of the solution was also confirmed.The proposed mathematical model was tested and compared with the GNL-SUE model without a distance limit and the MNL-SUE model with a distance limit.Results show that the proposed mathematical model can effectively handle the range anxiety and overlapping path challenges.

A Discrete-Time Stochastic Traffic Assignment Model

A discrete time stochastic traffic assignment model is proposed. The model provides a discrete time description of the variations of flows on a road network during a day or a peak period. The congestion effect at links and link junctions are taken into account. The first in first out principle is enforced on all links at all periods of the day. A stochastic user equilibrium assignment is achieved when the tripmaker is unable to find better travel alternatives. A computational procedure is also presented.

Traffic assignment problem under tradable credit scheme in a bi-modal stochastic transportation network: A cumulative prospect theory approach

The traffic equilibrium assignment problem under tradable credit scheme(TCS) in a bi-modal stochastic transportation network is investigated in this paper. To describe traveler’s risk-taking behaviors under uncertainty, the cumulative prospect theory(CPT) is adopted. Travelers are assumed to choose the paths with the minimum perceived generalized path costs, consisting of time prospect value(PV) and monetary cost. At equilibrium with a given TCS, the endogenous reference points and credit price remain constant, and are consistent with the equilibrium flow pattern and the corresponding travel time distributions of road sub-network. To describe such an equilibrium state, the CPT-based stochastic user equilibrium(SUE) conditions can be formulated under TCS. An equivalent variational inequality(VI) model embedding a parameterized fixed point(FP) model is then established, with its properties analyzed theoretically. A heuristic solution algorithm is developed to solve the model, which contains two-layer iterations. The outer iteration is a bisection-based contraction method to find the equilibrium credit price, and the inner iteration is essentially the method of successive averages(MSA) to determine the corresponding CPT-based SUE network flow pattern. Numerical experiments are provided to validate the model and algorithm.

Dynamical evolution processes of traffic flow and travel cost in urban transportation networks

Considering such a fact that travellers dynamically adjust their routes and the resultant link traffic flows in a network evolve over time, this paper proposes a dynamical evolutionary model of the traffic assignment problem with endogenous origin-destination （OD） demands. The model＇s stability is analysed and the resultant user equilibrium （UE） state is shown to be stable under certain conditions. Numerical results in a grid network indicate that the model can generate convergent flow patterns and finally terminates at the UE state. Impacts by the parameters associated with OD demand function and link cost function are also investigated.

Effect of Transit Capacity onto Morning Commute Problem with Competitive Modes and Distributed Demand

A lane exclusively for transit is one measure to reduce urban congestion and intelligent transportation systems (ITSs) are expected to make this policy more effective. However, the advantage may be limited if a transit agency does not provide sufficient vehicles. This study evaluates the effect of transit capacity on a dedicated transit lane policy by examining the morning commute problem, by defining user equilibrium and system optimisation considering transit capacity. It was confirmed that reduced transit capacity under user equilibrium smoothly increases the transit cost per person, which decreases the duration period of the dedicated transit lane and increases the number of early and delayed car commuters. However, the effect of reducing transit capacity under a system optimum depends on the initial solution of the system optimum.

Reliability analysis of stochastic park-and-ride network

Park-and-ride （P＆R） facilities can alleviate the traffic burden in central urban areas by enabling car drivers to park at the perimeter of congested areas and continue their journeys with public transportation （e.g., metro and bus rapid transit）. Whether a P＆R scheme is successful depends on its attractiveness to car users. This paper presents anevaluation method for the reliability analysis of P＆R mode. Two indices, P＆R reliability and mode reliability, are in- troduced to represent the reliabilities of a transfer point and an entire trip, respectively. Then, a systematic reliability analysis is conducted for a stochastic P＆R network, where travelers can complete their journeys via two options： auto mode or P＆R mode. A variational inequality （VI） model is proposed and solved by a heuristic solution algorithm. Nu- merical results show that the P＆R facility reliability is significantly influenced by the capacity of parking facilities, the dispatching frequency of the connecting metro, and the metro fare. In addition, a higher level of total demand in the network has significant negative impacts on P＆R mode＇s attractiveness compared to auto mode.

Bounding the Inefficiency of the C-Logit Stochastic User Equilibrium Assignment

Compared with standard logit-based stochastic user equilibrium assignment model,the C-logit model describes route choice behavior in a more realistic way by considering the overlapping effect between routes.This paper investigates the inefficiency upper bounds of this model against the deterministic system optimum and the C-logit stochastic system optimum in terms of the total network travel time.It is found that the commonality factor of overlapping routes significantly affects the inefficiency bound,besides link congestion degree,total demand and the number of feasible routes.If the commonality factor is not considered,the efficiency loss resulting from selfishly stochastic travel behavior will be to large extent underestimated.

Stochastic Route Choice Equilibrium Assignment for Travelers with Heterogeneous Regret Aversions

Most route choice models assume that people are completely rational.Recently,regret theory has attracted researchers'attentions because of its power to depict real travel behavior.This paper proposes a multiclass stochastic user equilibrium assignment model by using regret theory.All users are differentiated by their own regret aversion.The route travel disutility for users of each class is defined as a linear combination of the travel time and anticipated regret.The proposed model is formulated as a variational inequality problem and solved by using the self-regulated averaging method.The numerical results show that users'regret aversion indeed influences their route choice behavior and that users with high regret aversion are more inclined to change route choice when the traffic congestion degree varies.

Implementation of a new network equilibrium model of travel choices

This paper develops a new combined network equilibrium model by using more behaviorally sound mathematical forms to represent the four travel choices（i.e., trip frequency,destination, mode, and route） in a conventional travel demand forecasting process. Trip frequency choice relates to the traveler decision on “making a trip” or “not making a trip”so it is given by a binary logit model. Destination choice is formulated as a parameterized dogit model of which the captivity parameters（expressed as functions of independent variables） allow individual travelers to be captive to specific destinations. Mode choice is given by a two-level nested logit model to avoid IIA restriction. Trip assignment is based on Wardrop＇s “user-optimized” principle. All model forms describing travel choices are in response to the level of services incurred by the transportation system. Through the introduction of inclusive values, the traveler decisions concerning trip frequency, destination, mode, and route choices are inherently interrelated and jointly determined.To obtain solutions of the new combined model, it was reformulated as an equivalent convex programming problem with linear constraints, a great advantage from the computational aspects. The model was applied empirically to a transportation network in New Jersey. The application results show that the new model is consistently better than the commonly used logit combined model in reproducing the observed trip flows from origin zones, origin to destination（O-D） trip flows, O-D trip flows by mode, and trip flows on the network links.

Research on passenger flow control at metro transfer stations based on real-time flow calculation of streamlines

Purpose – The volume of passenger traffic at metro transfer stations serves as a pivotal metric for theorchestration of crowd flow management. Given the intricacies of crowd dynamics within these stations andthe recurrent instances of substantial passenger influxes, a methodology predicated on stochastic processesand the principle of user equilibrium is introduced to facilitate real-time traffic flow estimation within transferstation streamlines.Design/methodology/approach – The synthesis of stochastic process theory with streamline analysisengenders a probabilistic model of intra-station pedestrian traffic dynamics. Leveraging real-time passengerflow data procured from monitoring systems within the transfer station, a gradient descent optimizationtechnique is employed to minimize the cost function, thereby deducing the dynamic distribution of categorizedpassenger flows. Subsequently, adhering to the tenets of user equilibrium, the Frank–Wolfe algorithm isimplemented to allocate the intra-station categorized passenger flows across various streamlines, ascertainingthe traffic volume for each.Findings – Utilizing the Xiaozhai Station of the Xi’an Metro as a case study, the Anylogic simulation softwareis engaged to emulate the intra-station crowd dynamics, thereby substantiating the efficacy of the proposedpassenger flow estimation model. The derived solutions are instrumental in formulating a crowd controlstrategy for Xiaozhai Station during the peak interval from 17:30 to 18:00 on a designated day, yielding crowdmanagement interventions that offer insights for the orchestration of passenger flow and operationalgovernance within metro stations.Originality/value – The construction of an estimation methodology for the real-time streamline traffic flowaugments the model’s dataset, supplanting estimated values derived from surveys or historical datasets withreal-time computed traffic data, thereby enhancing the precision and immediacy of crowd flow managementwithin metro stations.