• Journal of Korean Society of Transportation
• /
• v.22 no.5
• /
• pp.123-137
• /
• 2004

The study on traffic assignment is actively being performed which reflect networks status using time. Its background is increasing social needs to use traffic assignment models in not only hardware area of road network plan but also software area of traffic management or control. In addition, multi-class traffic assignment model is receiving study in order to fill a gap between theory and practice of traffic assignment model. This model is made up of two, one of which is multi-driver class and the other multi-vehicle class. The latter is the more realistic because it can be combined with dynamic model. On this background, this study is to build multidynamic model combining the above-mentioned two areas. This has been a theoretic pillar of ITS in which dynamic user equilibrium assignment model is now made an issue, therefore more realistic dynamic model is expected to be built by combining it with multi-class model. In case of multi-vehicle, FIFO would be violated which is necessary to build the dynamic assignment model. This means that it is impossible to build multi-vehicle dynamic model with the existing dynamic assignment modelling method built under the conditions of FIFO. This study builds dynamic network model which could relieve the FIFO conditions. At the same time, simulation method, one of the existing network loading method, is modified to be applied to this study. Also, as a solution(algorithm) area, time dependent shortest path algorithm which has been modified from existing shortest path algorithm and the existing MSA modified algorithm are built. The convergence of the algorithm is examined which is built by calculating dynamic user equilibrium solution adopting the model and algorithm and grid network.

• Journal of Korean Society of Transportation
• /
• v.26 no.4
• /
• pp.205-215
• /
• 2008

As static traffic assignment has reached its limitation with ITS policy applications and due to the increase of interest in studies of ITS policies since the late 1980's, dynamic traffic assignment has been considered a tool to overcome such limitations. This study used the Dynameq program, which simulates route choice behavior by macroscopic modeling and dynamic network loading and traffic flow by microscopic modeling in consideration of the feasibility of the analysis of practical traffic policy. The essence of this study is to evaluate the feasibility for analysis in practical transportation policy of using the dynamic traffic assignment technique. The study involves the verification of the values estimated from the dynamic traffic assignment with South Korea's expressway network and dynamic O/D data by comparing results with observed link traffic volumes. This study used dynamic O/D data between each toll booth, which can be accurately obtained from the highway Toll Collection System. Then, as an example of its application, exclusive bus-lane policies were analyzed with the dynamic traffic assignment model while considering hourly variations.

• Journal of Korean Society of Transportation
• /
• v.17 no.4
• /
• pp.71-84
• /
• 1999

The purpose of this study is to construct a dynamic traffic analysis model using the existing traffic flow theory in order to develope a dynamic traffic assignment technique. In this study the dynamic traffic analysis model was constructed using Daganzo's CELL TRANSMISSION THEORY which was considered more suitable to dynamic traffic assignment than the other traffic flow theories. We developed newly the diverging split module, the cost update module and the link cost function and defined the maximum waiting time decision function that Daganzo haven't defined certainly at his Papers. The output that resulted from the simulation of the dynamic traffic analysis model with test network I and II was shown at some tables and figures, and the analysis of the bottleneck and the HOV lane theory showed realistic outputs. Especially, the result of traffic assignment using the model doesn't show equilibrium status every time slice but showed that the average travel cost of every path maintains similarly in every time slice. It is considered that this model can be used at the highway operation and the analysis of traffic characteristics at a diverging section and the analysis of the HOV lane effect.

• Journal of Korean Society of Transportation
• /
• v.11 no.1
• /
• pp.67-86
• /
• 1993

A formulation of dynamic traffic assignment between multiple origins and single destination was first introduced in 1987 by Merchant and Nemhauser, and then expanded for multiple destination in the late 1980's (Carey, 1987). Based on behavioral choice theory which provides proper demand elasticities with respect to changes in policy variables, traffic phenomena can be analysed more realistically, especially in peak periods. However, algorithms for these models are not well developed so far(working with only small toy network) and solutions of these models are not unique. In this paper, a new model is developed which keeps the simplicity of static models, but provides the sensitivity of dynamic models with changes of O-D flows over time. It can be viewed as a joint departure time and route choice model, in the given time periods(6-7, 7-8, 8-9 and 9-10 am). Standard multinomial logit model has been used for simulating the choice behavior of destination, mode, route and departure time within a framework of the incremental network assignment model. The model developed is workable in a PC 386 with 175 traffic zones and 3581 links of Seoul and tested for evaluating the exclusive use of Namsan tunnel for HOV and the left-turn prohibition. Model's performance results and their statistical significance are also presented.

• Journal of Intelligence and Information Systems
• /
• v.6 no.1
• /
• pp.113-128
• /
• 2000

This paper presents a first year report of an ongoing multi-year project to develop a systolic parallel simulation system for dynamic traffic assignment. The fundamental approach to the simulation is systolic parallel processing based on autonomous agent modeling. Agents continuously act on their own initiatives and access to database to get the status of the simulation world. Various agents are defined in order to populate the simulation world. In particular existing modls and algorithm were incorporated in designing the behavior of relevant agents such as car-following model headway distribution Frank-Wolf algorithm and so on. Simulation is based on predetermined routes between centroids that are computed off-line by a conventional optimal path-finding algorithm. Iterating the cycles of optimization-then-simulation the proposed system will provide a realistic and valuable traffic assignment. Gangnum-Gu district in Seoul is selected for the target are for the modeling. It is expected that realtime traffic assignment services can be provided on the internet within 3 years.

• Journal of Korean Society of Transportation
• /
• v.24 no.2 s.88
• /
• pp.169-178
• /
• 2006

Traffic assignment has been used both for predicting travel demands and for evaluating the tools for alleviating congestion on road network in advance. Some assignment models have been proposed such as equivalent mathematical minimization method, variational inequality problem, nonlinear complementary problem and fixed point method, in following the principle of Wardrop (1952) that no driver can not Improve his travel cost by unilaterally changing his route. Recently Jin(2005a) presented a traffic assignment model based on dynamic process. This paper proposes a solution algorithm for the model of Jin and assesses the performances. Compared to the Frank-Wolfe method, which has been wildly used for solving the existing assignment models, the proposed algorithm is expected to be more efficient because it does not need to evaluate the objective function. Two numerical examples are used for assessing the algorithm, and they show that the algorithm converges to user equilibrium of Wardrop.

• Journal of Korea Multimedia Society
• /
• v.12 no.6
• /
• pp.824-832
• /
• 2009

Multi-radio multi-channel Wireless Mesh Network requires an effective management policy to control the assignment of channels to each radio. We concentrated our investigation on modeling method and solution to find a dynamic channel assignment scheme that is adapted to change of network traffic. Multi-path routing scheme was chosen to overwhelm the unreliability of wireless link. For a particular traffic state, our optimization model found a specific traffic distribution over multi-path and a channel assignment scheme that maximizes the overall network throughput. We developed a simple heuristic method for channel assignment by gradually removing clique load to obtain higher throughput. We also presented numerical examples and discussion of our models in comparison with existing research.

• Journal of Korean Society of Transportation
• /
• v.19 no.4
• /
• pp.97-108
• /
• 2001

A dynamic transportation management should be applied specially in AM peak because AM peak is more critical than PM peak in traffic volume and demand. AM peak trip can be characterized by commuting and schooling. which have the high level of usage on public transportation, and constraint on arrival time. So transportation management applied in AM peak could deal with a mode choice and an arrival time constrain. Researchers were involved in the dynamic transportation assignment models for management of congested traffic network. But, there were no models which considered a mode choice and an arrival time constrain should be included in management of AM peak. So there are limits to use exist models to control and analyze AM peak traffic. In this study, it is proposed the combined dynamic transportation model, considering a mode choice and the start time selection with arrival time constrains, based on Ran and Boyce's model. The proposed model is verified the compatibility by applying to the newly designed time space expanded network. The result shows that proposed model consistent with dynamic user optimal travel pattern. From this we certificate the applicability of the proposed model to control and analyze AM peak traffic.

• Journal of Korean Society of Transportation
• /
• v.25 no.4
• /
• pp.99-108
• /
• 2007

This paper presents an elastic demand stochastic user equilibrium traffic assignment that could not be easily tackled. The elastic demand coupled with a travel performance function is known to converge to a supply-demand equilibrium, where a stochastic user equilibrium (SUE) is obtained. SUE is the state in which all equivalent path costs are equal, and thus no user can reduce his perceived travel cost. The elastic demand SUE traffic assignment can be formulated based on a dynamic system, which is a means of describing how one state develops into another state over the course of time. Traditionally it has been used for control engineering, but it is also useful for transportation problems in that it can describe time-variant traffic movements. Through the Lyapunov Function Theorem, the author proves that the model has a stable solution and confirms it with a numerical example.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1405-1412
• /
• 2000

In this paper, we propose an efficient dynamic wavelength assignment algorithm in distributed WDM (Wavelength-Division Multiplexing) networks without wavelength conversion. The algorithm tries to assign a locally-most-used wavelength distributedly on a fixed routing path. We first formulate our algorithm by using the concept of a sample space which consists of optical fibers connected to nodes on a routing path of a lightpath to be assigned a wavelength. In particular, we analyze the blocking performance mathematically as compared with that of the most-used (MU) wavelength assignment algorithm previously proposed for WDM networks under centralized control. We also obtain numerical results by simulation on the blocking performance of other centralized/distributed wavelength assignment algorithms as well as our algorithm using the M/M/c/c dynamic traffic model. Consequently, we show that analytical results match simulation results and that our algorithm is efficient in distributed WDM networks in terms of blocking performance, control traffic overhead and computation complexity.