This document summarizes a research paper that uses genetic algorithms to optimize traffic light timing at intersections to minimize traffic. It first describes modeling traffic light intersections using Petri nets. It then explains how genetic algorithms can be used for optimization by coding the problem variables in chromosomes, defining a fitness function to evaluate populations over generations, and using operators like mutation and crossover. The fitness function aims to minimize average traffic light cycle times based on 14 parameters related to light timing and vehicle wait times at two intersections. The genetic algorithm optimization of traffic light timing parameters is found to improve traffic flow at intersections.
License plate recognition system is one of the core technologies in intelligent traffic control. In this paper, a new and tunable algorithm which can detect multiple license plates in high resolution applications is proposed. The algorithm aims at investigation into and identification of the novel Iranian and some European countries plate, characterized by both inclusion of blue area on it and its geometric shape. Obviously, the suggested algorithm contains suitable velocity due to not making use of heavy pre-processing operation such as image-improving filters, edge-detection operation and omission of noise at the beginning stages. So, the recommended method of ours is compatible with model-adaptation, i.e., the very blue section of the plate so that the present method indicated the fact that if several plates are included in the image, the method can successfully manage to detect it. We evaluated our method on the two Persian single vehicle license plate data set that we obtained 99.33, 99% correct recognition rate respectively. Further we tested our algorithm on the Persian multiple vehicle license plate data set and we achieved 98% accuracy rate. Also we obtained approximately 99% accuracy in character recognition stage.
A Novel Multiple License Plate Extraction Technique for Complex Background in...CSCJournals
License plate recognition (LPR) is one of the most important applications of applying computer techniques towards intelligent transportation systems (ITS). In order to recognize a license plate efficiently, location and extraction of the license plate is the key step. Hence finding the position of a license plate in a vehicle image is considered to be the most crucial step of an LPR system, and this in turn greatly affects the recognition rate and overall speed of the whole system. This paper mainly deals with the detecting license plate location issues in Indian traffic conditions. The vehicles in India sometimes bare extra textual regions such as owner’s name, symbols, popular sayings and advertisement boards in addition to license plate. Situation insists for accurate discrimination of text class and fine aspect ratio analysis. In addition to this additional care taken up in this paper is to extract license plate of motorcycle (size of plate is small and double row plate), car (single as well as double row type), transport system such as bus, truck, (dirty plates) as well as multiple license plates present in an image frame under consideration. Disparity of aspect ratios is a typical feature of Indian traffic. Proposed method aims at identifying region of interest by performing a sequence of directional segmentation and morphological processing. Always the first step is of contrast enhancement, which is accomplished by using sigmoid function. In the subsequent steps, connected component analysis followed by different filtering techniques like aspect ratio analysis and plate compatible filter technique is used to find exact license plate. The proposed method is tested on large database consisting of 750 images taken in different conditions. The algorithm could detect the license plate in 742 images with success rate of 99.2%.
A Much Advanced and Efficient Lane Detection Algorithm for Intelligent Highwa...cscpconf
This paper presents a much advanced and efficient lane detection algorithm. The algorithm is based on (ROI) Region of Interest segmentation. In this algorithm images are pre-processed by top-hat transform for de-noising and enhancing contrast. ROI of a test image is then extracted. For detecting lines in the ROI, Hough transform is used. Estimation of the distance between Hough origin and lane-line midpoint is made. Lane departure decision is made based on the difference between these distances. As for the simulation part we have used Matlab software.Experiments show that the proposed algorithm can detect the lane markings accurately and quickly.
Enhancement performance of road recognition system of autonomous robots in sh...sipij
Road region recognition is a main feature that is gaining increasing attention from intellectuals because it
helps autonomous vehicle to achieve a successful navigation without accident. However, different
techniques based on camera sensor have been used by various researchers and outstanding results have
been achieved. Despite their success, environmental noise like shadow leads to inaccurate recognition of
road region which eventually leads to accident for autonomous vehicle. In this research, we conducted an
investigation on shadow and its effects, optimized the road region recognition system of autonomous
vehicle by introducing an algorithm capable of detecting and eliminating the effects of shadow. The
experimental performance of our system was tested and compared using the following schemes: Total
Positive Rate (TPR), False Negative Rate (FNR), Total Negative Rate (TNR), Error Rate (ERR) and False
Positive Rate (FPR). The performance result of the system improved on road recognition in shadow
scenario and this advancement has added tremendously to successful navigation approaches for
autonomous vehicle.
Improved algorithm for road region segmentation based on sequential monte car...csandit
In recent years, many researchers and car makers put a lot of intensive effort into development
of autonomous driving systems. Since visual information is the main modality used by human
driver, a camera mounted on moving platform is very important kind of sensor, and various
computer vision algorithms to handle vehicle surrounding situation are under intensive
research. Our final goal is to develop a vision based lane detection system with ability to
handle various types of road shapes, working on both structured and unstructured roads, ideally
under presence of shadows. This paper presents a modified road region segmentation algorithm
based on sequential Monte-Carlo estimation. Detailed description of the algorithm is given,
and evaluation results show that the proposed algorithm outperforms the segmentation
algorithm developed as a part of our previous work, as well as an conventional algorithm based
on colour histogram.
License plate recognition system is one of the core technologies in intelligent traffic control. In this paper, a new and tunable algorithm which can detect multiple license plates in high resolution applications is proposed. The algorithm aims at investigation into and identification of the novel Iranian and some European countries plate, characterized by both inclusion of blue area on it and its geometric shape. Obviously, the suggested algorithm contains suitable velocity due to not making use of heavy pre-processing operation such as image-improving filters, edge-detection operation and omission of noise at the beginning stages. So, the recommended method of ours is compatible with model-adaptation, i.e., the very blue section of the plate so that the present method indicated the fact that if several plates are included in the image, the method can successfully manage to detect it. We evaluated our method on the two Persian single vehicle license plate data set that we obtained 99.33, 99% correct recognition rate respectively. Further we tested our algorithm on the Persian multiple vehicle license plate data set and we achieved 98% accuracy rate. Also we obtained approximately 99% accuracy in character recognition stage.
A Novel Multiple License Plate Extraction Technique for Complex Background in...CSCJournals
License plate recognition (LPR) is one of the most important applications of applying computer techniques towards intelligent transportation systems (ITS). In order to recognize a license plate efficiently, location and extraction of the license plate is the key step. Hence finding the position of a license plate in a vehicle image is considered to be the most crucial step of an LPR system, and this in turn greatly affects the recognition rate and overall speed of the whole system. This paper mainly deals with the detecting license plate location issues in Indian traffic conditions. The vehicles in India sometimes bare extra textual regions such as owner’s name, symbols, popular sayings and advertisement boards in addition to license plate. Situation insists for accurate discrimination of text class and fine aspect ratio analysis. In addition to this additional care taken up in this paper is to extract license plate of motorcycle (size of plate is small and double row plate), car (single as well as double row type), transport system such as bus, truck, (dirty plates) as well as multiple license plates present in an image frame under consideration. Disparity of aspect ratios is a typical feature of Indian traffic. Proposed method aims at identifying region of interest by performing a sequence of directional segmentation and morphological processing. Always the first step is of contrast enhancement, which is accomplished by using sigmoid function. In the subsequent steps, connected component analysis followed by different filtering techniques like aspect ratio analysis and plate compatible filter technique is used to find exact license plate. The proposed method is tested on large database consisting of 750 images taken in different conditions. The algorithm could detect the license plate in 742 images with success rate of 99.2%.
A Much Advanced and Efficient Lane Detection Algorithm for Intelligent Highwa...cscpconf
This paper presents a much advanced and efficient lane detection algorithm. The algorithm is based on (ROI) Region of Interest segmentation. In this algorithm images are pre-processed by top-hat transform for de-noising and enhancing contrast. ROI of a test image is then extracted. For detecting lines in the ROI, Hough transform is used. Estimation of the distance between Hough origin and lane-line midpoint is made. Lane departure decision is made based on the difference between these distances. As for the simulation part we have used Matlab software.Experiments show that the proposed algorithm can detect the lane markings accurately and quickly.
Enhancement performance of road recognition system of autonomous robots in sh...sipij
Road region recognition is a main feature that is gaining increasing attention from intellectuals because it
helps autonomous vehicle to achieve a successful navigation without accident. However, different
techniques based on camera sensor have been used by various researchers and outstanding results have
been achieved. Despite their success, environmental noise like shadow leads to inaccurate recognition of
road region which eventually leads to accident for autonomous vehicle. In this research, we conducted an
investigation on shadow and its effects, optimized the road region recognition system of autonomous
vehicle by introducing an algorithm capable of detecting and eliminating the effects of shadow. The
experimental performance of our system was tested and compared using the following schemes: Total
Positive Rate (TPR), False Negative Rate (FNR), Total Negative Rate (TNR), Error Rate (ERR) and False
Positive Rate (FPR). The performance result of the system improved on road recognition in shadow
scenario and this advancement has added tremendously to successful navigation approaches for
autonomous vehicle.
Improved algorithm for road region segmentation based on sequential monte car...csandit
In recent years, many researchers and car makers put a lot of intensive effort into development
of autonomous driving systems. Since visual information is the main modality used by human
driver, a camera mounted on moving platform is very important kind of sensor, and various
computer vision algorithms to handle vehicle surrounding situation are under intensive
research. Our final goal is to develop a vision based lane detection system with ability to
handle various types of road shapes, working on both structured and unstructured roads, ideally
under presence of shadows. This paper presents a modified road region segmentation algorithm
based on sequential Monte-Carlo estimation. Detailed description of the algorithm is given,
and evaluation results show that the proposed algorithm outperforms the segmentation
algorithm developed as a part of our previous work, as well as an conventional algorithm based
on colour histogram.
Path Planning for Mobile Robot Navigation Using Voronoi Diagram and Fast Marc...Waqas Tariq
For navigation in complex environments, a robot needs to reach a compromise between the need for having efficient and optimized trajectories and the need for reacting to unexpected events. This paper presents a new sensor-based Path Planner which results in a fast local or global motion planning able to incorporate the new obstacle information. In the first step the safest areas in the environment are extracted by means of a Voronoi Diagram. In the second step the Fast Marching Method is applied to the Voronoi extracted areas in order to obtain the path. The method combines map-based and sensor-based planning operations to provide a reliable motion plan, while it operates at the sensor frequency. The main characteristics are speed and reliability, since the map dimensions are reduced to an almost unidimensional map and this map represents the safest areas in the environment for moving the robot. In addition, the Voronoi Diagram can be calculated in open areas, and with all kind of shaped obstacles, which allows to apply the proposed planning method in complex environments where other methods of planning based on Voronoi do not work.
A Path Planning Technique For Autonomous Mobile Robot Using Free-Configuratio...CSCJournals
This paper presents the implementation of a novel technique for sensor based path planning of autonomous mobile robots. The proposed method is based on finding free-configuration eigen spaces (FCE) in the robot actuation area. Using the FCE technique to find optimal paths for autonomous mobile robots, the underlying hypothesis is that in the low-dimensional manifolds of laser scanning data, there lies an eigenvector which corresponds to the free-configuration space of the higher order geometric representation of the environment. The vectorial combination of all these eigenvectors at discrete time scan frames manifests a trajectory, whose sum can be treated as a robot path or trajectory. The proposed algorithm was tested on two different test bed data, real data obtained from Navlab SLAMMOT and data obtained from the real-time robotics simulation program Player/Stage. Performance analysis of FCE technique was done with existing four path planning algorithms under certain working parameters, namely computation time needed to find a solution, the distance travelled and the amount of turning required by the autonomous mobile robot. This study will enable readers to identify the suitability of path planning algorithm under the working parameters, which needed to be optimized. All the techniques were tested in the real-time robotic software Player/Stage. Further analysis was done using MATLAB mathematical computation software.
TRAFFIC-SIGN RECOGNITION FOR AN INTELLIGENT VEHICLE/DRIVER ASSISTANT SYSTEM U...cseij
In order to be deployed in driving environments, Intelligent transport system (ITS) must be able to
recognize and respond to exceptional road conditions such as traffic signs, highway work zones and
imminent road works automatically. Recognition of traffic sign is playing a vital role in the intelligent
transport system, it enhances traffic safety by providing drivers with safety and precaution information
about road hazards. To recognize the traffic sign, the system has been proposed with three phases. They
are Traffic board Detection, Feature extraction and Recognition. The detection phase consists of RGBbased
colour thresholding and shape analysis, which offers robustness to differences in lighting situations.
A Histogram of Oriented Gradients (HOG) technique was adopted to extract the features from the
segmented output. Finally, traffic signs recognition is done by k-Nearest Neighbors (k-NN) classifiers. It
achieves an classification accuracy upto 63%.
This paper deals with the optimization of the capacity of a terminal railway station using the
Ant Colony Optimization algorithm. The capacity of the terminal station is defined as the
number of trains that depart from the station in unit interval of time. The railway capacity
optimization problem is framed as a typical symmetrical Travelling Salesman Problem (TSP),
with the TSP nodes representing the train arrival /departure events and the TSP total cost
representing the total time-interval of the schedule. The application problem is then optimized
using the ACO algorithm. The simulation experiments validate the formulation of the railway
capacity problem as a TSP and the ACO algorithm produces optimal solutions superior to those
produced by the domain experts.
Circular Traffic Signs Recognition Using The Number of Peaks AlgorithmCSCJournals
Smart cars nowadays include embedded computers to guide the driver in his trip. An important application that should be added to any car is the detection and recognition of traffic signs. In this paper, we focus on the recognition of a wide set of circular traffic signs using the Number of Peaks Algorithm [1]. After detecting a traffic sign, the algorithm draws three horizontal lines and three vertical lines across the image. The number of peaks (crossing from a black pixel to a white pixel) is calculated for each of the six lines as the image is scanned from right to left (for horizontal lines) or top to bottom (for vertical lines). The resulting numbers of peaks are used by the decision-tree-like search algorithm to distinguish between 51 circular road signs with a mean detection time of 8 milliseconds, 100% detection rate and in a fairly noisy environment.
Artificial Intelligence in Robot Path Planningiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
REVIEW OF LANE DETECTION AND TRACKING ALGORITHMS IN ADVANCED DRIVER ASSISTANC...ijcsit
Lane detection and tracking is one of the key features of advanced driver assistance system. Lane detection is finding the white markings on a dark road. Lane tracking use the previously detected lane markers and adjusts itself according to the motion model. In this paper, review of lane detection and tracking algorithms developed in the last decade is discussed. Several modalities are considered for lane detection which
include vision, LIDAR, vehicle odometry information,information from global positioning system and digital maps. The lane detection and tracking is one of the challenging problems in computer vision.Different vision based lane detection techniques are explained in the paper. The performance of different lane detection and tracking algorithms is also compared and studied.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Implementation of a lane-tracking system for autonomous driving using Kalman ...Francesco Corucci
This project was developed for a Digital Control class. It consists of a system that is able to identify and track lane marks in a video acquired by webcam. It's interesting how the Kalman filter is used in such a context in order to make the lane detection computationally feasible in the small amount of time between two subsequent video frames
License Plate Localization based on Statistical Measures of License Plate Fea...idescitation
License plate localization is considered as the most important part of license
plate recognition system. The high accuracy rate of license plate recognition is depended on
the ability of license plate detection. This paper presents a novel method for license plate
localization bases on license plate features. This proposed method consists of two main
processes. First, candidate regions extraction step, Sobel operator is applied to obtain
vertical edges and then potential candidate regions are extracted by deploying mathematical
morphology operations [5]. Last, license plate verification step, this step employs the
standard deviation of license plate features to confirm license plate position. The
experimental results show that the proposed method can achieve high quality license plate
localization results with high accuracy rate of 98.26 %.
Improving traffic and emergency vehicle clearance at congested intersections ...IJECEIAES
Traffic signals play an important role in controlling and coordinating the traffic movement in cities especially in urban areas. As the traffic is exponentially increasing in cities and the pre-timed traffic light control is insufficient in effective timing of the traffic lights, it leads to poor traffic clearance and ultimately to heavy traffic congestion at intersections. Even the Emergency vehicles like Ambulance and Fire brigade are struck at such intersections and experience a prolonged waiting time. An adaptive and intelligent approach in design of traffic light signals is desirable and this paper contributes in applying fuzzy logic to control traffic signal of single four-way intersection giving priority to the Emergency vehicle clearance. The proposed control system is composed of two parallel controllers to select the appropriate lane for green signal and also to decide the appropriate green light time as per the real time traffic condition. Performance of the proposed system is evaluated by using simulations and comparing with pre-timed control system in changing traffic flow condition. Simulation results show significant improvement over the pre-timed control in terms of traffic clearance and lowering of Emergency vehicle wait time at the intersection especially when traffic intensity is high.
Path Planning for Mobile Robot Navigation Using Voronoi Diagram and Fast Marc...Waqas Tariq
For navigation in complex environments, a robot needs to reach a compromise between the need for having efficient and optimized trajectories and the need for reacting to unexpected events. This paper presents a new sensor-based Path Planner which results in a fast local or global motion planning able to incorporate the new obstacle information. In the first step the safest areas in the environment are extracted by means of a Voronoi Diagram. In the second step the Fast Marching Method is applied to the Voronoi extracted areas in order to obtain the path. The method combines map-based and sensor-based planning operations to provide a reliable motion plan, while it operates at the sensor frequency. The main characteristics are speed and reliability, since the map dimensions are reduced to an almost unidimensional map and this map represents the safest areas in the environment for moving the robot. In addition, the Voronoi Diagram can be calculated in open areas, and with all kind of shaped obstacles, which allows to apply the proposed planning method in complex environments where other methods of planning based on Voronoi do not work.
A Path Planning Technique For Autonomous Mobile Robot Using Free-Configuratio...CSCJournals
This paper presents the implementation of a novel technique for sensor based path planning of autonomous mobile robots. The proposed method is based on finding free-configuration eigen spaces (FCE) in the robot actuation area. Using the FCE technique to find optimal paths for autonomous mobile robots, the underlying hypothesis is that in the low-dimensional manifolds of laser scanning data, there lies an eigenvector which corresponds to the free-configuration space of the higher order geometric representation of the environment. The vectorial combination of all these eigenvectors at discrete time scan frames manifests a trajectory, whose sum can be treated as a robot path or trajectory. The proposed algorithm was tested on two different test bed data, real data obtained from Navlab SLAMMOT and data obtained from the real-time robotics simulation program Player/Stage. Performance analysis of FCE technique was done with existing four path planning algorithms under certain working parameters, namely computation time needed to find a solution, the distance travelled and the amount of turning required by the autonomous mobile robot. This study will enable readers to identify the suitability of path planning algorithm under the working parameters, which needed to be optimized. All the techniques were tested in the real-time robotic software Player/Stage. Further analysis was done using MATLAB mathematical computation software.
TRAFFIC-SIGN RECOGNITION FOR AN INTELLIGENT VEHICLE/DRIVER ASSISTANT SYSTEM U...cseij
In order to be deployed in driving environments, Intelligent transport system (ITS) must be able to
recognize and respond to exceptional road conditions such as traffic signs, highway work zones and
imminent road works automatically. Recognition of traffic sign is playing a vital role in the intelligent
transport system, it enhances traffic safety by providing drivers with safety and precaution information
about road hazards. To recognize the traffic sign, the system has been proposed with three phases. They
are Traffic board Detection, Feature extraction and Recognition. The detection phase consists of RGBbased
colour thresholding and shape analysis, which offers robustness to differences in lighting situations.
A Histogram of Oriented Gradients (HOG) technique was adopted to extract the features from the
segmented output. Finally, traffic signs recognition is done by k-Nearest Neighbors (k-NN) classifiers. It
achieves an classification accuracy upto 63%.
This paper deals with the optimization of the capacity of a terminal railway station using the
Ant Colony Optimization algorithm. The capacity of the terminal station is defined as the
number of trains that depart from the station in unit interval of time. The railway capacity
optimization problem is framed as a typical symmetrical Travelling Salesman Problem (TSP),
with the TSP nodes representing the train arrival /departure events and the TSP total cost
representing the total time-interval of the schedule. The application problem is then optimized
using the ACO algorithm. The simulation experiments validate the formulation of the railway
capacity problem as a TSP and the ACO algorithm produces optimal solutions superior to those
produced by the domain experts.
Circular Traffic Signs Recognition Using The Number of Peaks AlgorithmCSCJournals
Smart cars nowadays include embedded computers to guide the driver in his trip. An important application that should be added to any car is the detection and recognition of traffic signs. In this paper, we focus on the recognition of a wide set of circular traffic signs using the Number of Peaks Algorithm [1]. After detecting a traffic sign, the algorithm draws three horizontal lines and three vertical lines across the image. The number of peaks (crossing from a black pixel to a white pixel) is calculated for each of the six lines as the image is scanned from right to left (for horizontal lines) or top to bottom (for vertical lines). The resulting numbers of peaks are used by the decision-tree-like search algorithm to distinguish between 51 circular road signs with a mean detection time of 8 milliseconds, 100% detection rate and in a fairly noisy environment.
Artificial Intelligence in Robot Path Planningiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
REVIEW OF LANE DETECTION AND TRACKING ALGORITHMS IN ADVANCED DRIVER ASSISTANC...ijcsit
Lane detection and tracking is one of the key features of advanced driver assistance system. Lane detection is finding the white markings on a dark road. Lane tracking use the previously detected lane markers and adjusts itself according to the motion model. In this paper, review of lane detection and tracking algorithms developed in the last decade is discussed. Several modalities are considered for lane detection which
include vision, LIDAR, vehicle odometry information,information from global positioning system and digital maps. The lane detection and tracking is one of the challenging problems in computer vision.Different vision based lane detection techniques are explained in the paper. The performance of different lane detection and tracking algorithms is also compared and studied.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Implementation of a lane-tracking system for autonomous driving using Kalman ...Francesco Corucci
This project was developed for a Digital Control class. It consists of a system that is able to identify and track lane marks in a video acquired by webcam. It's interesting how the Kalman filter is used in such a context in order to make the lane detection computationally feasible in the small amount of time between two subsequent video frames
License Plate Localization based on Statistical Measures of License Plate Fea...idescitation
License plate localization is considered as the most important part of license
plate recognition system. The high accuracy rate of license plate recognition is depended on
the ability of license plate detection. This paper presents a novel method for license plate
localization bases on license plate features. This proposed method consists of two main
processes. First, candidate regions extraction step, Sobel operator is applied to obtain
vertical edges and then potential candidate regions are extracted by deploying mathematical
morphology operations [5]. Last, license plate verification step, this step employs the
standard deviation of license plate features to confirm license plate position. The
experimental results show that the proposed method can achieve high quality license plate
localization results with high accuracy rate of 98.26 %.
Improving traffic and emergency vehicle clearance at congested intersections ...IJECEIAES
Traffic signals play an important role in controlling and coordinating the traffic movement in cities especially in urban areas. As the traffic is exponentially increasing in cities and the pre-timed traffic light control is insufficient in effective timing of the traffic lights, it leads to poor traffic clearance and ultimately to heavy traffic congestion at intersections. Even the Emergency vehicles like Ambulance and Fire brigade are struck at such intersections and experience a prolonged waiting time. An adaptive and intelligent approach in design of traffic light signals is desirable and this paper contributes in applying fuzzy logic to control traffic signal of single four-way intersection giving priority to the Emergency vehicle clearance. The proposed control system is composed of two parallel controllers to select the appropriate lane for green signal and also to decide the appropriate green light time as per the real time traffic condition. Performance of the proposed system is evaluated by using simulations and comparing with pre-timed control system in changing traffic flow condition. Simulation results show significant improvement over the pre-timed control in terms of traffic clearance and lowering of Emergency vehicle wait time at the intersection especially when traffic intensity is high.
Adaptive traffic lights based on traffic flow prediction using machine learni...IJECEIAES
Traffic congestion prediction is one of the essential components of intelligent transport systems (ITS). This is due to the rapid growth of population and, consequently, the high number of vehicles in cities. Nowadays, the problem of traffic congestion attracts more and more attention from researchers in the field of ITS. Traffic congestion can be predicted in advance by analyzing traffic flow data. In this article, we used machine learning algorithms such as linear regression, random forest regressor, decision tree regressor, gradient boosting regressor, and K-neighbor regressor to predict traffic flow and reduce traffic congestion at intersections. We used the public roads dataset from the UK national road traffic to test our models. All machine learning algorithms obtained good performance metrics, indicating that they are valid for implementation in smart traffic light systems. Next, we implemented an adaptive traffic light system based on a random forest regressor model, which adjusts the timing of green and red lights depending on the road width, traffic density, types of vehicles, and expected traffic. Simulations of the proposed system show a 30.8% reduction in traffic congestion, thus justifying its effectiveness and the interest of deploying it to regulate the signaling problem in intersections.
The realistic mobility evaluation of vehicular ad hoc network for indian auto...ijasuc
In recent years, continuous progress in wireless communication has opened a new research field in
computer networks. Now a day’s wireless ad-hoc networking is an emerging research technology that
needs attention of the industry people and the academicians. A vehicular ad-hoc network uses vehicles as
mobile nodes to create mobility in a network.
It’s a challenge to generate realistic mobility for Indian networks as no TIGER or Shapefile map is
available for Indian Automotive Networks.
This paper simulates the realistic mobility of the Vehicular Ad-hoc Networks (VANETs). The key feature of
this work is the realistic mobility generation for the Indian Automotive Intelligent Transport System (ITS)
and also to analyze the throughput, packet delivery fraction (PDF) and packet loss for realistic scenario.
The experimental analysis helps in providing effective communication for safety to the driver and
passengers.
DYNAMIC RESOURCE ALLOCATION IN ROAD TRANSPORT SECTOR USING MOBILE CLOUD COMPU...IAEME Publication
Literature review revealed application of various techniques for efficient use of existing resources in road transport sector vehicles, operators and related facilities. This issue assumes bigger dimensions in situations where there are multiple routes and the demand in the routes is highly fluctuating over the day. The application of the existing techniques as reported in literature addresses above issues to a considerable extent. However the main draw back in existing techniques is lack of
proper uninterrupted information about vehicles and demand available at a central place for allocation of vehicles in different roads and huge computational times required for processing. Cloud computing is a recently developed processing tool that is used in effective utilization of resources in transport sector under dynamic resource allocation.
Abstract—This paper provides a brief overview of the Intelligent Traffic Management System based on Artificial
Neural Networks (ANN). It is being utilized to enhance the present traffic management system and human resource
reliance. The most basic problem with the current traffic lights is their dependency on humans for their working.
The technologies used in the making of this automated traffic lights are Internet of Things, Machine Learning and
Artificial Intelligence. The basic steps used in Internet of Things are reported along with different ANN trainings.
This ANN model can be used for the minimization of traffic on roads and less waiting time at traffic lights. As a
result, we can make traffic lights more automated which in turn eventually deceases our dependency on human
resources
An IoT based Dynamic Traffic Signal ControlGauthamSK4
Used Kerner three-phase traffic theory to establishing an Intelligent Traffic System that will provide automatic management of traffic lights based on the concept of the Internet of Things which will resolve the traffic jam issues which will in turn reduce CO2 emissions and also the mobility metrics like the travel time.
Compressed fuzzy logic based multi-criteria AODV routing in VANET environmentIJECEIAES
Vehicular ad hoc networks (VANETs) are the core of intelligent transportation systems (ITS) to obtain safety, better transportation services, and improved traffic management. Providing more reliable and efficient on demand routing protocol is one of the main challenges in these networks research scope. This paper argues a compressed fuzzy logic based method to enhance Ad hoc on demand distance vector (AODV) routing decision by jointly considering number of relays, distance factor, direction angle, and vehicles speed variance. The proposed scheme is simulated in both freeway and urban scenarios with different number of vehicles using real time interaction between both OMNet++ and SUMO simulators. Simulation results show that the proposed approach can get better performance in terms of packet delivery ratio, throughput, mean delay, and number of sent control packets.
A Hybrid Method for Automatic Traffic Control MechanismMangaiK4
Abstract—Traffic control method is an interconnection of sign devices positioned at road intersections, pedestrian crossings and different locations to manage competing flows of traffic. This work provides a novel idea and application procedures of priority and round robin scheduling algorithms. These algorithms methodologies are combined and a new hybrid automatic traffic control mechanism is proposed for efficient traffic and transportation management systems. This mechanism is necessary and it may be applied to modern cities wherever particular paths have more traffic jam compared to other paths of signal and wherever equal or normal traffic. This proposed hybrid approach applies priority scheduling concept to specific paths which has more traffic, on the other hand, this hybrid approach uses round robin scheduling concept for normal traffic signals. This mechanism is well suited for controlling the traffic of modern and old cities,both pre planned and not pre planned before construction. Some general conclusions and promising future research topics are also provided.
Similar to Help the Genetic Algorithm to Minimize the Urban Traffic on Intersections (20)
Welcoming the research scholars, scientists around the globe in the Open Access Dimension, IJORCS is now accepting manuscripts for its next issue (Volume 4, Issue 4). Authors are encouraged to contribute to the research community by submitting to IJORCS, articles that clarify new research results, projects, surveying works and industrial experiences that describe significant advances in field of computer science.
All paper submissions (http://www.ijorcs.org/submit-paper) are received and managed electronically by IJORCS Team. Detailed instructions about the submission procedure are available on IJORCS website (http://www.ijorcs.org/author-guidelines)
FPGA Implementation of FIR Filter using Various Algorithms: A RetrospectiveIJORCS
This Paper is a review study of FPGA implementation of Finite Impulse response (FIR) with low cost and high performance. The key observation of this paper is an elaborate analysis about hardware implementations of FIR filters using different algorithm i.e., Distributed Arithmetic (DA), DA-Offset Binary Coding (DA-OBC), Common Sub-expression Elimination (CSE) and sum-of-power-of-two (SOPOT) with less resources and without affecting the performance of the original FIR Filter.
Using Virtualization Technique to Increase Security and Reduce Energy Consump...IJORCS
An approach has been presented in this paper in order to generate a secure environment on internet Based Virtual Computing platform and also to reduce energy consumption in green cloud computing. The proposed approach constantly checks the accuracy of stored data by means of a central control service inside the network environment and also checks system security through isolating single virtual machines using a common virtual environment. This approach has been simulated on two types of Virtual Machine Manager (VMM) Quick EMUlator (Qemu), HVM (Hardware Virtual Machine) Xen and outputs of the simulation in VMInsight show that when service is getting singly used, the overhead of its performance will be increased. As a secure system, the proposed approach is able to recognize malicious behaviors and assure service security by means of operational integrity measurement. Moreover, the rate of system efficiency has been evaluated according to the amount of energy consumption on five applications (Defragmentation, Compression, Linux Boot Decompression and Kernel Boot). Therefore, this has been resulted that to secure multi-tenant environment, managers and supervisors should independently install a security monitoring system for each Virtual Machines (VMs) which will come up to have the management heavy workload of. While the proposed approach, can respond to all VM’s with just one virtual machine as a supervisor.
Algebraic Fault Attack on the SHA-256 Compression FunctionIJORCS
The cryptographic hash function SHA-256 is one member of the SHA-2 hash family, which was proposed in 2000 and was standardized by NIST in 2002 as a successor of SHA-1. Although the differential fault attack on SHA-1compression function has been proposed, it seems hard to be directly adapted to SHA-256. In this paper, an efficient algebraic fault attack on SHA-256 compression function is proposed under the word-oriented random fault model. During the attack, an automatic tool STP is exploited, which constructs binary expressions for the word-based operations in SHA-256 compression function and then invokes a SAT solver to solve the equations. The simulation of the new attack needs about 65 fault injections to recover the chaining value and the input message block with about 200 seconds on average. Moreover, based on the attack on SHA-256 compression function, an almost universal forgery attack on HMAC-SHA-256 is presented. Our algebraic fault analysis is generic, automatic and can be applied to other ARX-based primitives.
Enhancement of DES Algorithm with Multi State LogicIJORCS
The principal goal to design any encryption algorithm must be the security against unauthorized access or attacks. Data Encryption Standard algorithm is a symmetric key algorithm and it is used to secure the data. Enhanced DES algorithm works on increasing the key length or complex S-BOX design or increased the number of states in which the information is to be represented or combination of above criteria. By increasing the key length, the number of combinations for key will increase which is hard for the intruder to do the brute force attack. As the S-BOX design will become the complex there will be a good avalanche effect. As the number of states increases in which the information is represented, it is hard for the intruder to crack the actual information. Proposed algorithm replace the predefined XOR operation applied during the 16 round of the standard algorithm by a new operation called “Hash function” depends on using two keys. One key used in “F” function and another key consists of a combination of 16 states (0,1,2…13,14,15) instead of the ordinary 2 state key (0, 1). This replacement adds a new level of protection strength and more robustness against breaking methods.
Hybrid Simulated Annealing and Nelder-Mead Algorithm for Solving Large-Scale ...IJORCS
This paper presents a new algorithm for solving large scale global optimization problems based on hybridization of simulated annealing and Nelder-Mead algorithm. The new algorithm is called simulated Nelder-Mead algorithm with random variables updating (SNMRVU). SNMRVU starts with an initial solution, which is generated randomly and then the solution is divided into partitions. The neighborhood zone is generated, random number of partitions are selected and variables updating process is starting in order to generate a trail neighbor solutions. This process helps the SNMRVU algorithm to explore the region around a current iterate solution. The Nelder- Mead algorithm is used in the final stage in order to improve the best solution found so far and accelerates the convergence in the final stage. The performance of the SNMRVU algorithm is evaluated using 27 scalable benchmark functions and compared with four algorithms. The results show that the SNMRVU algorithm is promising and produces high quality solutions with low computational costs.
Welcoming the research scholars, scientists around the globe in the Open Access Dimension, IJORCS is now accepting manuscripts for its next issue (Volume 4, Issue 2). Authors are encouraged to contribute to the research community by submitting to IJORCS, articles that clarify new research results, projects, surveying works and industrial experiences that describe significant advances in field of computer science.
To view complete list of topics coverage of IJORCS, Aim & Scope, please visit, www.ijorcs.org/scope
Welcoming the research scholars, scientists around the globe in the Open Access Dimension, IJORCS is now accepting manuscripts for its next issue (Volume 4, Issue 1). Authors are encouraged to contribute to the research community by submitting to IJORCS, articles that clarify new research results, projects, surveying works and industrial experiences that describe significant advances in field of computer science.
Voice Recognition System using Template MatchingIJORCS
It is easy for human to recognize familiar voice but using computer programs to identify a voice when compared with others is a herculean task. This is due to the problem that is encountered when developing the algorithm to recognize human voice. It is impossible to say a word the same way in two different occasions. Human speech analysis by computer gives different interpretation based on varying speed of speech delivery. This research paper gives detail description of the process behind implementation of an effective voice recognition algorithm. The algorithm utilize discrete Fourier transform to compare the frequency spectra of two voice samples because it remained unchanged as speech is slightly varied. Chebyshev inequality is then used to determine whether the two voices came from the same person. The algorithm is implemented and tested using MATLAB.
Channel Aware Mac Protocol for Maximizing Throughput and FairnessIJORCS
The proper channel utilization and the queue length aware routing protocol is a challenging task in MANET. To overcome this drawback we are extending the previous work by improving the MAC protocol to maximize the Throughput and Fairness. In this work we are estimating the channel condition and Contention for a channel aware packet scheduling and the queue length is also calculated for the routing protocol which is aware of the queue length. The channel is scheduled based on the channel condition and the routing is carried out by considering the queue length. This queue length will provide a measurement of traffic load at the mobile node itself. Depending upon this load the node with the lesser load will be selected for the routing; this will effectively balance the load and improve the throughput of the ad hoc network.
A Review and Analysis on Mobile Application Development Processes using Agile...IJORCS
Over a last decade, mobile telecommunication industry has observed a rapid growth, proved to be highly competitive, uncertain and dynamic environment. Besides its advancement, it has also raised number of questions and gained concern both in industry and research. The development process of mobile application differs from traditional softwares as the users expect same features similar to their desktop computer applications with additional mobile specific functionalities. Advanced mobile applications require assimilation with existing enterprise computing systems such as databases, legacy applications and Web services. In addition, the lifecycle of a mobile application moves much faster than that of a traditional Web application and therefore the lifecycle management associated therein must be adjusted accordingly. The Security and application testing are more stimulating and interesting in mobile application than in Web applications since the technology in mobile devices progresses rapidly and developers must stay in touch with the latest developments, news and trends in their area of work. With the rising competence of software market, researchers are seeking more flexible methods that can adjust to dynamic situations where software system requirements are changing over time, producing valuable software in short duration and within low budget. The intrinsic uncertainty and complexity in any software project therefore requires an iterative developmental plan to cope with uncertainty and a large number of unknown variables. Agile Methodologies were thus introduced to meet the new requirements of the software development companies. The agile methodologies aim at facilitating software development processes where changes are acceptable at any stage and provide a structure for highly collaborative software development. Therefore, the present paper aims in reviewing and analysing different prevalent methodologies utilizing agile techniques that are currently in use for the development of mobile applications. This paper provides a detailed review and analysis on the use of agile methodologies in the proposed processes associated with mobile application skills and highlights its benefit and constraints. In addition, based on this analysis, future research needs are identified and discussed.
Congestion Prediction and Adaptive Rate Adjustment Technique for Wireless Sen...IJORCS
In general, nodes in Wireless Sensor Networks (WSNs) are equipped with limited battery and computation capabilities but the occurrence of congestion consumes more energy and computation power by retransmitting the data packets. Thus, congestion should be regulated to improve network performance. In this paper, we propose a congestion prediction and adaptive rate adjustment technique for Wireless Sensor Networks. This technique predicts congestion level using fuzzy logic system. Node degree, data arrival rate and queue length are taken as inputs to the fuzzy system and congestion level is obtained as an outcome. When the congestion level is amidst moderate and maximum ranges, adaptive rate adjustment technique is triggered. Our technique prevents congestion by controlling data sending rate and also avoids unsolicited packet losses. By simulation, we prove the proficiency our technique. It increases system throughput and network performance significantly.
A Study of Routing Techniques in Intermittently Connected MANETsIJORCS
A Mobile Ad hoc Network (MANET) is a self-configuring infrastructure less network of mobile devices connected by wireless. These are a kind of wireless Ad hoc Networks that usually has a routable networking environment on top of a Link Layer Ad hoc Network. The routing approach in MANET includes mainly three categories viz., Reactive Protocols, Proactive Protocols and Hybrid Protocols. These traditional routing schemes are not pertinent to the so called Intermittently Connected Mobile Ad hoc Network (ICMANET). ICMANET is a form of Delay Tolerant Network, where there never exists a complete end – to – end path between two nodes wishing to communicate. The intermittent connectivity araise when network is sparse or highly mobile. Routing in such a spasmodic environment is arduous. In this paper, we put forward the indication of prevailing routing approaches for ICMANET with their benefits and detriments
Improving the Efficiency of Spectral Subtraction Method by Combining it with ...IJORCS
In the field of speech signal processing, Spectral subtraction method (SSM) has been successfully implemented to suppress the noise that is added acoustically. SSM does reduce the noise at satisfactory level but musical noise is a major drawback of this method. To implement spectral subtraction method, transformation of speech signal from time domain to frequency domain is required. On the other hand, Wavelet transform displays another aspect of speech signal. In this paper we have applied a new approach in which SSM is cascaded with wavelet thresholding technique (WTT) for improving the quality of speech signal by removing the problem of musical noise to a great extent. Results of this proposed system have been simulated on MATLAB.
An Adaptive Load Sharing Algorithm for Heterogeneous Distributed SystemIJORCS
Due to the restriction of designing faster and faster computers, one has to find the ways to maximize the performance of the available hardware. A distributed system consists of several autonomous nodes, where some nodes are busy with processing, while some nodes are idle without any processing. To make better utilization of the hardware, the tasks or load of the overloaded node will be sent to the under loaded node that has less processing weight to minimize the response time of the tasks. Load balancing is a tool used effectively for balancing the load among the systems. Dynamic load balancing takes into account of the current system state for migration of the tasks from heavily loaded nodes to the lightly loaded nodes. In this paper, we devised an adaptive load-sharing algorithm to balance the load by taking into consideration of connectivity among the nodes, processing capacity of each node and link capacity.
The Design of Cognitive Social Simulation Framework using Statistical Methodo...IJORCS
Modeling the behavior of the cognitive architecture in the context of social simulation using statistical methodologies is currently a growing research area. Normally, a cognitive architecture for an intelligent agent involves artificial computational process which exemplifies theories of cognition in computer algorithms under the consideration of state space. More specifically, for such cognitive system with large state space the problem like large tables and data sparsity are faced. Hence in this paper, we have proposed a method using a value iterative approach based on Q-learning algorithm, with function approximation technique to handle the cognitive systems with large state space. From the experimental results in the application domain of academic science it has been verified that the proposed approach has better performance compared to its existing approaches.
An Enhanced Framework for Improving Spatio-Temporal Queries for Global Positi...IJORCS
To efficiently process continuous spatio-temporal queries, we need to efficiently and effectively handle large number of moving objects and continuous updates on these queries. In this paper, we propose a framework that employs a new indexing algorithm that is built on top of SQL Server 2008 and avoid the overhead related to R-Tree indexing. To answer range queries, we utilize dynamic materialized view concept to efficiently handle update queries. We propose an adaptive safe region to reduce communication costs between the client and the server and to minimize position update load. Caching of results was utilized to enhance the overall performance of the framework. To handle concurrent spatio-temporal queries, we utilize publish/subscribe paradigm to group similar queries and efficiently process these requests. Experiments show that the overall proposed framework performance was able to outperform R-Tree index and produce promising and satisfactory results.
A PSO-Based Subtractive Data Clustering AlgorithmIJORCS
There is a tremendous proliferation in the amount of information available on the largest shared information source, the World Wide Web. Fast and high-quality clustering algorithms play an important role in helping users to effectively navigate, summarize, and organize the information. Recent studies have shown that partitional clustering algorithms such as the k-means algorithm are the most popular algorithms for clustering large datasets. The major problem with partitional clustering algorithms is that they are sensitive to the selection of the initial partitions and are prone to premature converge to local optima. Subtractive clustering is a fast, one-pass algorithm for estimating the number of clusters and cluster centers for any given set of data. The cluster estimates can be used to initialize iterative optimization-based clustering methods and model identification methods. In this paper, we present a hybrid Particle Swarm Optimization, Subtractive + (PSO) clustering algorithm that performs fast clustering. For comparison purpose, we applied the Subtractive + (PSO) clustering algorithm, PSO, and the Subtractive clustering algorithms on three different datasets. The results illustrate that the Subtractive + (PSO) clustering algorithm can generate the most compact clustering results as compared to other algorithms.
Dynamic Map and Diffserv Based AR Selection for Handoff in HMIPv6 Networks IJORCS
In HMIPv6 Networks, most of the existing handoff decision mechanisms deal mainly with the selection of Mobility Anchor Point (MAP), ignoring the selection of access router (AR) under each MAP. In this paper, we propose a new mechanism called “Dynamic MAP and Diffserv based ARs selection for Handoff in HMIPv6 networks” and it deals with selecting the MAP as well as ARs. MAP will be selected dynamically by checking load, session mobility ratio (SMR), Binding update cost and Location Rate. After selecting the best MAP, the Diffserv approach is used to select the AR under the MAP, based on its resource availability. The AR is implemented at the edge router of Diffserv. DiffServ can be used to provide low-latency to critical network traffic such as voice or streaming media while providing simple best-effort service to non-critical services such as web traffic or file transfers. By using this mechanism, we can assure that better resource utilization and throughput can be attained during Handoff in HMIPv6 networks.
"Impact of front-end architecture on development cost", Viktor TurskyiFwdays
I have heard many times that architecture is not important for the front-end. Also, many times I have seen how developers implement features on the front-end just following the standard rules for a framework and think that this is enough to successfully launch the project, and then the project fails. How to prevent this and what approach to choose? I have launched dozens of complex projects and during the talk we will analyze which approaches have worked for me and which have not.
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Ramesh Iyer
In today's fast-changing business world, Companies that adapt and embrace new ideas often need help to keep up with the competition. However, fostering a culture of innovation takes much work. It takes vision, leadership and willingness to take risks in the right proportion. Sachin Dev Duggal, co-founder of Builder.ai, has perfected the art of this balance, creating a company culture where creativity and growth are nurtured at each stage.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
To Graph or Not to Graph Knowledge Graph Architectures and LLMs
Help the Genetic Algorithm to Minimize the Urban Traffic on Intersections
1. International Journal of Research in Computer Science
eISSN 2249-8265 Volume 4 Issue 4 (2014) pp. 9-19
www.ijorcs.org, A Unit of White Globe Publications
HELP THE GENETIC ALGORITHM TO MINIMIZE THE
URBAN TRAFFIC ON INTERSECTIONS
Dadmehr Rahbari
University of Applied Science and Technology, IRAN
Email: d_rahbari@yahoo.com
Abstract: Control of traffic lights at the intersections
of the main issues is the optimal traffic. Intersections
to regulate traffic flow of vehicles and eliminate
conflicting traffic flows are used. Modeling and
simulation of traffic are widely used in industry. In
fact, the modeling and simulation of an industrial
system is studied before creating economically and
when it is affordable. The aim of this article is a smart
way to control traffic. The first stage of the project
with the objective of collecting statistical data (cycle
time of each of the intersection of the lights of vehicles
is waiting for a red light) steps where the data
collection found optimal amounts next it is.
Introduced by genetic algorithm optimization of
parameters is performed. GA begin with coding step
as a binary variable (the range specified by the initial
data set is obtained) will start with an initial
population and then a new generation of genetic
operators mutation and crossover and will Finally,
the members of the optimal fitness values are selected
as the solution set. The optimal output of Petri nets
CPN TOOLS modeling and software have been
implemented. The results indicate that the
performance improvement project in intersections
traffic control systems. It is known that other data
collected and enforced intersections of evolutionary
methods such as genetic algorithms to reduce the
waiting time for traffic lights behind the red lights and
to determine the appropriate cycle.
Keywords: Urban Traffic, Petri Net, Genetic
Algorithm.
I. INTRODUCTION
The Goal of this project is to obtain the optimal
cycle traffic lights at the intersection. To find time for
each cycle of the traffic lights are red, yellow and
green is the average number of waiting cars at behind
of a red light. Traffic Modeling with Petri nets in CPN
TOOLS software simulations has been conducted.
Data collection was performed at various times as the
objectively reasonable sample has been collected. The
results of the genetic algorithm is used to optimize the
design so that the chromosome based on 14
parameters (5 for the intersection lighting cycle time,
cycle time 5 to the second intersection lights, light, on
the intersection of the first two, to wait for an average
of vehicles and two average cars waiting at a red light
to the second intersection), coding (how to convert
binary digits the actual amount of decimal and vice
versa), mutation operators (to create diversity in the
population), crossover (to converge to the optimal)
fitness function (assessment of chromosomes in
population) and elitism selection (to select the number
of inhabitants to move to the next generation) are
described in detail in the relevant sections.
All system controls the timing of traffic lights after
crossing lights as decision variables in the objective
function in order to meet minimum system
requirements. The decision variables include the
proportion of green time of each phase, cycle length,
number of phases, the offset is. Various objective
functions such as energy loss, reducing delays,
reducing the number of vehicles stopped at the
intersection, reduce the length of queues, increase
safety, etc., is considered the beginning of the traffic
light control system for different types of systems
have been created under as controls when the controls
have been categorized prematurely[1]. Other divisions
such as independent monitoring, control and
accountability varies depending on time of day and
traffic controls exist. This is set in Table 1 is
presented. Variable three generations of light-
controlled junctions in a variety of computer programs
with a view to expanding the use of computer
processors are included. This controls how a software
www.ijorcs.org
2. 10 Dadmehr Rahbari
system, based on information received from
computed vehicles and pedestrians, and other inputs
to recognition of designer (eg weather conditions) are
determined. Table 2 presents a set of best known and
most widely used of these systems are discussed [2].
In [3]a traffic control signal to adjust their schedule.
This is a discrete time model optimized for signd areas
marked provides a real-time embedded controller and
the controller signal timing based on technical
constraints, physical and specifies operations. In
[4]proposed a system for wireless traffic light
controller both manual mode and automatic. Manual
control of traffic lights to change with the traffic
police to provide With the push of a button on the
streets for a Green Mark provides. In automatic mode
traffic light controller board, LED sequence according
to a predetermined pattern, and latency changes that
will help the police to be able to dynamically change
the flow of traffic. In [5] a fuzzy logic based smart
traffic light simulator design presented. Traffic
junction simulator hardware is to overcome the
problems of working in a real environment to develop
and test the controller performance. Simulation results
using traffic lights with light controller based on fuzzy
logic is compared for constant and controller. The
results showed that the controller reduced the waiting
time at red lights. In [6] the effects of traffic lights at
intersections to optimize evacuation routes were
investigated. They believed that an intersection with
traffic lights consist of a series of sketches of the
windows when the term is assigned. Considering the
delay and the capacity allocated to each intersection in
the direction of discharge flow path, Compound
labeling algorithm for the minimum cost network
traffic is proposed. In numerical examples with
different latencies compared Evacuation Routes which
showed that the proposed method can be a good result
considering the time of his discharge in path
optimization.
In [7] of the network traffic signal control strategy
is presented. They propose a model to simulate the
UTNS where the road network topology dynamically
directed graph is given by CTM cell transfer model of
traffic flow and transport modeling is and then a state
feedback control law is designed to achieve stable
agreements under which the proposed control system.
In [8] a distributed and adaptive traffic signal
control to provide a realistic traffic simulation. This
method of traffic control algorithms based
observations suggest that the traffic generated by
sensing devices existing local communication between
traffic lights and driving convenience. This method
allows features to be updated frequently to adapt to
the current traffic demand. Given the proposed
adaptive system simulation environment CUMO,
overall network performance garnered a higher level.
Several applications of hybrid Petri Net is presented in
the various articles. The oil industry and oil pipelines,
in [9] to model the transmission lines and oil storage
tanks using HPN described in[10] a short time to
transport crude oil to refineries in Port through
transmission lines is presented. Also in [11] for the
automated online fault monitoring using hybrid Petri
net is done. For intercity traffic problem, in [12]
traffic and car speed in a road tunnel with HPN
models and interventions to prevent accidents in the
tunnel is presented [13]a model based on hybrid Petri
net for the Category movement intercity trains and
avoid collisions with each other and the train
crossings cross- other vehicles on rail tracks designed.
As well as numerous works by using hybrid Petri nets
for modeling, control and optimization of network
traffic have been done. For example, in [14] model of
an urban intersection using hybrid Petri nets have
gained. In this model, the associated status indicator
corresponding to a given area's streets, neighborhoods
have been applied consistently 4 to isolate areas of our
neighbors. In [15] a typical intersection using a
method similar to [16] have modeled. In this paper,
the optimal timing of traffic lights at each phase of the
streets leading to the intersection number of vehicles
expected to be calculated. In the next cycle, the
information flows from the streets into the streets
leading to the intersection of the current cycle, is
obtained.
In [17] the intersection of the model with hybrid
Petri nets attached to each block consists of a hybrid
Petri net is simulated. The block consists of hybrid
Petri nets as a time delay which represents the
movement of vehicles between the two intersections
leading to the street. In [18] In addition to modeling
the hybrid Petri nets, with the introduction of the
concept as a way to obtain the shock wave, the flow
discontinuities between flows vehicles when there are
such intersections is presented.
II. THE PETRI NET
Petri net is a powerful tool for modeling
concurrency and provides more context than queuing
networks. In addition to the structure and behavior of
Petri nets are a formal, graphical display that is why
www.ijorcs.org
3. Help the Genetic Algorithm to Minimize the Urban Traffic on Intersections 11
they are modeled by easy. One reason for the success
of Petri nets is their simplicity, but the simplicity is
sometimes difficult to model complex systems. Many
features have been added to the basic model of Petri
nets to the modeling, it will increase and can be used
in various fields. Petri nets graphically displayed to
illustrate the theoretical concepts of Petri nets is very
useful. Petri net structure of Petri nets to provide a
graph in which there are two types of nodes. The
barriers in the form of a circle (O) and line (|) indicate
that abrasive tracks are places and marker lines. These
places the tracks are connected to each other by
transition. Transfer from one place to another place,
indicating that it will be passed as output and if it
draws an arc from a place to a transition indicates that
it will be the entrance to the pass[19].
One of the concepts that should be considered in
the evaluation of the performance of talk time.
Colored Petri nets in the concept of Global at the time
of the element name defined. It expresses the values
that are at the disposal of the model. This time can be
an integer or a real number representing the discrete
time which represents the time has come. Besides
being include every nut, some referable, can be
applied to any bead that amount of time. This amount
of time is called time stamp. time stamp represents the
first time that the beads can be used.
In a colored Petri net is based on the time when the
bolts are in place and guard the entrance of a transfer
of the transmission is established in this case, the
desired transformation is activated. But for this
transition can be sure that the fire is in a state of
readiness. When transfer is in standby mode, the
transmission input housings beads are smaller or equal
to the current time. For an event that takes r time units
into a colored Petri net model, The corresponding
transition event, which took thousands of stamp seals
for nut production output r time units larger than the
global time at which the transfer occurred. This means
that the pieces produced by r time units are not
available. Time based on colored Petri nets, while the
current model, no transition was not ready, Time to
pull the system down to at least one transition is in
standby mode. Various tools that can support this kind
of network software Design / CPN named. Using the
graphical user interface of the software, can be
colored Petri net models can be easily traced. You can
also use this animation software (stepwise
implementation) of colored Petri net models, Create a
state space model of colored Petri net, to model the
behavior of a user-defined query and create output
files for the model simulation results are also
provided. CPN models are the benefits that can be
mentioned the following:
Due to the hierarchical model can be drawn from
these techniques can be combined to obtain or reuse of
models can be used. For each transition can be defined
as the time it takes to fire the bolts can be given that
any time a character is also, useful tool for evaluating
performance and other issues related to time. Place
combines a natural way to combine hierarchical
colored Petri nets model is. Timing of the transition in
the Petri net: To create a time delay in the transition
from the Transition Place the following steps should
be taken: Defines the color of the closet:
No = with R | G | Y timed;
Define the variable as
Var a: No;
The Place for No and ◊ study of a defined type.
Place the required amount of sample R @ + 5, from 5
to start the transition and the transition in the
Transition can the formula for the passage of time @
10+ write transition the passage of any 10. CPN Tools
for modeling software proud 4 traffic lights in two
intersections are shown in Figure . To design such a
model, we first create an empty Petri nets. Place the
tool bar and then put it on the network by using the
Style tool to the red, green and yellow in it. Transition
between Places to put some transition state. The next
phase of traffic lights cycles using the Arc tool
connects us. We do this for both lights. Then, using
whatever tools Yellow Arc of Transition transitions of
traffic lights using the tool called X that represents the
intersection Place, the connect them. Is required on
each arc is a variable whose type was defined as the
amount of our No. The optimal values of the genetic
algorithm to optimize the lights that have earned the
tool between any two Place in Transition (@ + x), we
write to you indicate a time delay switch the lights
from one state to another.
III. OPTIMIZATION USING GENETIC
ALGORITHMS
Genetic algorithm to simultaneously consider
multiple points of the search space and thus increases
the chances that converge to a local maximum,
decreases. Search in more conventional ways, the
decision rule governing this case serves to move from
one point to another in a matter of searching this way
can have a maximum bite. Because they may
converge to a local maximum. But the whole
www.ijorcs.org
4. 12 Dadmehr Rahbari
Figure 1: Modeling by Petri Net
population of the genetic algorithm (strings) to
produce and test each point individually by combining
quality (content) of spots, a new population, which
includes the improvement of has the form. Apart from
doing a search, consider the same number of points in
the genetic algorithm, which makes it adaptable to
parallel machines because of the evolution of each
point, is an independent process. The genetic
algorithm only requires information on the quality of
the solutions produced by each set of variables. If
some optimization methods require derivative
information or even need to have a complete
understanding of the structure of matter and variables.
Because genetic Algorithm not require such specific
information on the issue is thus more flexible than
most search methods. The genetic algorithm is a
search method, which is to guide the search for
methods of use random selection will vary. Although
the decision as to define methods of accident and
chance, but the search space is not a random walk.
Genetic algorithms are suitable for the crash exploit a
priori knowledge they use to solve the nearly optimal
to quickly reach it.
The coding problem and a fitness function to
determine the barrier population over generations by
using the operators of selection, mutation and cutting,
elitism is to involve the local optimal solutions[20].
Elitism in the replacement of a case is done.
The coding of chromosomes and the problem:
110 ...
111
101 ...011010 ... 101
111 ...
101
x13 x14x11 x12
x6 x7 x8
x9 x10
x1 x2 x3
x4 x5
The
number of
cars
waiting
for the
red lights
at the
crossroad
s TL3 and
TL4 II
TL1 and
TL2
number of
cars
waiting
for a red
light at the
intersectio
n of
5 stages of
the cycle
time of the
second
crossing
lights
5 stages of
the cycle
time of
the first
crossing
lights
Figure 2: Coding Problem in Genetic Algorithms
Because the chromosomes are composed of a
number of genes in the gene is considered a digit
between is zero and 10 . Xi is the number of
parameters (x1, x2, and X14) and 8 bits for each
www.ijorcs.org
5. Help the Genetic Algorithm to Minimize the Urban Traffic on Intersections 13
parameter is selected. For example, to convert
decimal number from 1 to 8 bits, the bits x1 and
convert the decimal number from 9 to 16, the value of
x2 as well as X14 ..
• 2 lights with different colors
• green (G), orange (O), or red (R)
• Any integer means the time (in seconds) of each
cycle is a light in the intersection.
• The binary chromosome becomes.
A. Fitness function
Fitness Changes in the genetic algorithm as the
fitness function, the objective function is considered.
In this case the fitness function is based on an average
cycle time of traffic lights. This function has 14
parameters which are specified range of values[21].
Linespace function in Matlab software the specified
range is divided into 100 so that the fitness value is
used calculation. This function has a minimum and
maximum value and the boundary value of the
chromosome is randomly generated value between
these two values to be given. Limit values based on
data obtained from the data collection phase of the
two intersections Flowers and knowledge of
governmental requirements. These values include
cycle time lights at two intersections and the number
of cars waiting for the red light is back. Since genetic
algorithms are used to calculate the maximum
amounts referred to reverse the charges.
Definition of fitness function:
Fitness(gen) = ( (x1(gen) + x2(gen) + x3(gen) +
x4(gen) + x5(gen))*(x11(gen) + x12(gen)) +
(x6(gen) + x7(gen) + x8(gen) + x9(gen) +
x10(gen))*(x13(gen)+x14(gen)) ) / 14 ;
Average time to complete cycle lights at both
intersections with the number of cars waiting behind a
red light, according to the following parameters are
determined.
Parameters x1 x2 x3 x4 x5 for the first 5 stages of the
cycle crossing lights, x6 x7 x8 x9 x10 parameters for
the 5 stages of the second intersection lights cycle
time parameters for the number of cars waiting behind
x11 x12 TL0 and TL1 red lights at the intersection of
First and parameters the number of cars waiting for
the red lights x13 x14 TL2 and TL3 are at the second
intersection. The total cycle time for each intersection
lights on top of the total number of cars waiting for
the red lights would be multiplied The total cycle time
for each intersection lights on the total number of cars
waiting for the red light becomes multiplied by the
average of these values is calculated.
B. Selection Operator
The selection of parents in genetic algorithms to
further its chances of reproduction of the members
that have higher fitness. There are several ways to do
this. A technique that is commonly used selection
method using a wheel. The implementation of this
method is as follows: A - the fitness of all members of
the population and thus the suitability of the call stack.
(B) a randomly generated number n, so that it is a
number between zero and total fitness. (C) The first
member of the population that add elegance to the
fitness of the population of the former is larger than or
equal to n restore[22]. Effects of parental choice back
wheel of a parent is randomly selected. Although the
selection process is random, the chance that each
parent is selected is directly proportional to its fitness.
The balance in the number of generations the
genetic algorithm with the lowest fitness of the
disposal and the release of genetic material in the most
graceful members of help. It may be the worst
member of the population can be chosen by the
algorithm (because anyway there is a random element
in the algorithm.) In the population acts of violence,
however, are negligible and the assumption that
members of a generation, the next generation is much
more likely to desorption. However, after many
generations, the members of the population are
excreted. Parents should be careful in the process of
selecting a range of fitness levels should be positive
integers.
C. Crossover operator
The performance of this operator and mutation
operator causes the fibers produced during
reproduction, the parents are different disciplines. In
nature, this function occurs when two parents
exchange portions of their corresponding fields and
genetic algorithms, operator communication,
exchange of genetic material between the parent
sequences to the child (discipline) create there. There
are several types of exchange operator. But the most
famous exchange operator used in genetic algorithm is
a function of a point[23]. The genetic algorithm is the
operator in the manner described below may apply.
www.ijorcs.org
6. 14 Dadmehr Rahbar
Figure 3: A view of the intersection operator
To be able to use this function need to have two
fields. The selection operator is applied to the current
population of the two strands of the double-take then
do a test to determine the probability that the
exchange operator acts on two fields it or not. This
test is done using a heterogeneous coin, this means
that the probability (P crossover) milk and with
probability of crossover line comes from. For
example, if the applied field with a tap on the coin
exchange operator, we assume that we have thrown a
coin into the milk. Then enter the next phase of the
implementation of the exchange operator, we generate
a random number between one and the length of the
string. After determining the location of the integer
that represents the exchange of strings two strands of
the location of this specifies the number of broken and
distal parts are interchangeable with each other. All
parts are separated from each other are connected to
the new string is obtained.
D. Mutation Operator
The operator is also one of the operators of genetic
algorithms and the ability to use genetic algorithms to
find near-optimal solutions increases. Mutations,
random changes in the value field is a special
situation. By applying this operator characteristic that
is absent in the parent population, is created. Because
mutations alter a gene, i.e. if the value is zero, and
vice versa if it is a zero. So why the change is
characterized by a series of premature convergence
and to not be perfect. Because one of the causes of
premature convergence of the population is members
of the same mutation causes the same probability of
being members of the new population is much
reduced. The implementation of this function is
described below.
Fig 4. Mutation Operator
This operator, unlike the exchange operator to
compare two strings needed to cover a range of needs,
after the exchange operator acts on two fields and two
new strings to the operator of mutations to the double-
stranded is applied to either separately. The method is
applied to the individual elements of a string, mutation
testing is done. If this test is successful, the status is
changed from one to zero or from zero to one, and the
so-called mutations. Test the possibility of using
heterogeneous coin with probability (P crossover)
milk and with probability line comes with a coin toss
will be done and if the milk is collected bit value of
the mutation the[24]. As noted above, the probability
for each state of a field test should be performed. In
other words, for every mutation released once the coin
is heterogeneous with regard to the outcome, finds
little bit mutation or a mutation goes no further.
E. Elitism
With regard to a possible value can be a percentage
of the population without mutation and crossover
operators are transferred to the next generation. This
amount is likely to vary depending on the values that
make up the result set. Genetic algorithm performance
is significantly dependent on the different stages of
the skins. For instance, each of the following: improve
the efficiency of the routing issues.
F. Genetic Algorithm Settings
During several performances, the best parameter
values of the genetic algorithm are obtained as
follows. Total population = 20, number of generations
or iterations = 200, length = 80 chromosomes, the
number of parameters: 10, Pm: probability of
mutation equal to 0.02, Pc: probability of crossover
operator is equal to 0.5, elitism rate: 0.02 times the
risk of elitism.
IV. SIMULATION AND RESULTS
To evaluate the proposed approach to data integrity
requirements that is listed below. Assists the
intersection of knowledge and statistical data are
collected in sampling. At each intersection of the 20
www.ijorcs.org
7. Help the Genetic Algorithm to Minimize the Urban Traffic on Intersections 15
samples taken at different times. Samples so that the
number of cars waiting behind a red light at the
intersection of the two traffic lights at each
intersection with traffic lights there are a total of 4.
The data collected are given in the following tables.
Table 1: Number of cars behind traffic lights at each intersection
Row
Cars at a red
light TL1
By a red light
TL2
The number
of cars at a
red light TL3
The number of
cars at a red
light TL4
Count/Hour Count/Hour Count/Hour Count/Hour
1 33 19:00 25 19:00 35 19:00 5 19:00
2 25 19:05 30 19:05 25 19:05 10 19:05
3 26 19:10 33 19:10 28 19:10 8 19:10
4 36 19:15 40 19:15 21 19:15 12 19:15
5 22 19:20 34 19:20 27 19:20 11 19:20
6 26 19:25 35 19:25 28 19:25 14 19:25
7 30 19:30 40 19:30 29 19:30 16 19:30
8 28 19:35 38 19:35 26 19:35 18 19:35
9 38 19:40 42 19:40 32 19:40 15 19:40
10 35 19:45 40 19:45 35 19:45 22 19:45
11 40 19:50 39 19:50 29 19:50 23 19:50
12 48 19:55 48 19:55 31 19:55 20 19:55
13 46 20:00 46 20:00 38 20:00 28 20:00
14 49 20:05 49 20:05 41 20:05 31 20:05
15 51 20:10 45 20:10 45 20:10 26 20:10
16 58 20:15 51 20:15 48 20:15 33 20:15
17 55 20:20 55 20:20 51 20:20 36 20:20
18 62 20:25 46 20:25 54 20:25 33 20:25
19 54 20:30 50 20:30 55 20:30 38 20:30
20 60 20:35 54 20:35 58 20:35 37 20:35
Table 2. Line Cycle in intersections
Light Cycle
1
Light Cycle
2
Light
Cycle 3
Light
Cycle 4
TL1 Sec TL2 Sec TL3 Sec TL4 Sec
G 38 G 40 G 60 G 22
Y 5 Y 5 Y 5 Y 5
R 50 R 40 R 30 R 66
www.ijorcs.org
8. 16 Dadmehr Rahbar
The simulation results were compared to a standard
amount of fitness is. In this diagram the horizontal
axis and the vertical axis represents the number of
generations of genetic algorithm is the fitness values.
Comparing the Best Value for the symptoms ο red,
medium blue with pluses and worst of green Light,
fitness values over generations in the chart are
completed.
Figure 5:. Charts the best, average and worst fitness values
based on a generational advance
Charts the best, average and worst fitness values
based on generational progression downward based on
a function of cycle time and number of cars waiting
for the red lights.
mutation_rate = 0.2;
crossover_rate = 0.5;
So the simulation fitness of the best values to the
next generation of 85 is achieved in the second half
generation algorithm has converged to a solution. In
the second half of the difference between the best and
average generation is observed that due to the
relatively high rate of mutation is a mutation.
According to my tests, this figure is considered one of
the best solutions, the values of the basic parameters
related to the shape of the table below. Other
comparison criteria of simulation-based cycle time
and number of cars waiting to be lowest. Since the
normalization values are based on values between
zero and one is shown in Fig.
The normal values for the variables x1 to x14 after
applying the genetic algorithm is as follows: These
values are arranged from top to bottom as descending.
Due to the number of duplicate values are rounded to
two decimal places are. Since the end of the next
generation of genetic algorithms converge to the
optimum solution is therefore indicates duplicate
values for parameters relevant achieve the best results.
V. COMPARED WITH RELATED WORKS:
Figure 6: Fitness based on increased fitness
Figure 6 on the best, average and worst fitness
values[25], and Figure 7 are based on the best fitness
values. In both figures the horizontal axis represents
the number of generations of the GA. The result is
then compared to the project after 85 generations the
best solution convergence is done. But the article
again after 10,000 generations, better solutions may
also be found.
Figure 7: Comparison of actual and simulated data of the project
www.ijorcs.org
9. Help the Genetic Algorithm to Minimize the Urban Traffic on Intersections 17
Figure 8: Comparison of actual and simulated data in article 2
The horizontal axis in Figure 8, the numbers of
parameters x1 to x14 is and the vertical axis represents
the difference seated normalized values obtained from
simulation and actual values is even in the worst case
[26], the difference between 0.77 percent and 23
percent error. The difference is 1.00, the best value
reaches zero. In Figure 4-13, each of the numbers on
the horizontal axis, such as AT, BT and ... represent
actual values and the values obtained from the
simulations. The vertical axis is the percent difference
between these two values. Each vertical bar represents
the number 10 is the cycle time for traffic lights.
Results: In the worst case, the project is 23% of actual
flow and the difference in average and worst case
scenarios the difference is very small, almost zero.
The aim of the project is due to algorithms that better
results were reached.
VI. CONCLUSION
The main problem in optimal control traffic control
traffic lights at the crossroads, or in many other
places. Intersections to regulate traffic flow of
vehicles and eliminate conflicting traffic flows are
used, are important elements of an urban traffic
network. As bad as traffic lights control, causing
severe traffic congestion. So one of the most
challenging issues in the field of traffic lights
controlling the traffic management is. Optimal timing
of urban intersection traffic lights with intelligent and
advanced installation and reduced delay, queue length,
Stop vehicles, resulting in reduced fuel consumption
and mitigate the effects of pollution and
environmental degradation due to excessive stopping
vehicles is a traffic light intersection.
Modeling and simulation are widely used in industry.
In fact, the modeling and simulation of an industrial
system is studied before creating economically and
when it is affordable. The aim of this thesis was to
provide a smart way to control traffic. With the
objective of collecting statistical data, a data set
obtained by the genetic algorithm optimization is the
next step. The optimal output of Petri nets CPN
TOOLS modeling and software have been
implemented. It is known that other data collected
crossings and Evolutionary techniques such as
Genetic algorithms are applied to reduce the waiting
time of the traffic lights are red lights and determine
appropriate cycle. Rates of mutation and crossover
operators in genetic algorithm should be such that the
initial generation of diversity in the population
increases the high mutation rate and the convergence
rate are needed to end generations of crossing rate is
high. In this project, two criteria were used to compare
results. First measure the fitness levels of members of
the different generations of the genetic algorithm and
the second criterion is the optimal value of each
parameter is introduced in the coding stage. Due to the
convergence of genetic algorithm to the optimal
solution after 85 generations and no change can be
concluded that ate parameters like mutation and
crossover rate as well as the fitness function was
performed correctly. The graphs are presented and
compared to the results of this project and other
articles based on objective data, Chart based on
minimum levels of fitness as well as the actual data
and the data obtained from the simulations indicate
that this is the approach taken in this project would
achieve better results. Benefits: Petri net modeling
tool is suitable for simulating the traffic lights at
intersections. Colored Petri Nets is a type of a variable
when it is used in this project as well; leading to
accurate simulation of traffic is close to reality. Petri
nets together to study the fractionation system
feasible. Application of Petri Net tool is so broad that
it is designed in Matlab software. Petri net-based
control systems using the event resulting in the
stabilization and synchronization can occur based on
our review. The example shows that the Petri Net is a
simple and convenient tool for modeling complex
systems, which is very useful for the study of
concurrency and uncertainty. Using the model of Petri
nets can be provided on the results of several
intelligent algorithms to be evaluated. Evolutionary
algorithms such as Genetic selection of the best
answers will win instead of only one answer.
Disadvantages: The problem of finding a set of
statistical data so that the data set as an objective of
the project is compiled. Obtaining the proper fitness
www.ijorcs.org
10. 18 Dadmehr Rahbar
function of trial and error is required to find the best
solutions so that it is necessary to adjust the
parameters of the problem as a chromosome and
fitness function in a specific way they fit. Suggestions
Since genetic algorithms may get stuck in local
optimum answers happens it can be combined with
Simulated Annealing algorithm to obtain the best
results. Combination of Genetic Algorithm and
Simulated Annealing gradual hardening stay together
because of their good characteristics, it seems logical
operations. Way to combine the two is used; consider
the appropriateness of mutation rates in genetic
algorithm and the parameter setting of an evolutionary
algorithm is cooling temperature. The combination of
these two algorithms can be such that the temperature
is initialized based on the population and the number
of generations, the next steps are repeated. A couple
of choices aimed at parents and mutation operators are
applied on the cut. Aimed to replace it with a
requirement to produce two children under the age of
each child-parent with the worst fitness value will be
substituted. The combination of Soft Computing
techniques to other evolutionary methods and
techniques of artificial intelligence strategy is suitable
for such problems. Depending on the type of problem
that was addressed in this project, one of the
appropriate algorithms for solving multi-agent
algorithms that due to large number of lights in each
section of a city controlled by separate agents will
eventually is combined optimization methods. All of
these projects can be proposed algorithm and other
algorithms proposed in the implementation of the
CPN Tools, but it would require too much time.
Therefore, it is suggested that the results of statistical
data optimized algorithm in CPN Tools software used
in this project as the work is done.
VII. REFERENCES
[1] H. Zhonghe, C. Yangzhou, S. Jianjun, W. Xu, and G.
Jizhen, “Consensus based Approach to the Signal
Control of Urban Traffic Networks,” Procedia - Soc.
Behav. Sci., vol. 96, no. Cictp, pp. 2511–2522, Nov.
2013.
[2] M. Madireddy, B. De Coensel, A. Can, B. Degraeuwe,
B. Beusen, I. De Vlieger, and D. Botteldooren,
“Assessment of the impact of speed limit reduction and
traffic signal coordination on vehicle emissions using
an integrated approach,” Transp. Res. Part D Transp.
Environ., vol. 16, no. 7, pp. 504–508, Oct. 2011.
[3] D. McKenney and T. White, “Distributed and adaptive
traffic signal control within a realistic traffic
simulation,” Eng. Appl. Artif. Intell., vol. 26, no. 1, pp.
574–583, Jan. 2013.
[4] M. Dotoli, M. P. Fanti, and C. Meloni, “A signal
timing plan formulation for urban traffic control,”
Control Eng. Pract., vol. 14, no. 11, pp. 1297–1311,
Nov. 2006.
[5] S. Barzegar, M. Davoudpour, M. R. Meybodi, a.
Sadeghian, and M. Tirandazian, “Formalized learning
automata with adaptive fuzzy coloured Petri net; an
application specific to managing traffic signals,” Sci.
Iran., vol. 18, no. 3, pp. 554–565, Jun. 2011.
[6] F. Basile, P. Chiacchio, and D. Teta, “A hybrid model
for real time simulation of urban traffic,” Control Eng.
Pract., vol. 20, no. 2, pp. 123–137, Feb. 2012.
[7] F. Corman, A. D’Ariano, I. a. Hansen, and D.
Pacciarelli, “Optimal multi-class rescheduling of
railway traffic,” J. Rail Transp. Plan. Manag., vol. 1,
no. 1, pp. 14–24, Nov. 2011.
[8] H. Mu, J. Yu, and L. Liu, “Evacuation Routes
Optimization with Effects of Traffic Light at
Intersections,” J. Transp. Syst. Eng. Inf. Technol., vol.
11, no. 3, pp. 76–82, Jun. 2011.
[9] H. Dezani, R. D. S. Bassi, N. Marranghello, L. Gomes,
F. Damiani, and I. Nunes da Silva, “Optimizing urban
traffic flow using Genetic Algorithm with Petri net
analysis as fitness function,” Neurocomputing, vol.
124, pp. 162–167, Jan. 2014.
[10] A. Di Febbraro and N. Sacco, “On Evaluating Traffic
Lights Performance Sensitivity via Hybrid Systems
Models,” Procedia - Soc. Behav. Sci., vol. 111, pp.
272–281, Feb. 2014.
[11] F. C. Fang, W. L. Xu, K. C. Lin, F. Alam, and J.
Potgieter, “Matsuoka Neuronal Oscillator for Traffic
Signal Control Using Agent-based Simulation,”
Procedia Comput. Sci., vol. 19, no. Ant, pp. 389–395,
Jan. 2013.
[12] F. Kaakai, S. Hayat, and A. El Moudni, “A hybrid Petri
nets-based simulation model for evaluating the design
of railway transit stations,” Simul. Model. Pract.
Theory, vol. 15, no. 8, pp. 935–969, Sep. 2007.
[13] A. L. C. Bazzan, D. de Oliveira, and B. C. da Silva,
“Learning in groups of traffic signals,” Eng. Appl.
Artif. Intell., vol. 23, no. 4, pp. 560–568, Jun. 2010.
[14] M. P. Fanti, a. Giua, and C. Seatzu, “Monitor design
for colored Petri nets: An application to deadlock
www.ijorcs.org