Fixed-Time Traffic Control at Superstreet Intersections by Bee Colony Optimization

Author(s):  
Aleksandar Jovanović ◽  
Dušan Teodorović

The superstreet intersection (or restricted crossing U-turn-, J-turn intersection) fixed-time traffic control system was developed in this study. The optimal (or near-optimal) values of cycle length, splits, and offsets were discovered by minimizing the experienced travel time of all network users traveling through the superstreet intersection. The optimization procedure used was based on the bee colony optimization (BCO) metaheuristic. The BCO is a stochastic, random-search, population-based technique, inspired by the foraging behavior of honey bees. The BCO belongs to the class of swarm intelligence methods. A set of numerical experiments was performed. Superstreet intersection configurations that allowed direct left turns from the major street, as well as configurations with no direct left turns, were analyzed within numerical experiments. The obtained results showed that BCO outperformed the traditional Webster approach in the superstreet geometrical configurations considered.

2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Suwin Sleesongsom ◽  
Sujin Bureerat

This paper presents a novel constraint handling technique for optimum path generation of four-bar linkages using evolutionary algorithms (EAs). Usually, the design problem is assigned to minimize the error between desired and obtained coupler curves with penalty constraints. It is found that the currently used constraint handling technique is rather inefficient. In this work, we propose a new technique, termed a path repairing technique, to deal with the constraints for both input crank rotation and Grashof criterion. Three traditional path generation test problems are used to test the proposed technique. Metaheuristic algorithms, namely, artificial bee colony optimization (ABC), adaptive differential evolution with optional external archive (JADE), population-based incremental learning (PBIL), teaching-learning-based optimization (TLBO), real-code ant colony optimization (ACOR), a grey wolf optimizer (GWO), and a sine cosine algorithm (SCA), are applied for finding the optimum solutions. The results show that new technique is a superior constraint handling technique while TLBO is the best method for synthesizing four-bar linkages.


This traffic controller system aims at designing a dynamic automated traffic control system where the signal and time limit will be automatically changed when it detects traffic congestion in any lane. Traffic congestion is a major problem in many cities around the world so it is urgent need to switch over from manual mode or timer mode to an automated traffic control system that has the power to make decisions on its own. The current traffic signal system is working on fixed time which may not work if one route gets more traffic than other lane. To overcome this problem, a smart traffic control system is proposed. When using this system high traffic congestion on a particular lane receives green for a longer period of time compared to the other lanes which has normal vehicle flow. Therefore, the proposed method of providing green and red light time is based on the amount of traffic congestion at the time with the help of an IR sensor and Sound sensors connected to ATmega 2560 Microcontroller.


10.29007/c6k6 ◽  
2019 ◽  
Author(s):  
Görkem Akyol ◽  
Mehmet Ali Silgu ◽  
Hilmi Berk Çelikoğlu

The center of the Kadıköy area in Istanbul is extremely crowded due to overlap of the terminals for the subway and the marine transit lines. When the Kadıköy-Kartal subway’s terminal is added in the middle of the Kadıköy in 2013 without the analysis on crowd dynamics, vehicular and pedestrian traffic have become much more complicated to be efficiently managed. When the pedestrians have a crossing gap, most of them make the decision of crossing without considering the signal phase. Likewise, when it is a pedestrian clearance phase, there can be situations where all the pedestrians cannot cross the street because of high density and insufficient green time. We therefore propose an adaptive traffic control system considering the traffic flows of road vehicles and pedestrians with field data. We have utilized the Eclipse SUMO micro-simulator in conjunction with TraCI for modeling the case. Comparison of fixed time and adaptive signal controllers is provided. Simulations have shown that, reductions in the delay time for both vehicles and pedestrians are achieved by using adaptive signal controllers.


2018 ◽  
Vol 185 ◽  
pp. 00033 ◽  
Author(s):  
Chia-Sheng Tu ◽  
Hsi-Shan Huang ◽  
Ming-Tang Tsai ◽  
Fu-Sheng Cheng

Dynamic economic dispatch is to minimize the cost of power production of all the participating generators over a time horizon of 24 hours in one day. The dynamic economic dispatch with non-smooth cost functions, for which is formulated the optimal dispatch model of generations by considering the ramp up/down scheduling of power. This paper presents a Bee Colony Optimization (BCO) that applies the Taguchi Method (TM) to solve the Dynamic Economic Dispatch problem. The Taguchi method that involves the use of orthogonal arrays in estimating of the non-smooth cost function and Bee Colony Optimization is used to find the objective function under the operational of system constraints. The Taguchi method can global optimization for fast local convergence by minimizing the cost function in a few iterations. The effectiveness and efficiency of the TM-BCO is demonstrated by using a 10 unit of IEEE case with non-smooth fuel cost functions and is more effective than other previously developed algorithms. Moreover, the proposed approach presents significant computational benefits than traditional random search method especially for multi-unit systems with larger numbers of non-smooth cost functions and more complicated dynamic economic dispatch.


2021 ◽  
Author(s):  
Mohammed Alweshah ◽  
Muder Almiani ◽  
Nedaa Almansour ◽  
Saleh Al khalaileh ◽  
Hamza Aldabbas ◽  
...  

Abstract The vehicle routing problem (VRP) is one of the challenging problems in optimization and can be described as combinatorial optimization and NP-hard problem. Researchers have used many artificial intelligence techniques in order to try to solve this problem. Among these techniques, metaheuristic algorithms that can perform random search are the most promising because they can be used to find the right solution in the shortest possible time. Therefore, in this paper, the Harris hawks optimization (HHO) algorithm was used to attempt to solve the VRP. The algorithm was applied to 10 scenarios and the experimental results revealed that the HHO had a strong ability to check for and find the best route as compared to other metaheuristic algorithms, namely, simulated annealing and artificial bee colony optimization. The comparison was based on three criteria: minimum objective function obtained, minimum number of iterations required and satisfaction of capacity constraints. In all scenarios, the HHO showed clear superiority over the other methods.


Author(s):  
Rachna Rathore

In our daily life, we are facing several problems; Traffic congestion is one of them, which is becoming serious day by day. High number of vehicles on road, insufficient infrastructure, unreasonable developments are some reasons for increasing traffic congestion. The aim of this paper is to introduce a mathematical model which can be applied to traffic control system having fixed time signal with preset time to minimize traffic congestion at an intersection. In this paper, we use the concept of traffic intensity and Assignment model for traffic congestion minimization.


ICTIS 2011 ◽  
2011 ◽  
Author(s):  
Qin Yong ◽  
Yuqiang Lv ◽  
Dong Honghui ◽  
Tang Kun ◽  
Nie Miao ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document