A Multiclass Cumulative Prospect Theory-Based Stochastic User Equilibrium Model with Path Constraints in Degradable Transport Networks

The limited driving range and the unavailability or insufficiency of battery charging/swapping stations cause the so-called range anxiety issue for traffic assignment involving battery electric vehicle (BEV) users. In addition, expected utility theory-based stochastic user equilibrium (EUT-SUE) model generates the perfectly rational issue when the travellers make route choice decisions. To tackle these two problems, this article improves the cumulative prospect theory-based stochastic user equilibrium (CPT-SUE) model in a degradable transport network through incorporating the constraints of multiple user classes and distance limit. In this degradable network, the travellers experience stochastic travel times due to network link capacity degradations. For this improved CPT-SUE model, the equivalent variational inequality (VI) model and associated method of successive averages (MSA) based solution are provided. The improved CPT-SUE model is tested and compared with the EUT-SUE model with distance limit, with results showing that the improved CPT-SUE model can handle jointly the range anxiety issue and the perfectly rational issue.

A Stochastic User Equilibrium Formulation for the Cumulative Prospect Theory-Based Cross-Nested Logit

The cumulative prospect theory provides a better description for route choice behavior of the travelers in an uncertain road network environment. In this study, we proposed a multiclass cumulative prospect value- (CPV-) based cross-nested logit (CNL) stochastic user equilibrium (SUE) model. For this model, an equivalent variational inequality (VI) model is provided, and the existence and equivalence of the model solutions are also proved. The method of successive averages (MSA), method of successive weighted averages (MSWA), and self-regulated averaging (SRA) method are designed and compared. In addition, the proposed multiclass CPV-based CNL SUE model is also compared with the multiclass utility value- (UV-) based CNL SUE model. The results show that the path flow assigned by the multiclass CPV-based CNL SUE model is more consistent with the actual situation. The impact of different model parameters on the cumulative prospect value (CPV) is investigated.

A Methodology for Increasing Convergence Speed of Traffic Assignment Algorithms Based on the Use of a Generalised Averaging Function

In this paper, we propose a generalisation of the Method of Successive Averages (MSA) for solving traffic assignment problems. The generalisation consists in proposing a different step sequence within the general MSA framework to reduce computing times. The proposed step sequence is based on the modification of the classic 1/k sequence for improving the convergence speed of the algorithm. The reduction in computing times is useful if the assignment problems are subroutines of algorithms for solving Network Design Problems—such algorithms require estimation of the equilibrium traffic flows at each iteration, hence, many thousands of times for real-scale cases. The proposed algorithm is tested with different parameter values and compared with the classic MSA algorithm on a small and on two real-scale networks. A test inside a Network Design Problem is also reported. Numerical results show that the proposed algorithm outperforms the classic MSA with reductions in computing times, reaching up to 79%. Finally, the theoretical properties are studied for stating the convergence of the proposed algorithm.

Evaluation of Traffic Assignment Models through Simulation

Assignment methodologies attempt to determine the traffic flow over each network arc based on its characteristics and the total flow over the entire area. There are several methodologies—some fast and others that are more complex and require more time to complete the calculation. In this study, we evaluated different assignment methodologies using a computer simulation and tested the results in a specific case study. The results showed that the “all-or-nothing” methods and the incremental assignment methods generally yield results with an unacceptable level of error unless the traffic is divided into four or more equal parts. The method of successive averages (MSA) was valid starting from a relatively low number of iterations, while the user equilibrium methodologies (approximated using the Frank and Wolfe algorithm) were valid starting from an even lower number of iterations. These results may be useful to researchers in the field of computer simulation and planners who apply these methodologies in similar cases.

Multimodal Green Logistics Network Design of Urban Agglomeration with Stochastic Demand

This study investigates a multimodal green logistics network design problem of urban agglomeration with stochastic demand, in which different logistics authorities among the different cities jointly optimize the logistics node configurations and uniform carbon taxes over logistics transport modes to maximize the total social welfare of urban agglomeration and consider logistics users’ choice behaviors. The users’ choice behaviors are captured by a logit-based stochastic equilibrium model. To describe the game behaviors of logistics authorities in urban agglomeration, the problem is formulated as two nonlinear bilevel programming models, namely, independent and centralized decision models. Next, a quantum-behaved particle swarm optimization (QPSO) embedded with a Method of Successive Averages (MSA) is presented to solve the proposed models. Simulation results show that to achieve the overall optimization layout of the green logistics network in urban agglomeration the logistics authorities should adopt centralized decisions, construct a multimode logistics network, and make a reasonable carbon tax.

Unified Framework for Optimal Routing Choice under Guidance Information

In order to satisfy the diverse demand of travel service in the context of big data, this paper puts forward a unified framework for optimal routing choice under guidance information. With consideration of the influence of big data, the scenario analysis of routing choice is implemented, and the routing choice under guidance information is discussed. The optimal routing choice problem is abstracted into the collaboration optimization model of travel route choice, departure time choice, and travel mode choice. Based on some basic assumptions, the collaboration optimization model is formulated as a variational inequality model. The method of successive averages is applied to solve the proposed model. A case study is carried out to verify the applicability and reliability of the model and algorithm.