Abstract: Stochastic User Equilibrium (SUE) model is a widely
used traffic assignment model in transportation planning, which is
regarded more advanced than Deterministic User Equilibrium (DUE)
model. However, a problem exists that the performance of the SUE
model depends on its error term parameter. The objective of this
paper is to propose a systematic method of determining the
appropriate error term parameter value for the SUE model. First, the
significance of the parameter is explored through a numerical
example. Second, the parameter calibration method is developed
based on the Logit-based route choice model. The calibration process
is realized through multiple nonlinear regression, using sequential
quadratic programming combined with least square method. Finally,
case analysis is conducted to demonstrate the application of the
calibration process and validate the better performance of the SUE
model calibrated by the proposed method compared to the SUE
models under other parameter values and the DUE model.
Abstract: Travel demand forecasting including four travel choices, i.e., trip generation, trip distribution, modal split and traffic assignment constructs the core of transportation planning. In its current application, travel demand forecasting has associated with three important issues, i.e., interface inconsistencies among four travel choices, inefficiency of commonly used solution algorithms, and undesirable multiple path solutions. In this paper, each of the three issues is extensively elaborated. An ideal unified framework for the combined model consisting of the four travel choices and variable demand functions is also suggested. Then, a few remarks are provided in the end of the paper
Abstract: In this paper, we probe into the traffic assignment problem by the chromosome-learning-based path finding method in simulation, which is to model the driver' behavior in the with-in-a-day process. By simply making a combination and a change of the traffic route chromosomes, the driver at the intersection chooses his next route. The various crossover and mutation rules are proposed with extensive examples.
Abstract: The shortest path (SP) problem concerns with finding the shortest path from a specific origin to a specified destination in a given network while minimizing the total cost associated with the path. This problem has widespread applications. Important applications of the SP problem include vehicle routing in transportation systems particularly in the field of in-vehicle Route Guidance System (RGS) and traffic assignment problem (in transportation planning). Well known applications of evolutionary methods like Genetic Algorithms (GA), Ant Colony Optimization, Particle Swarm Optimization (PSO) have come up to solve complex optimization problems to overcome the shortcomings of existing shortest path analysis methods. It has been reported by various researchers that PSO performs better than other evolutionary optimization algorithms in terms of success rate and solution quality. Further Geographic Information Systems (GIS) have emerged as key information systems for geospatial data analysis and visualization. This research paper is focused towards the application of PSO for solving the shortest path problem between multiple points of interest (POI) based on spatial data of Allahabad City and traffic speed data collected using GPS. Geovisualization of results of analysis is carried out in GIS.