Traffic Urban Control Using an Intelligent PSO Algorithm Based on Integrated Approach

2020 ◽  
Vol 5 (1) ◽  
pp. 1-9
Author(s):  
Radja DIAF ◽  
Cherif TOLBA ◽  
Ahmed Nait Sidi Moh
Keyword(s):  
Traffic Flow ◽  
Evaluation Criteria ◽  
Particle Swarm ◽  
Integrated Approach ◽  
Pso Algorithm ◽  
Urban Traffic ◽  
Pollutant Emissions ◽  
Particle Swarm Optimizer ◽  
Traffic Lights ◽  
Vehicle Delay

In this paper, we intend to contribute to the improvement of urban traffic mobility using a learning method of traffic lights controllers. We proposed a Particle Swarm Optimization (PSO) method in which the intelligent swarm acts as the cycle time of the traffic signal. The best swarm (solution found) meets the evaluation criteria selected to describe desired objectives. The main measures of traffic lights efficiency are to maximize flow-rate at which vehicles can cross a road junction and minimize the additional travel time of the driver called vehicle delay. Particle Swarm Optimizer was coupled with the traffic flow model based on Continuous Petri nets (PN). One potential advantage of CPN model is to provide insights regarding a behavior of the platoon of vehicles on the target road network. The result obtained from this study has tested with various scenarios related to intersections in different situations. The developed self-scheduling of the optimal signal timing ensures safety and continuous traffic flow, thus increasing the mobility and reducing fuel consumption and pollutant emissions.

scholarly journals Interdisciplinary Evaluation of Intersection Performances—A Microsimulation-Based MCDA

2021 ◽  
Vol 13 (4) ◽  
pp. 1859
Author(s):  
Kadir Diler Alemdar ◽  
Ahmet Tortum ◽  
Ömer Kaya ◽  
Ahmet Atalay
Keyword(s):  
Traffic Engineering ◽  
Traffic Management ◽  
Evaluation Criteria ◽  
Urban Traffic ◽  
Suitable Alternative ◽  
Order Preference ◽  
Energy Environment ◽  
Vehicle Delay ◽  
Hierarchy Process ◽  
Co Emission

Intersections are the most important regions in terms of urban traffic management. The intersection areas on the corridor should be analyzed together for consistency in traffic engineering. To do so, three intersections on the Vatan Street corridor in İstanbul, the most crowded city of Turkey, were examined. Various geometric and signal designs were performed for intersections and the most suitable corridor design was analyzed. The corridor designs were modeled with the PTV VISSIM microsimulation software. The most suitable corridor design was evaluated by using the results obtained from the microsimulation via analytical hierarchy process (AHP) and technique for order preference by similarity to ideal solution (TOPSIS) from multi criteria decision analysis (MCDA) methods. The evaluation criteria in the study are vehicle delay, queue length, stopped delay, stops, travel time, vehicle safety, CO emission, fuel consumption, and construction cost. As a result, the current and the most suitable alternative corridors were compared according to the comparison parameters and up to 80% improvements were observed. Thus, some advantages were obtained in terms of energy, environment, time, and cost.

Improved Particle Swarm Optimizer with Dynamically Adjusted Search Space and Velocity Limits for Global Optimization

2015 ◽  
Vol 24 (05) ◽  
pp. 1550017 ◽  
Author(s):  
Aderemi Oluyinka Adewumi ◽  
Akugbe Martins Arasomwan
Keyword(s):  
Global Optimization ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Search Space ◽  
Particle Swarm Optimizer ◽  
Search Range ◽  
Original Algorithm ◽  
Inertia Weight ◽  
And Performance

This paper presents an improved particle swarm optimization (PSO) technique for global optimization. Many variants of the technique have been proposed in literature. However, two major things characterize many of these variants namely, static search space and velocity limits, which bound their flexibilities in obtaining optimal solutions for many optimization problems. Furthermore, the problem of premature convergence persists in many variants despite the introduction of additional parameters such as inertia weight and extra computation ability. This paper proposes an improved PSO algorithm without inertia weight. The proposed algorithm dynamically adjusts the search space and velocity limits for the swarm in each iteration by picking the highest and lowest values among all the dimensions of the particles, calculates their absolute values and then uses the higher of the two values to define a new search range and velocity limits for next iteration. The efficiency and performance of the proposed algorithm was shown using popular benchmark global optimization problems with low and high dimensions. Results obtained demonstrate better convergence speed and precision, stability, robustness with better global search ability when compared with six recent variants of the original algorithm.

scholarly journals An Enhanced Partial Search to Particle Swarm Optimization for Unconstrained Optimization

Mathematics ◽  
2019 ◽  
Vol 7 (4) ◽  
pp. 357 ◽  
Author(s):  
Shu-Kai S. Fan ◽  
Chih-Hung Jen
Keyword(s):  
Particle Swarm Optimization ◽  
Unconstrained Optimization ◽  
Optimization Technique ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Pso Algorithm ◽  
Particle Swarm Optimizer ◽  
Swarm Optimization ◽  
Searching Strategy ◽  
Wide Range

Particle swarm optimization (PSO) is a population-based optimization technique that has been applied extensively to a wide range of engineering problems. This paper proposes a variation of the original PSO algorithm for unconstrained optimization, dubbed the enhanced partial search particle swarm optimizer (EPS-PSO), using the idea of cooperative multiple swarms in an attempt to improve the convergence and efficiency of the original PSO algorithm. The cooperative searching strategy is particularly devised to prevent the particles from being trapped into the local optimal solutions and tries to locate the global optimal solution efficiently. The effectiveness of the proposed algorithm is verified through the simulation study where the EPS-PSO algorithm is compared to a variety of exiting “cooperative” PSO algorithms in terms of noted benchmark functions.

Image Measurement of Traffic Flow Parameters and its Traffic Congestion Evaluation

2014 ◽  
Vol 538 ◽  
pp. 455-459
Author(s):  
Dong Yao Jia ◽  
Po Hu
Keyword(s):  
Traffic Flow ◽  
Traffic Congestion ◽  
Evaluation Model ◽  
Evaluation Methods ◽  
Urban Traffic ◽  
Flow Parameters ◽  
Shape Match ◽  
Flow Information ◽  
Vehicle Delay ◽  
Vehicle Shape

Current evaluation methods on urban traffic congestion are mostly based on traffic flow information. However, the measurement of traffic flow remains to be controversial and difficult for the community. This paper points out an algorithm to acquire traffic parameters and studies the evaluation methods based on it. By extracting multi-color-feature information from image and vehicle shape match algorithm based on fuzzy rules, this method can efficiently distinguish vehicles from each other thus to calculate the traffic state parameters according to the results of this method. Then it can build congestion evaluation model with vehicle delay rate as the critical parameter. The experiment indicates that this method can acquire the accurate real-time road parameters and also proves it is valid to apply this method in urban traffic congestion evaluation in different situations.

scholarly journals Particle Swarm Optimization: A survey of Historical and Recent Developments with Hybridization Perspectives

2018 ◽  
Author(s):  
Saptarshi Sengupta ◽  
Sanchita Basak ◽  
Richard Alan Peters
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Interested Reader ◽  
Particle Swarm Optimizer ◽  
Swarm Optimization ◽  
Fish Schools ◽  
Deterministic Algorithms ◽  
Multidimensional Problems ◽  
Recent Developments

Particle Swarm Optimization (PSO) is a metaheuristic global optimization paradigm that has gained prominence in the last two decades due to its ease of application in unsupervised, complex multidimensional problems which cannot be solved using traditional deterministic algorithms. The canonical particle swarm optimizer is based on the flocking behavior and social co-operation of birds and fish schools and draws heavily from the evolutionary behavior of these organisms. This paper serves to provide a thorough survey of the PSO algorithm with special emphasis on the development, deployment and improvements of its most basic as well as some of the very recent state–of-the-art implementations. Concepts and directions on choosing the inertia weight, constriction factor, cognition and social weights and perspectives on convergence, parallelization, elitism, niching and discrete optimization as well as neighborhood topologies are outlined. Hybridization attempts with other evolutionary and swarm paradigms in selected applications are covered and an up-to-date review is put forward for the interested reader.

Two Dimensional Cellular Automaton Model of the Mixed Traffic Flow for Urban Traffic

2012 ◽  
Vol 241-244 ◽  
pp. 2082-2087
Author(s):  
Li Yang ◽  
Jun Hui Hu ◽  
Ling Jiang Kong
Keyword(s):  
Boundary Conditions ◽  
Cellular Automaton ◽  
Traffic Flow ◽  
Flow Model ◽  
Urban Traffic ◽  
Mixed Traffic ◽  
Traffic Flow Model ◽  
Traffic Lights ◽  
Mixed Traffic Flow ◽  
Transit Traffic

Based on the two-dimension cellular automaton traffic flow model (BML model), a mixed traffic flow model for urban traffic considering the transit traffic is established in this paper. Under the don't block the box rules and the opening boundary conditions, the impacts of transit traffic, the central station, traffic lights cycle, the vehicles length on the mixed traffic flow is studied by computer simulation. Some important characters appearing in the new model are also elucidated. It shows that traffic flow is closely related to traffic lights cycle, the geometric structure of transport network and boundary conditions. Under certain traffic light cycle time, the traffic flow has a periodical oscillation change. The comparison to practical measured data shows that our stimulation results are accordant with the changes of real traffic flow, which confirms the accuracy and rationality of our model.

scholarly journals WEIGHT MINIMIZATION OF TRUSS STRUCTURES WITH SIZING AND LAYOUT VARIABLES USING INTEGRATED PARTICLE SWARM OPTIMIZER

2017 ◽  
Vol 23 (8) ◽  
pp. 985-1001 ◽  
Author(s):  
Ali MORTAZAVI ◽  
Vedat TOĞAN ◽  
Ayhan NUHOĞLU
Keyword(s):  
Optimization Problems ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Truss Structures ◽  
Continuous Variables ◽  
Particle Swarm Optimizer ◽  
Search Spaces ◽  
Optimization Constraints ◽  
Weight Minimization ◽  
Ipso Algorithm

This study investigates the performances of the integrated particle swarm optimizer (iPSO) algorithm in the layout and sizing optimization of truss structures. The iPSO enhances the standard PSO algorithm employing both the concept of weighted particle and the improved fly-back method to handle optimization constraints. The performance of the recent algorithm is tested on a series of well-known truss structures weight minimization problems including mixed design search spaces (i.e. with both discrete and continuous variables) over various types of constraints (i.e. nodal dis­placements, element stresses and buckling criterion). The results demonstrate the validity of the proposed approach in dealing with combined layout and size optimization problems.

Parallelizing a Modified Particle Swarm Optimizer (PSO)

2010 ◽  
Vol 163-167 ◽  
pp. 2404-2409 ◽  
Author(s):  
Bin Yang ◽  
Qi Lin Zhang
Keyword(s):  
Execution Time ◽  
Optimization Problems ◽  
Computational Cost ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Topological Optimization ◽  
Particle Swarm Optimizer ◽  
Speed Up ◽  
Truss Topological Optimization ◽  
High Computational Cost

Recently, a modified Particle Swarm Optimizer (MLPSO) has been succeeded in solving truss topological optimization problems and competitive results are obtained. Since this optimizer belongs to evolutionary algorithm and plagued by high computational cost as measured by execution time, in order to reduce its execution time for solving large complex optimization problem, a parallel version for this optimizer is studied in this paper. This paper first gives an overview of PSO algorithm as well as the modified PSO, and then a design and an implementation of parallel PSO is proposed. The performance of the proposed algorithm is tested by two examples and promising speed-up rate is obtained. Final part is conclusion and outlook.

Real-Time Traffic Signal Control Based on Kalman Filtering Theory

2015 ◽  
Vol 713-715 ◽  
pp. 915-918
Author(s):  
Yuan Xin Xu ◽  
Wan Ying Yang ◽  
Wen Shi
Keyword(s):  
Kalman Filter ◽  
Traffic Flow ◽  
Control Method ◽  
Urban Traffic ◽  
Traffic Signal Control ◽  
Signal Timing ◽  
Traffic Flows ◽  
Traffic Lights ◽  
Real Time Traffic ◽  
Stable Signal

Aiming at the problem that individual control of urban traffic lights and stable signal timing. This paper proposed a real timing control method of traffic lights which based on Kalman filter. This method use Kalman filter to predict the next time traffic flows and then update the signal timing. By field researching the traffic flow of intersection in peak hour and predicting the traffic flow. Then update the signal timing. Meanwhile using the VISSIM to simulate the intersection. The result of the simulation shows that the length of vehicle queue decreased significantly and the number of stops dropped. The efficiency of access has been greatly improved.

Sign in / Sign up

Export Citation Format

Share Document