scholarly journals Evaluation of Traffic Assignment Models through Simulation

2020 ◽  
Vol 12 (14) ◽  
pp. 5536 ◽  
Author(s):  
Marta Rojo
Keyword(s):  
Computer Simulation ◽  
Traffic Flow ◽  
User Equilibrium ◽  
Lower Number ◽  
Total Flow ◽  
Entire Area ◽  
Method Of Successive Averages ◽  
Assignment Models ◽  
Number Of Iterations

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.

Merging transit schedule information with a planning network to perform dynamic multimodal assignment: lessons from a case study of the Greater Toronto and Hamilton Area

2014 ◽  
Vol 41 (10) ◽  
pp. 900-908
Author(s):  
Adam Weiss ◽  
Mohamed S. Mahmoud ◽  
Peter Kucirek ◽  
Khandker Nurul Habib
Keyword(s):  
Single Mode ◽  
User Equilibrium ◽  
Wide Spread ◽  
Complex Dynamic ◽  
Complex Models ◽  
Overall Performance ◽  
Using Data ◽  
Assignment Models ◽  
Transit Schedule

Traffic assignment has traditionally been performed using aggregate static user equilibrium approaches for a single mode. These approaches are typically favoured over more complex dynamic multimodal micro and meso-simulated models. Investigations into dynamic multimodal assignment models have shown promise, prompting interest in the adoption of complex modelling structures. The development and operation of these complex models can still be problematic, highlighting the need for efficient approaches to allow practitioners to acquire and apply these models. This paper presents a method to modify existing static auto assignment networks for dynamic multimodal assignment. To complement this, a method, which improves the overall performance of the transit routing procedure used within many assignment models, is presented. These methods were tested using data from the Greater Toronto and Hamilton Area, and result in an assignment procedure with reasonable run time and results, suggesting potential for wide spread adoption of these approaches.

Traffic Flow Management Impact on Delay and Fuel Consumption: an Atlanta Case Study

2012 ◽  
Vol 20 (3) ◽  
pp. 203-224 ◽  
Author(s):  
Shon R. Grabbe ◽  
Banavar Sridhar ◽  
Avijit Mukherjee ◽  
Alexander Morando
Keyword(s):  
Fuel Consumption ◽  
Traffic Flow ◽  
Flow Management ◽  
Traffic Flow Management

scholarly journals A Traffic Flow Evolution Process toward Mixed Equilibrium with Multicriteria of Route Choice Behaviour

2020 ◽  
Vol 2020 ◽  
pp. 1-17
Author(s):  
Xiangjun Jiang ◽  
Zhongxiang Huang ◽  
Zhenyu Zhao
Keyword(s):  
Equilibrium State ◽  
Traffic Flow ◽  
Complete Information ◽  
User Equilibrium ◽  
Evolution Model ◽  
Choice Behaviour ◽  
Flow Evolution ◽  
Quantity Adjustment ◽  
Mixed Equilibrium ◽  
Equilibrium Pattern

Based on the price-quantity adjustment behaviour principle of disequilibrium theory, the route choices of travellers are also affected by a quantity signal known as traffic flow, while the route cost is considered as a price signal in economics. Considering the quantity signal’s effect among travellers, a new route comfort choice behaviour criterion and its corresponding equilibrium condition are established. The network travellers are classified into three groups according to their route choice behaviour: travellers in the first group choose the shortest route following the route rapidity behaviour criterion with complete information forming the UE (user equilibrium) pattern, travellers in the second group choose the most comfortable route following the route comfort behaviour criterion with complete information forming the QUE (quantity adjustment user equilibrium) pattern, and travellers in the third group choose a route according to their perceived travel time with incomplete information forming the SUE (stochastic user equilibrium) pattern. The traffic flows of all three groups converge to a new UE-QUE-SUE mixed equilibrium flow pattern after interaction. To depict the traveller-diversified choice behaviour and the traffic flow interaction process, a mixed equilibrium traffic flow evolution model is formulated. After defining the route comfort indicator and the corresponding user equilibrium state, the equilibrium conditions of the three group flows are given under a mixed equilibrium pattern. In addition, an equivalent mathematical programming of the mixed equilibrium traffic flow evolution model is proposed to demonstrate that the developed model converges to the mixed equilibrium state. Finally, numerical examples are examined to evaluate the effect of route comfort proportions on the traffic network flow evolution and analyse the performance of the proposed model.

Allocating nodes to hubs for minimizing the hubs processing resources: A case study

2019 ◽  
Vol 53 (3) ◽  
pp. 807-827
Author(s):  
Ali Balma ◽  
Mehdi Mrad
Keyword(s):  
Telecommunication Network ◽  
Real Life ◽  
Optimal Solutions ◽  
Total Flow ◽  
Nonlinear Formulation ◽  
Large Size ◽  
Processing Resources ◽  
Reformulation Linearization

This paper addresses the problem of allocating the terminal nodes to the hub nodes in a telecommunication network. Since the flow processing induces some undesirable delay, the objective is to minimize the total flow processed by the hubs. This study focuses on a real life network of the tunisian operator Tunisie Telecom whose operations managers are concerned by the quality of service. We provide three compact formulations that give optimal solutions for networks of large size. In particular, the last two are obtained by applying the Reformulation-Linearization Technique to a nonlinear formulation of the problem. The latter formulation derived within this approach is the most computationally effective, as pointed out by the computational experiments conducted on the real life network of Tunisie Telecom with 110 nodes and 5 hubs. Finally, we discuss and compare between the single allocation and double allocation configurations.

Characterization of Manufacturing System Computer Simulation using Taguchi Method

2015 ◽  
Vol 72 (4) ◽  
Author(s):  
Seyed Mojib Zahraee ◽  
Ali Chegeni ◽  
Jafri Mohd Rohani
Keyword(s):  
Computer Simulation ◽  
Taguchi Method ◽  
Manufacturing Industry ◽  
Waiting Times ◽  
Inspection Time ◽  
Total Output ◽  
Service Rate ◽  
Manufacturing Line

In the manufacturing industry, managers and engineers are trying to sustain their competitiveness by achieving high output and productivity. There are some common problems such as waiting times, failures, reworks in production line that impose extra cost to the companies. Therefore, companies are striving to find methods in order to determine and deal with problems using different methods such as mathematical, statistical and computer simulation. The goal of this paper is to increase the total output production and to improve productivity using computer simulation and Taguchi method. This paper introduces a color manufacturing line as a case study which is simulated using arena 13.9 software. Following that the Taguchi method is applied to assess the effect of controllable and uncontrollable factors on the total output production. According to the result of JMP 10 software to conduct Taguchi experiment, the maximum desirability of productivity will be achieved when the value of factors such service rate of delpak machine=UNIF (30, 40), number of labor=14, inspection time=120 and number of Permil=5. Taguchi Method plays an efficient and suitable role in the process improvement, proposing adjustments that will provide an improvement in the productivity. 

scholarly journals MODELING AND SIMULATION OF TRAFFIC FLOW : A CASE STUDY - FIRST RING ROAD IN DOWNTOWN MADINAH

2016 ◽  
Vol 2 ◽  
pp. 89-107 ◽  
Author(s):  
Muhammad Nomani Kabir ◽  
◽  
Yasser M. Alginahi ◽  
Ali I. Mohamed ◽  
◽  
...  
Keyword(s):  
Modeling And Simulation ◽  
Traffic Flow ◽  
Ring Road
Sign in / Sign up

Export Citation Format

Share Document