Next Article in Journal
Anomaly-Based Intrusion Detection Systems in IoT Using Deep Learning: A Systematic Literature Review
Previous Article in Journal
Analysis of Bearing Strength of Post-Tensioning Anchorage Zone with Respect to Relative Bearing Area and Lateral Confinement Design
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Development of a Hybrid Artificial Neural Network-Particle Swarm Optimization Model for the Modelling of Traffic Flow of Vehicles at Signalized Road Intersections

by
Isaac Oyeyemi Olayode
*,
Lagouge Kwanda Tartibu
,
Modestus O. Okwu
and
Uchechi Faithful Ukaegbu
Department of Mechanical and Industrial Engineering, University of Johannesburg, Johannesburg P.O. Box 2028, South Africa
*
Author to whom correspondence should be addressed.
Appl. Sci. 2021, 11(18), 8387; https://doi.org/10.3390/app11188387
Submission received: 3 August 2021 / Revised: 28 August 2021 / Accepted: 2 September 2021 / Published: 9 September 2021
(This article belongs to the Section Transportation and Future Mobility)

Abstract

:
The tremendous increase in vehicular navigation often witnessed daily has elicited constant and continuous traffic congestion at signalized road intersections. This study focuses on applying an artificial neural network trained by particle swarm optimization (ANN-PSO) to unravel the problem of traffic congestion. Traffic flow variables, such as the speed of vehicles on the road, number of different categories of vehicles, traffic density, time, and traffic volumes, were considered input and output variables for modelling traffic flow of non-autonomous vehicles at a signalized road intersection. Four hundred and thirty-four (434) traffic datasets, divided into thirteen (13) inputs and one (1) output, were obtained from seven roadsites connecting to the N1 Allandale interchange identified as the busiest road in Southern Africa. The results obtained from this research have shown a training and testing performance of 0.98356 and 0.98220. These results are indications of a significant positive correlation between the inputs and output variables. Optimal performance of the ANN-PSO model was achieved by tuning the number of neurons, accelerating factors, and swarm population sizes concurrently. The evidence from this research study suggests that the ANN-PSO model is an appropriate predictive model for the swift optimization of vehicular traffic flow at signalized road intersections. This research extends our knowledge of traffic flow modelling at a signalized road intersection using metaheuristics algorithms. The ANN-PSO model developed in this research will assist traffic engineers in designing traffic lights and creation of traffic rules at signalized road intersections.

1. Introduction

With the increase in urbanization, traffic congestion is becoming a serious issue, which is equally considered catastrophic to road users [1,2,3,4,5]. Traffic congestions are an essential part of daily human activities, such as driving to the workplace, shopping malls, etc. There is a consistent and systemic trend of experiencing a delay in traffic flow on highways, freeways, and road intersections. At pedestrians, there is a likelihood of a stop process before crossing the road at any given time, until a point where traffic must have cleared from all directions. Other busy areas are places like international airports. Passengers struggle at the point of entry. In recent times, the observable queues at most airports are alarming.
There is an urgent need to develop an intelligent approach to address traffic congestion at signalized road intersections. Researchers in the field of transport systems and traffic control [6,7,8] have suggested that autonomous vehicles are the future of transportation. As much as that statement has been suggested to be accurate, some developing and developed countries are still far from achieving a fully autonomous vehicle. Traffic congestion has become a widely acknowledged issue challenging to solve. This societal problem has spread majorly in the urban area of the world. The primary objectives of transportation researchers and Government administrators nowadays are to eliminate traffic congestion and assist urban planners with solutions to traffic congestion problems. Although efforts have been made and incentives and strategies have been implemented to reduce traffic congestion in megacities, new traffic congestion problems kept re-occurring and with a high level of unpredictability, especially in developing countries even though pre-existing traffic problems have been ameliorated. Sometimes, it is difficult to comprehend if the traffic congestion measures that have been put in place by urban planners and transportation engineers will either work or not. Intelligent transportation systems provide efficient transportation in terms of vehicles’ reduced traffic flow time on the road. It also improves transportation safety and increases global connectivity in the road transportation network. As a result of the energy crisis the world is currently experiencing because of severe carbon monoxide from vehicles’ exhaust pipes, the need for artificial intelligence techniques cannot be underemphasized. The revolution of the transportation sector and the fast-rising interest in intelligent transportation systems are due to the persistent traffic congestion on highways and freeways and the synergy of new information technology needed for real-time traffic simulation. Reinvigorating road transportation systems is crucial for implementing the fourth industrial revolution in road transportation networks.
This research study used the South African Road transportation network as a case study. A holistic approach is needed to tackle traffic flow congestion at a signalized road intersections in Gauteng province, South Africa. Gauteng is vital to the South African economy; therefore, there is a need for an advanced and well-managed transportation system [9]. The population of urban cities in South Africa has increased rapidly over the last ten years [10]. According to documented reports on vehicular navigation, the total traffic flow between Johannesburg and Pretoria during on-peak days on the N1 freeway is over 160,000 vehicles per day [11]. This research study focuses on the South African Road transportation system, especially the busiest N1 Allandale interchange road, which has the highest traffic volume in Southern Africa. The novelty of this study is in the application of a hybrid artificial neural network trained by a particle swarm optimization model for modelling traffic flow at signalized road intersections. Also, transportation researchers to date have focused majorly on road intersections rather than on signalized road intersections. This study aimed to address the following research questions:
  • Can a hybrid artificial intelligence algorithm such as an artificial neural network trained by particle swarm optimization (ANN-PSO) be used as a predictive approach in modeling traffic flow at a signalized road intersection?
  • Can traffic flow parameters such as speed of vehicles, traffic density, time, number of different classes of vehicles on the road, and traffic volume be used to model vehicular traffic flow at a road intersection?
This paper is divided into five parts. The first section introduces the research study and outlines the primary aim and significance of this research study. The second section discusses prior research related to the engineering application of Artificial neural network-particle swarm optimization (ANN-PSO) and the theoretical framework of the model. The third section concerns the methodology used for this research study, including location, collection of the traffic datasets, and how the model was developed. The fourth section presents the findings of this research study. The final section comprises the conclusion and implications of this study on the road transportation system.

2. Literature Review

Related Studies

In recent years, there has been a growing body of literature review on particle swarm optimization (PSO) and its application in the field of engineering. Prior studies have stated that the application of particle swarm optimization in engineering applications is broad. However, its application to the best of authors’ knowledge in the area of road intersections is limited. The importance of particle swarm optimization cannot be underemphasized due to its hybrid properties and its superior artificial intelligence. Wu et al. propose various applications of particle swarm optimization for the scheduling of railway operations and planning of the railway network layout [12]. They used PSO to find the best optimal railway schedules. AlRashidi et al. [12] Implemented PSO in the effective electric power system. Jain et al. [13] used different forms of objectives to solve a multi-objective load problem by applying PSO. Furthermore, additional related studies on particle swarm optimization are its application in determining the optimal performance of power flow [14,15], load flow [16,17], and the design of a proportional integral derivative (PID) controller in a system that uses an automatic voltage regulator (AVR) [18] and finally in the decreasing of power loss [19]. In civil engineering, especially in construction, [20] came up with a PSO algorithm to design a rectangular flow in the form of a beam slab. Mac et al. [21] suggested an efficient hierarchical global path planning technique for non-stagnant robots in a chaotic engineering environment by applying particle swarm optimization. Islam et al. [22] proposed a function called time-varying transfer, which can be found in binary particle swarm optimization (BPSO). This BPSO is called time-varying transfer function-based binary PSO (TVT-BPSO). The aim was to use this BPSO to evaluate its exploration and exploitation abilities critically. Suresh et al. [23] used PSO in the medical field to predict the duration of stay of sick patients in the hospital, and the key finding of this research was that PSO was efficient compared to other predictive models. Some other applications of PSO over the years have expanded to other engineering applications such as source seeking problem [24], elevator door conceptual framework [25], the problem of quad assignment [26], determining the quantity of equipment in possession [27], and the problem of job shop scheduling [28]. Table 1 below shows previous research been done by researchers on different types of particle swarm optimization (PSO).
There are also different types of PSO that various researchers have used; they are:
  • Multi-objective optimization by implementing PSO.
Researchers have used this approach in solving various optimization problems by using a combination of PSO and discrete multi-objective PSO [32]. In addition to multi-objective methods such as competitive cooperative and co-evolutionary approaches [33] and a PSO evaluation by a vector [34].
  • Modified Particle swarm optimization.
There have been many modifications to PSO to improve its optimization performance and applicability. Notable among these modified PSOs are memory enhanced PSO [35], predator-prey PSO [36]. However, there are newer modified PSOs such as comprehensive learning particle swarm optimizer (CLPSO) [37], self-learning particle swarm optimization (SLPSO) [38], and orthogonal learning particle swarm optimization (OLPSO) [39]. The unique thing about this newer variant of PSO is that they do not need tuning of parameters, and their structure is quite different from an older generation of PSOs. Another significant feature about them is that they only use information that is current and not past information. A considerable number of researchers have used different types of PSO in solving real-life problems. Researchers such as [40] used different kinds of PSO variants on dixian-szego testing. Liu et al. [41] came up with an evolutionary game particle swarm optimization (EGPSO) to model particle behaviours and patterns by applying replicator dynamics and multi-start methods. Hossen et al. [42] used an adaptive PSO that is dependent on spider behaviour. Benmessahel et al. [43] explained the implications of removing obsolete particles from a current PSO iteration. Ji et al. [44] used the combination of gradient and PSO to eliminate immature convergence.
For the validation and predictions of different types of data, there are various pre-existing models such as artificial neural networks (ANNs) [45,46], finite element method (FEM), and finite strip method (FSM) [47,48]. The finite element method is a common technique created by ABAQUS and ANSYS. They have been applied to different types of experimental investigations to either validate or predict the structural properties of certain specimens [49]. Even though the finite element has been widely applied over the years for prediction, it still has disadvantages such as significant time executions, a different variation of outputs, and a high number of data requisitions [50]. In recent years, artificial intelligence (AI) methods have performed significant functions advancing various engineering aims and objectives [51]. Artificial neural networks are a sub-branch of Artificial intelligence techniques. They can solve three distinct types of issues such as (1) approximation of functions, (2) classification, and (3) prediction of time series [52]. However, considering these issues, an ANN model is commonly trained and developed by using optimization approaches. Conventional algorithms such as but not limited to backpropagation algorithms have been used so many times in training artificial neural networks [52]. However, the major setback of using conventional algorithms is that they are usually stuck in local extremums and exhibiting difficulties in crossing plateaus of the error function associated with the landscape. The error landscape is the deficiencies of the conventional algorithms. To address these deficiencies, metaheuristic optimization algorithms such as genetic algorithm (GA), particle swarm optimization (PSO) [53], and imperialist competitive algorithm [54] can be applied to trained artificial neural networks to address these deficiencies. The global search, a significant characteristic of these algorithms, can improve the ANN model performance in some situations.
ANN-PSO was used in this study because many researchers have used particle swarm optimization modelling to develop a predictive approach in different areas of studies, notably among them is [55], who used the ANN-PSO model to predict thermal properties [56] used different types of particle swarm optimization algorithms such as basic particle swarm optimization (PSO), the second generation of particle swarm optimization (SGPSO) and a new model of PSO (NMPSO) to find solutions to three primary aspects (synaptic weights, architecture, and transfer functions neurons) of an ANN network. During this research study, it was discovered that a hybrid ANN-PSO model has never been used before to predict the traffic flow performance of vehicles at road intersections. Celtek et al. [57] used another form of hybrid particle swarm optimization called social learning particle swarm optimization (SL-PSO) to solve real-time traffic signal control. The primary reason why a hybrid ANN-PSO was used in this study was that [57] stated that PSO is an algorithm that performs a fast convergence to optimal solutions. This characteristic is desirable when evaluating different traffic conditions (traffic flow, traffic density, and vehicular speed). Besides, a PSO algorithm is easy to use and requires very few adjustment parameters. The results of this research have proven that the ANN-PSO model is far more accurate, easy to use, and efficient than other predictive models when it comes to traffic flow prediction of vehicles at a signalized road intersection.

3. Methodology

3.1. Research Design

This research study is designed to demonstrate how an artificial neural network trained by particle swarm optimization can model vehicles’ traffic flow at signalized road intersections using selected traffic flow inputs and output. Seven selected signalized road intersections were selected due to their large traffic volume of vehicles on the selected metropolitan section of Gauteng province in South Africa. Figure 1 shows the flowchart of the research methodology applied in this research.

3.2. Traffic Data

The size of the dataset considered in this study is four hundred and thirty-four, and fourteen traffic flow parameters were considered as both inputs and output within the investigation period.

3.3. Data Collection

The method adopted for the collection of data includes the Primary and secondary methods. The primary method used in this research involves collecting traffic data from seven South African signalized road intersections through inductive loop detectors and video cameras. The secondary data was obtained through visitations to the South African Ministry of Transportation and South Africa National Roads Agency Limited (SANRAL) and interaction with Traffic engineers and urban planners’ staff of Mikros traffic Monitoring systems Ltd. (MTM) to obtain relevant information on transportation systems within South Africa.

3.4. Sample and Sampling Techniques

Sampling has to do with choosing a subcategory of individuals from a statistical population to assess the entire population quickly. In the case of this research, the traffic dataset obtained from Mikros Traffic Monitoring Limited was unlimited. A fraction of four hundred and thirty-four and fourteen traffic data was chosen to easily assess the entire population of the South Africa Transportation Network, and we focused on seven roadsites connected to the N1 Allandale freeway in Gauteng Province due to their higher traffic density and traffic volume. The inputs and outputs variables used in this research are the speed of the vehicles, number of different classifications of vehicles, traffic volume, traffic density, the distance covered by the vehicles, and the time it takes the vehicles to travel the road’s length.

3.5. Population of the Study

One of the top-rated companies known for traffic monitoring solutions, specializing in collecting traffic data electronically, constitutes the study population. The company is called Mikros Traffic Monitoring (MTM) Company, a Syntell group subsidiary. This company works in conjunction with the South Africa Ministry of Transportation. Traffic data obtained from MTM for this research study is concentrated on vehicles navigating Gauteng province, South Africa.

3.6. Location of the Research Study

The Allandale interchange (N1 Ben Schoeman) is one of the busiest and best-rated interchanges in South Africa regarding infrastructure and connectivity. It also connects Johannesburg and Pretoria with an average travel distance of 14.7 km. The aerial drone image of this interchange is shown in Figure 2. This interchange accommodates more than 80,000 vehicles traveling southbound and over 71,000 vehicles moving Northbound every 24-h. Figure 3 shows the N1 Allandale interchange’s description, a South Africa Government (National) road network that connects Johannesburg through Pretoria, Bloemfontein, Polokwane, Capetown, and Beit Bridge (which is located on the border of South Africa and Zimbabwe).
The traffic dataset was obtained from the N1 Ben Schoemann, also known as the Allandale interchange, using inductive loop detectors and roadside video cameras. This interchange is connected to seven different road networks with different lanes and directions. The characteristics of these roadsites are shown in the Appendix A (Table A1); these road networks are:
  • Brakfontein 1C N1 SB (Roadsite 1852).
  • Old Johannesburg Road SB off-ramp (Roadsite 1854).
  • Samrand Avenue SB off-ramp (Roadsite 1856).
  • Olifantsfnt SB off-ramp (Roadsite 1858).
  • New road SB off-ramp (Roadsite 1860).
  • Allandale road SB IC off-ramp (Roadsite 1862).
  • Allandale road SB on-ramp (Roadsite 1863).
Note:
  • Off-ramp: When a vehicle drives off the freeway to connect with another road, usually a minor road.
  • On-ramp: This is when vehicles connect from the minor road to the freeway
The characteristics of these seven roadsites have been described in detail in Table A1 in Appendix A. The table comprises of the longitude and latitude of each of the roadsites, the number of lanes on each road, number of vehicles on each road, lengths of the road, speed limit, and the direction of the vehicular traffic flow on each roadsites.

3.7. Size and Extraction of the Traffic Datasets

Four hundred and thirty-four traffic datasets were collected under different heterogeneous conditions. From seven road sites on the South Africa Road network, all these road sites are connected to the N1 route, the busiest on the South Africa Road network. The traffic datasets were collected from these seven sites with the aid of various traffic collection equipment. Fourteen different traffic flow parameters were identified from these traffic datasets. These traffic parameters are crucial in understanding the traffic flow patterns of the South Africa Road network. Five traffic flow periods were identified based on the period from the traffic datasets. The five traffic flow periods are identified based on the traffic volume experienced on these roads depending on the day’s specific time. These periods are either off-peak or on-peak, depending on the time during the day. The periods are classified as 1, 2, 3, 4, 5 in this research; this is explained further in Section 3.9. Fourteen of these parameters were used as inputs and output during the artificial neural network-particle swarm optimization modelling. The traffic flow parameters identified in these seven road sites are shown in Table 2:
  • Traffic density: This is the number of vehicles per unit length. It is calculated as:
Traffic   density = Number   of   vehicles length
  • Traffic volume: This is the number of vehicles depending on a specific period.
Traffic   volume = Number   of   vehicles   time
  • The number of short/medium/long trucks: This is the overall total number of different types of trucks on a specific road depending on the time of the day and traffic volume.
  • The number of light vehicles: This is the overall total number of different types of light vehicles on a specific road network considering the period of the day and traffic volume.
  • Time of day of light vehicles or short/medium/long trucks: This parameter is dependent on the speed of the vehicles or truck and the distance of the specific road site. For example, the road sites used as a case study in this research study have their distance. Its mathematical expression is;
speed = distance time   therefore ,   time = distance speed
  • The average speed of light vehicles or short/medium/long trucks: This is the speed of the vehicles on the road at a specific period. Each road has its speed limit. The road sites used for this study all have a speed limit of 120 km/h.
The South African Ministry of transportation classified different vehicles into Class 1, Class 2, Class 3, or Class 4. Light vehicles are usually classified as Class 1. In contrast, trucks are classified between Class 2 to Class 4 depending on each truck’s number of axles. In this research, the following are grouped under a light vehicle or short/medium/long truck: 2 axles, 6 tyre unit + light trailer (max 4 axle); three-axle single units (+1 axle trailer); four or fewer axle large trailer(s); five-axle single trailer; fight motor vehicle; light motor vehicle towing; motorcycle; seven axle vehicles; six-axle multi-trailer; six-axle single trailers; two-axle buses; two axles six tyre single unit. The definition of different classifications of vehicles has been provided in the Appendix A section.

3.8. Method of Data Collection

Table 3 shows the traffic flow parameters collected by each traffic flow equipment’s. The equipment used for the data collection by Mikros Traffic Monitoring (MTM), a subsidiary of Syntell Group Limited, are:

3.8.1. Data Loggers

Electronic equipment is used in road transportation networks to record data or information garnered for some time by vehicles’ movement on highways and road intersections. An example of a data logger is shown in Figure 4. This information gathered can be analyzed or documented for future purposes. They make use of sensors to record information from vehicles.

3.8.2. Loop Detectors

They are also called inductive loop detectors (shown in Figure 5). These detectors are installed along with highway bumps or where there is a zebra crossing. Besides, they are always relatively closed to traffic lights. They detect the number of vehicles passing, the speed and distance covered by the vehicles, and the time it took the vehicle to arrive at that position on the road.

3.8.3. Video Cameras

These are installed on traffic light poles and usually found around road intersections, road tunnels, highways, freeways, and sometimes roundabouts. A typical illustration of this is shown in Figure 6. They are commonly used to catch traffic offenders or monitor the traffic flow of vehicles. The major limitation is that they are always affected by weather conditions, especially during the rainy or harmattan period; during this period, it is difficult for the video cameras to monitor vehicles’ traffic flow on the road.

3.9. South Africa Vehicular Traffic Flow

Note that for this research study, the period of the day is divided as:
1:
00:00:00–04:59:59 (Off-peak)
2:
05:00:00–09:59:59 (On-peak)
3:
10:00:00–14:59:59 (On-peak)
4:
15:00:00–19:59:59 (On-peak)
5:
20:00:00–23:59:59 (Off-peak)
For clarity and understanding of the vehicular traffic volume of each roadsites, the dates and days the traffic datasets were collected are from 15 July 2019 (Monday) to 25 July 2019 (Thursday). Figure A1 (these figures can be found in the Appendix A section, they are numbered A–G) shows the traffic volume of vehicles at each roadsites considering the period of the day. The traffic volume tables for each roadsites can be found in the Appendix A section. They are named Table A1, Table A2, Table A3, Table A4, Table A5, Table A6 and Table A7. The traffic flow system depends on the traffic volume at a certain period of the day. For example, in each of the roadsites, the period between (00:00:00–04:59:59) is when the traffic flow is gradually building up. This is a period between midnight and the early morning when people are just starting to their place of work. Between 05:00:00–09:59:59 and 10:00:00–14:59:59 is the on-peak period, this when the traffic volume attains the maximum number of vehicles on the road. This is usually when traffic congestion occurs due to high road traffic density (large vehicle occupancy on the road). The traffic congestion can be either recurrent (this occurs when the route is heavily used because of its network connectivity) and non-recurrent (this might be due to road accidents or unforeseeable circumstances on the road). The exception among these vehicular traffic flows is that during the non-working days, which are Saturday and Sunday, from critical observation, between the period of 00:00:00–04:59:59 and 05:00:00–09:59:59, there is a low traffic volume due to people not going to place of work at this period of the day. During these days (Saturday and Sunday), the traffic flow only started to build up in the afternoon, around 15:00:00 and 19:59:59. When the traffic flow is high, the traffic density will increase, which means that the traffic volume will be high, i.e., high traffic volume means there are many vehicles on the road. The traffic flow periods have shed light on one thing, to understand traffic flow, it is crucial that we first have clarity on the traffic volume, traffic density, and the period of the day (off-peak and on-peak).

3.10. The Goal, Data Inputs, and Data Processing Involved in the Development of the ANN-PSO Model

Particle swarm optimization is a strong and effective metaheuristic algorithm that resolves complicated and non-linear optimization problems [58]. This swarm optimization technique can efficiently solve global optimization issues compared with other classical optimization techniques. Particle swarm optimization is a modern optimization technique dependent on social methods such as fish schooling and bird flocking [59]. Depending on the mathematical conceptual framework of particle swarm optimization, these three significant parameters play important roles in PSO optimizations: position, velocity, and fitness. The primary steps of PSO to solve any complex optimization issues is as follows:
  • Initializing a population of individuals (particles) with random velocities and positions in the domain of the problem.
  • Computing the fitness value for all particles.
  • Investigating fitness of particles.
  • Updating the velocity and position of particles using Equations (4) and (5).
V i j t = χ [ ω υ i j t 1 + c 1 r 1 ( p i j t 1 x i j t 1 ) + c 2 r 2 ( G j t 1 x i j t 1 ) ]
x i j t = x i j t 1 + υ i j t
  • r1 and r2 are called random numbers.
  • c1 and c2 are the acceleration constants.
  • w, χ, Pt and Gt are all called the weight of inertia, pbest, and gbest.
When an artificial neural network is adequately trained in the MATLAB environment, it will function as a black-box model, explaining the relationship between a complex dataset, which comprises an input and output (irrespective of the number of variables). An artificial neural network consists of mathematical processing units called neurons. These neurons can be found in the black box during a neural network operation on MATLAB. These neurons can form a relationship with each other via weights and biases. An artificial neural network consists of three primary layers: the input, hidden, and output layers. The neurons are placed in the hidden and output layers, while the input layers do not contain any neurons. After the neural network toolbox has been opened in MATLAB, training will be conducted with the input data and the corresponding output datasets.
The inputs in Table 2 were divided into 13 columns; the output datasets are in a single column on another excel sheet. These are all carried out to determine the appropriate weights and biases of the neurons. Neural network training of data (input and outputs) means determining the optimum variables of different weights and biases of the neural network. Generally, different methods are applied to determine the appropriate parameters of weights and biases of the Artificial Neural Network. In this research, the suitable optimum training of the network has been done by applying an artificial intelligence technique called Artificial Neural Network—Particle Swarm Optimization, which can be found in the MATLAB software environment.
Once the ANN-PSO training has been done adequately on the datasets, the network validation is performed using the testing data-independent variables. An artificial neural network is perfect if the fitness function values are lower or closer to one for the training and validation of the traffic datasets. Particle swarm optimization is created through different species’ social and cooperative behaviour to fill the loopholes in a multidimensional search space. The PSO algorithm is based on the personal experience ( P b e s t ), the overall personal experience of the species ( G b e s t ), and the decision m particles’ decision-making to determine the subsequent positions in the search space. Furthermore, the personal experience of different types of species are accelerated by two (2) main factors called C 1 and C 2 and a pair of (no specific variables random) r 1 and r 2 which are created between a variable ranging from 0 to 1, while the movement is multiplied by ‘w’, which is a crucial inertia factor ‘w’.
V p , q K + 1 = w × V p , q K + c 1 r 1 ( P b e s t p , q k X p , q K ) + c 2 r 2 ( G b e s t q k X p , q K )  
X p , q K + 1 = X p , q K + V p , q K + 1  
In Equation (6), P b e s t p , q k   denotes the personal best of the q th component of the p th individual, while the G b e s t q k referred to q th component of the best individual species of the population of iteration ‘k’. Figure 7 shows the search mode of operation of a particle swarm optimization. The initial P b e s t of each particle is the position, and the initial P b e s t is the most appropriate particle position between a randomly initialized population. The P b e s t and G b e s t of each particle are:
I f   f ( X P K + 1 ) < f ( P b e s t P K )   t h e n   P b e s t P K + 1         = X P K + 1     e l s e   P b e s t P K + 1 = P b e s t P K
If   f ( X P K + 1 ) < f ( G b e s t K )   then   G b e s t K + 1         = X P K + 1     e l s e   G b e s t K + 1 = G b e s t K  
The flowchart below shows the steps been applied to train the artificial neural network using particle swarm optimization. In the early stages, ‘N’ sets of weights and biases of the size of particles ‘D’, directly proportional to ‘n*(m + 2) + 1’ applied randomly. Each traffic dataset is a particle in particle swarm optimization, which is depicted as the particle position. Presently, the initial velocity of each particle in the traffic dataset is applied as 10% of the current position of the correlated particle (which is referred to as ‘V’). The fitness ‘f’ of each particle in the traffic dataset undergoes evaluation. The corresponding particles to the optimum performance of the fitness named as Gbest while Pbest of each particle are accepted as their corresponding bearings. Equations (6) and (9) are used to upgrade the positions of each particle in the PSO, resulting in conclusive optimized weights and biases of the ANN traffic model. A typical flowchart shows an ANN-PSO-based model in Figure 8.
A programming language has been inbuilt in the MATLAB environment, assuming that there is a three-layer artificial neural network architecture. The number of input and output variables considered for developing the artificial neural network-particle swarm optimization model is shown in Table 2. In this study, the number of neurons used varies between five (5) and ten (10), respectively. The ANN-PSO model has variables, which are dependent on particle swarm optimization or the artificial neural network. The PSO variables include the overall number of particles in the swarm population size (swarm size, N), acceleration factor associated with the particle velocity ( C 1 and C 2 ), the inertial weight of the particles (w). The artificial neural network features are the network architecture (i.e., the total number of neurons in the hidden layer ‘n’). The inertia weight of the particles is commonly known as random numbers, which are primarily within the range of 0–1.
A comprehensive iteration was carried out on the ANN-PSO model for obtaining an appropriate combination of variables related to the traffic data. Six different numbers of neurons were considered; the variables are 5, 6, 7, 8, 9, and 10. Six (6) distinct swarm population sizes were also considered. According to past research work [60], it was discovered that the best possible optimum value of the acceleration factor of the particle C 1 and C 2 is situated in-between 1–2.5 and 2–3. Five (5) various variables of accelerating factors C 1 and C 2 were considered. Table 4 shows the overall number of neurons in the hidden layer used to train the datasets. The table also presents the particle size and the acceleration factor considered when training the traffic datasets. The variables of the PSO-ANN hybrid model developed for the traffic data were established by performing frequent training of the traffic data. An overall 1000 training runs were done on the MATLAB environment to acquire the near-perfect integration of the ANN-PSO framework. Training of the traffic data during the ANN-PSO training of the traffic data. The training will only be stopped or terminated when the objective function iteration has been fulfilled. The following benchmark was adhered to. The benchmark is:
  • A maximum iteration of 1000.
  • The training run will be terminated if the objective function is not up to a specific fixed parameter.
The ANN-PSO training was carried out in the MATLAB environment by following these steps:
  • Step One: Traffic data collection.
  • Step Two: Creation of the hybrid network.
  • Step Three: Configuration of the ANN-PSO network.
  • Step Four: Initialization of the weight and biases.
  • Step Five: Training the Neural network by applying particle swarm optimization.
  • Step Six: Validation and testing of the ANN-PSO network.
  • Step Seven: Using the Neural Network.
The inputs and outputs variables used for the development of the ANN-PSO network are shown in Table 2. These input and output variables were categorized based on the method used by [61,62]. Preparation of the dataset is followed by structuring the architecture of the algorithms. MATLAB user interface tools and command-line functionality are used to oversee the ANN-PSO model’s development, training, and testing. The traffic datasets used in this traffic prediction study were obtained from seven major road intersections connecting to the N1 Allandale Road, the busiest interchange in southern Africa. The breakdown of how the traffic datasets were divided and used for the ANN-PSO training and testing is shown in Table 5 below. We used 434 traffic datasets, 364 for training, and 70 for testing the ANN-PSO model performance. The division of the traffic datasets for training and testing is shown in Table 5 below. The MATLAB codes used to develop the ANN-PSO model have been deposited in a GitHub repository. This is the link to the MATLAB codes https://github.com/Olayode1989/ANN-PSO-codes.git (accessed on 20 August 2021).
Allendale road SB on, Allendale Road IC (SB only), new road SB off, Olifantsfnt road SB off, Samrand Ave SB off, Old Johannesburg Road SB off and Brakfontein IC N1 SB. Equations (10) and (11) show the regression value’s statistical formulae and the mean square error.
R 2 = 1 k ( y k y ^ k ) 2 k ( y k y ¯ k ) 2
M S E = 1 2   k = 1 n ( y k y ^ k ) 2
where y k , y ^ k , y ¯ k  n represents the experimental data sample, the values predicted by the algorithm, the mean value of the experimental data samples, and the number of data samples, respectively. The primary code file used for training the traffic datasets using ANN-PSO was generated. These codes were saved as ‘m_pso_m’ before the ANN-PSO was used to prepare the traffic data. The input and output datasets were created and saved in a Microsoft Excel worksheet. In the Microsoft worksheet, two sheets were created, namely sheet 1 and sheet 2. In sheet 1, it consists of the input datasets and sheet two, which comprises the output (traffic volume) and the target data required to be placed in the first column of the first row of sheet 2 in the excel file. This Microsoft excel of the input and output data (target data) must be saved with the name ‘datafile.xlsx’ and kept in the same directory as the ANN-PSO codes. These traffic data can be uploaded into the MATLAB environment by inputting the following command codes in the MATLAB command window:
  • [x,t] = traffic_dataset;
  • Inputs =X′;
  • Outputs = t′;
All three files were saved in the MATLAB directory ‘myfunc.m’, ‘nn_pso.m’, and datafile. xslx to train the artificial neural network using Particle swarm optimization effectively. The ‘nn_pso.m’ file is run consistently depending on the number of hidden neurons, swarm population size, and accelerating factor. For example, if the number of hidden neurons is five (5) and the swarm population size is 10, the best performing accelerating factor is C 1 = 2.25 and C 2 = 2. These parameters will be changed in the ‘nn_pso.m’ codes inside the MATLAB environment.

4. Results and Discussions

The ANN-PSO Model Results and Discussions

The 434 traffic datasets obtained from the seven roadsites were divided into 367 and 70 for training and testing. To achieve the best optimum output, the trial-and-error approach was used to discover the best value for the number of hidden nodes, iterations, and acceleration factors. Sigmoid and linear functions were used for the ANN-PSO model for the hidden and output node activation functions. The best optimal parameters for both training and testing performance of the ANN-PSO model of traffic flow at each roadsites, as shown in Table 6, are:
(a)
Number of hidden neurons = 5
(b)
Swarm population size = 400
(c)
Number of traffic datasets = 434
(d)
C1 and C2 = 1.5 and 2
(e)
Training (R2) = 0.98356
(f)
Testing (R2) = 0.98220
Figure 9a below shows the result of the ANN-PSO training response of 0.98356, considering the number of hidden neurons, accelerating factors, and swarm population sizes. To evaluate the accuracy of the ANN-PSO model, observed and predicted output of the traffic volume of vehicles at each roadsites were compared in Figure 9b, with the testing performance of the model been 0.98220. The ANN-PSO model’s testing performance of the traffic datasets from the roadsites was calculated by plotting a graph between the actual value of the traffic volume and the simulated traffic volume achieved during the ANN-PSO model training testing and validation. The existing traffic volume was compared with the simulated traffic volume to determine the ANN-PSO model’s validity of each roadsites traffic dataset.
The study set out to determine if an artificial network trained by particle swarm optimization can be used to model traffic flow at a signalized road intersection. The current study has been able to answer that question, considering Table 6, which shows evidently that the ANN-PSO model is capable of modelling traffic flow at a signalized road intersection. The most interesting finding from the ANN-PSO results shows that the best optimum training and testing performed for the roadsites was obtained with a different number of neurons, swarm population sizes, and acceleration factors C 1 and C 2 . From the results, it can be concluded that the ANN-PSO’s parameters affect the performance prediction of the traffic flow datasets. Another significant finding from the ANN-PSO result is that the accelerating factors and mean square error plays an essential role in determining the optimum performance of each ANN-PSO model on each roadsites; for example, the lower the MSE, the more likely there is going to be an optimum training or testing performance of the ANN-PSO model. The most striking result to emerge from the research study is that when an ANN-PSO model comprises the maximum correlation coefficient ( R 2 ) and the minimum MSE, it can be said that the ANN-PSO model is superior. The training and testing performance regression value for the roadsites indicates that the inputs and target are well correlated. Another significant finding is that when R-value is closer to 1, this means that there is an accurate linear relevance between the traffic inputs and target.

5. Conclusions and Future Work

To achieve the aim of this research study, an in-depth and exhaustive research study has been conducted to develop an ANN-PSO capable of modelling and analysing vehicular traffic flow at a signalized road intersection. For the accurate modelling of traffic flow, it was important to understand and identify some traffic flow parameters and have clarity on how traffic flow affects the movement of vehicles at a signalized road intersection. In this research study, the successful development of the ANN-PSO model for the traffic flow of vehicles at a signalized road intersection has been achieved. The vehicular speed, the time of the day, the traffic volume, and the traffic density of each class of vehicles (light vehicles, long trucks, medium trucks, and short trucks) have been considered as the traffic flow inputs and outputs variables. The following conclusions can be drawn from this present study:
  • ANN-PSO model is potentially suitable for the prediction and analysis of traffic flow at a signalized road intersection. This model could be used to predict traffic flow with a high level of accuracy. It explains the heterogeneous traffic flow conditions at different periods of the day.
  • Due to the stochastic nature of traffic information, it is difficult to determine the volume of traffic flow at a signalized road intersection. This equally implies that the specific time of the day determines the traffic density and vehicular speed on the road. The evidence from this study suggests that traffic density and traffic volume are significant in determining traffic congestion and understanding the traffic flow patterns on a road transportation network.
  • The ANN-PSO model developed in this study will assist transportation engineers and urban planners in developing possible ways to use their respective country’s traffic information to understudy traffic flow patterns and variables for effective predictive models. Also, designing a traffic control system for traffic lights at road intersections can be made possible and timely.
  • The results of this study will serve as a base for future studies for engineers and transportation researchers in understanding the complexity of traffic flow patterns at a signalized road intersection. Also, it will assist drivers in the decision-making process, such as which period of the day traffic congestion is likely to occur on a particular road.
Based on the results obtained from this research study, this research study has thrown up many questions in need of further investigation in the field of transportation:
  • Further work needs to be done to establish whether other metaheuristic algorithms, such as the second generation of particle swarm optimization (SGPSO), bee colony, an artificial neural network trained by genetic algorithm (ANN-GA), adaptive neuro-fuzzy inference system trained by particle swarm optimization (ANFIS-PSO) and simulated annealing can be used in developing predictive models using traffic flow parameters obtained from a signalized road intersection.
  • A natural progression of this research study would be to focus on unsignalized road intersections, traffic light timing response optimization, and the usability of traffic volume in determining traffic congestions at road intersections. Besides, demonstrating other metaheuristic techniques’ strength and predictive power will be very useful as a comparative measure for minimizing traffic issues in road transportation.
  • Finally, another possible area of future research would be to investigate if the optimal solution obtained in this research depends on factors affecting traffic flow and how could the optimal solution change depending on these factors.

Author Contributions

Supervision, L.K.T. and M.O.O.; Writing—original draft, I.O.O.; Writing—review and editing, L.K.T., M.O.O. and U.F.U. All authors have read and agreed to the published version of the manuscript.

Funding

The research and the APC were funded by a research grant from the University of Johannesburg.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The traffic datasets used for this research study are available on reasonable request from the South Africa Ministry of Transportation and South African National Roads Agency Limited (SANRAL). This is the link to the ANN-PSO codes used for this research: https://github.com/Olayode1989/ANN-PSO-codes.git (accessed on 20 August 2021).

Acknowledgments

The authors would like to thank the University Research Committee (URC) of the University of Johannesburg for their financial contributions to the realization of this research work. Mikros traffic monitoring is highly appreciated for making their traffic dataset available for this research.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

  • Two axles, six tyre unit + light trailer (max 4 axle): These include vehicles used to carry sand and construction materials, including camping and recreational vehicles. They have three axles.
  • Three axle single unit (+1 axle trailer): These types of vehicles are called trucks, e.g., camping and recreational kinds of vehicles.
  • Four or less axle large trailer(s): This type of vehicle consists of 2 units, one of which can either be a tractor or a straight truck power unit.
  • Five axle single trailer: They comprise of 2 units and a tractor; multi-national industries usually use these types of trailers to move goods and services.
  • Six or more axle single trucks: This type of vehicle always consists of 2 units, a tractor or a straight truck power unit.
  • Five or fewer axle multi-trailer trucks: These include five or fewer axles comprising three or more units. It can either be a tractor or a straight truck power unit.
  • Six axle multi-trailer trucks: This is either a tractor or a straight truck power unit.
  • Seven or more axle multi-trailer trucks: This is also either a tractor or a truck power unit. It is usually used to carry heavy construction materials or used for transporting fuels.
Figure A1. Note: 1: 00:00:00–04:59:59 (Off-peak), 2: 05:00:00–09:59:59 (On-peak), 3: 10:00:00–14:59:59 (On-peak), 4: 15:00:00–19:59:59 (On-peak), 5: 20:00:00–23:59:59 (Off-peak). Furthermore, it is important to note that for all the figures, the unit of traffic volume is vehicles/day or vehicles/h. (A) Brakfontein 1C N1 SB; (B) Old Johannesburg Road SB (off-ramp); (C) Samrand Avenue SB (off-ramp); (D) Olifantsfnt SouthBound off-ramp; (E) New road SB off-ramp; (F) Allandale road IC off-ramp; (G) Allandale road SouthBound on-ramp.
Figure A1. Note: 1: 00:00:00–04:59:59 (Off-peak), 2: 05:00:00–09:59:59 (On-peak), 3: 10:00:00–14:59:59 (On-peak), 4: 15:00:00–19:59:59 (On-peak), 5: 20:00:00–23:59:59 (Off-peak). Furthermore, it is important to note that for all the figures, the unit of traffic volume is vehicles/day or vehicles/h. (A) Brakfontein 1C N1 SB; (B) Old Johannesburg Road SB (off-ramp); (C) Samrand Avenue SB (off-ramp); (D) Olifantsfnt SouthBound off-ramp; (E) New road SB off-ramp; (F) Allandale road IC off-ramp; (G) Allandale road SouthBound on-ramp.
Applsci 11 08387 g0a1aApplsci 11 08387 g0a1b
Table A1. Features of the Seven Roadsites.
Table A1. Features of the Seven Roadsites.
Name of the RoadsitesDatesNumber of LanesLane DescriptionsDirectionsNumber of
Vehicles at Each Roadsites
LongitudeLatitudeSpeed Limit (km/hr)Length of the Roadsites (m)
Brakfontein 1C N1 SB15–27 July 2019701 Fastlane to JohannesburgSouthbound2,097,15228.16857° E−25.88084° S12012.5
02 Middle to JohannesburgSouthbound
03 Slow Lane to JohannesburgSouthbound
04 On-Ramp joining N3Southbound
05 Fastlane from N1Southbound
06 Middle Lane from N1 (Polokwane)Southbound
07 Slow Lane from N1 (Polokwane)Southbound
Old Johannesburg Road SB Off-Ramp15–29 July 2019501 Fastlane to JohannesburgSouthbound16,240,26028.158402° E25.90833° S1209.4
02 Middle to JohannesburgSouthbound
03 Middle to JohannesburgSouthbound
04 Slow Lane to JohannesburgSouthbound
05 The Off-Ramp to R10 1NSouthbound
Samrand Avenue Southbound Off-Ramp15–29 July 2019701 Fastlane to JohannesburgSouthbound18,448,02328.146509° E−25.9271° S1207
02 Middle to JohannesburgSouthbound
03 Middle to JohannesburgSouthbound
04 Slow Lane to JohannesburgSouthbound
05 Off-Ramp to Ultra citySouthbound
06 Fastlane, Off- RampSouthbound
07 Slow Lane, the Off-Ramp to Samrand AvenueSouthbound
Olifantsfnt SB Off-Ramp15–29 July 2019501 Fastlane to JohannesburgSouthbound 19,051,12428.134396° E−25.95482° S1203.7
02 Middle to JohannesburgSouthbound
03 Middle to JohannesburgSouthbound
04 Slow Lane to JohannesburgSouthbound
05 Off-Ramp to R56 2Southbound
New Road Southbound (Off-Ramp)15–29 July 2019501 Fastlane to JohannesburgSouthbound18,262,04828.128098° E25.97556° S1201.3
02 Middle to JohannesburgSouthbound
03 Middle to JohannesburgSouthbound
04 Slow Lane to JohannesburgSouthbound
05 Off-Ramp to New RoadSouthbound
Allandale Road Southbound IC (Southbound Only)15–29 July 2019301 CD RoadSouthbound5,815,64828.116522° E−26.01489° S12054.5
02 Off-Ramp to Allandale RoadSouthbound
03 On-Ramp from Allandale Road to N1 SouthSouthbound
Allandale Road Southbound On-Ramp15–29 July 2019801 Fastlane to JohannesburgSouthbound24,292,81828.11375° E−26.02054° S12053.7
02 Middle to JohannesburgSouthbound
03 Middle to JohannesburgSouthbound
04 Middle to JohannesburgSouthbound
05 Fastlane to JohannesburgSouthbound
06 The On-Ramp from Allandale Road EastboundSouthbound
07 Fastlane On-Ramp from Southbound Allandale Road Westbound/ SouthSouthbound
08 Allandale Road Westbound SouthSouthbound
Table A2. New Road SB Off-Ramp.
Table A2. New Road SB Off-Ramp.
Dates
Period of the Day15 July 201916 July 201917 July 201918 July 201919 July 201920 July 201921 July 201922 July 201923 July 201924 July 201925 July 2019
13,341,7102,983,3882,641,8492,801,6863,149,1214,001,7413,672,4683,072,0773,018,3372,580,0802,972,918
253,977,72657,151,75658,909,41158,997,11155,141,71731,656,47618,118,46957,166,99152,530,89045,540,65050,633,314
344,563,79051,774,52353,660,75354,200,04255,202,71049,038,86839,984,69151,207,12052,552,94250,879,34055,267,964
437,314,17244,059,37742,247,89943,742,98744,436,62535,664,48640,107,83243,313,39243,933,29044,450,83246,201,607
56,681,0257,303,2477,879,1248,042,89710,606,95011,862,4158,520,3646,689,8877,055,2967,722,4939,165,914
Table A3. Brakfontein IC N1 SB.
Table A3. Brakfontein IC N1 SB.
Dates
Period of the Day15 July 201916 July 201917 July 201918 July 201919 July 201920 July 201921 July 201922 July 201923 July 201924 July 201925 July 201926 July 201927 July 2019
1321,821284,516235,749255,599292,933396,825346,475285,355287,843234,682252,186299,738610,946
23,602,0481,869,2685,836,8705,800,2632,423,2712,759,5421,505,7784,583,4835,691,5075,680,0985,780,2325,853,2693,041,894
31,999,6045,102,3355,149,3465,224,9895,611,2894,596,2073,612,3454,819,5654,988,6285,027,8385,339,3095,891,0515,123,845
44,646,7924,734,5564,827,7474,775,7104,951,6083,534,3564,022,9014,675,2684,746,4834,834,7044,952,7985,114,025296,582
5674,526732,688824,652853,5871,125,7681,205,557839,470653,840732,518776,017938,7921,285,480
Table A4. Old Johannesburg Road Southbound (Off-Ramp).
Table A4. Old Johannesburg Road Southbound (Off-Ramp).
Dates
Period of the Day15 July 201916 July 201917 July 201918 July 201919 July 201920 July 201921 July 201922 July 201923 July 201924 July 201925 July 201926 July 201927 July 201928 July 201929 July 2019
1390,179327,976268,065289,300335,488469,798417,142339,721335,219270,048290,175350,518773,861568,289404,581
22,216,5592,042,6994,333,0694,838,1272,131,2023,149,8431,769,5782,347,6452,203,8553,040,3262,973,4993,331,4783,539,6262,348,9121,275,185
3815,6765,730,6365,829,7985,849,3346,162,6675,226,9964,225,4675,487,7175,633,3245,718,8156,029,4316,567,1325,901,9434,609,2785,423,568
43,644,1005,144,9365,203,6095,203,8485,399,5894,057,6844,701,1585,094,1015,137,5245,279,2665,407,1995,485,8594,527,0645,071,441765,203
5787,586875,753960,764991,7881,326,8931,424,2551,035,343766,568837,739892,6571,095,8601,517,4271,695,4641,333,457
Table A5. Samrand Avenue Southbound (Off Ramp).
Table A5. Samrand Avenue Southbound (Off Ramp).
Dates
Period of the Day15 July 201916 July 201917 July 201918 July 201919 July 201920 July 201921 July 201922 July 201923 July 201924 July 201925 July 201926 July 201927 July 2019
1574,868504,994425,123468,260531,622710,172623,026520,392522,734434,026477,027549,5201,099,849
25,416,1904,544,6996,666,9946,469,9663,682,7575,135,5662,821,8225,240,0235,280,1145,273,3225,765,4385,956,0485,588,665
36,882,9739,543,9159,737,8969,880,67510,412,6418,544,5636,737,9599,095,9889,350,8289,518,83210,046,17710,928,9959,559,681
47,996,7358,120,9778,284,0898,244,8388,571,4136,335,4937,167,6657,948,6358,063,4008,284,8078,576,6088,947,607366,385
51,163,6141,323,4111,431,3531,481,2701,993,9892,103,9221,490,1621,145,7861,259,6881,339,2161,640,8432,286,731
Table A6. Olifantsfnt SB Off-Ramp.
Table A6. Olifantsfnt SB Off-Ramp.
Dates
Period of the Day15 July 201916 July 201917 July 201918 July 201919 July 201920 July 201921 July 201922 July 201923 July 201924 July 201925 July 201926 July 2019
11,021,527945,044797,486833,213961,6701,255,6971,106,365968,462962,808817,024883,234997,146
210,823,1159,909,63211,188,93011,043,82411,309,5489,732,0655,347,20511,174,25510,663,5249,850,39910,791,67012,106,587
312,567,07512,259,62217,256,69017,241,17117,338,89715,446,79312,179,02016,316,70415,960,37816,765,42817,689,34218,360,307
414,038,49414,120,72514,320,18214,195,18310,090,05111,135,01412,679,84713,810,04714,025,18914,115,09414,698,10915,520,252
52,045,1412,287,6022,457,2362,557,6373,472,0053,738,6332,645,9412,023,7832,193,6212,314,8262,820,308607,144
Table A7. Allandale Road IC Off Ramp.
Table A7. Allandale Road IC Off Ramp.
Dates
Period of the Day15 July 201916 July 201917 July 201918 July 201919 July 201920 July 201921 July 201922 July 201923 July 201924 July 201925 July 201926 July 201927 July 201928 July 201929 July 2019
16,9837,6176,5086,8838,20911,28610,3997,8396,9416,185228,7167,95614,48011,9766,939
2224,281218,494224,619227,947215,09577,62246,099227,613225,165162,713175,226227,63780,51654,909205,804
3138,796165,058167,919165,493178,113150,937120,560160,484164,332162,785189,282196,424167,500137,369161,353
4174,386177,442183,483179,768179,424117,872114,460171,007177,787115,01733,283189,045137,601122,157176,988
523,19927,51528,33931,83936,71238,35525,72722,36425,03129,796 42,75242,70430,64925,172
Table A8. Allandale Road Southbound On-Ramp.
Table A8. Allandale Road Southbound On-Ramp.
Dates
Period of the Day15 July 201916 July 201917 July 201918 July 201919 July 201920 July 201921 July 201922 July 201923 July 2019
1546,367482,234457,114468,548531,924692,344735,485477,644495,049
27,285,5427,808,7577,881,8757,160,72210,484,0895,601,9633,155,6176,150,6668,831,958
38,182,8538,606,6349,160,0649,709,8419,954,8238,455,7206,619,3028,703,4429,203,793
48,119,5544,207,7898,323,5288,310,5338,384,4116,353,0756,625,6807,849,4277,542,791
51,222,4411,352,6891,424,0971,495,0071,889,0162,097,6801,472,7271,197,611

References

  1. Li, Z.; Schonfeld, P. Hybrid simulated annealing and genetic algorithm for optimizing arterial signal timings under oversaturated traffic conditions. J. Adv. Transp. 2015, 49, 153–170. [Google Scholar] [CrossRef]
  2. Xu, H.; Zhuo, Z.; Chen, J.; Fang, X. Traffic signal coordination control along oversaturated two-way arterials. PeerJ Comput. Sci. 2020, 6, e319. [Google Scholar] [CrossRef]
  3. Khan, M.U.; Saeed, S.; Nehdi, M.L.; Rehan, R. Macroscopic Traffic-Flow Modelling Based on Gap-Filling Behavior of Heterogeneous Traffic. Appl. Sci. 2021, 11, 4278. [Google Scholar] [CrossRef]
  4. Ranjan, N.; Bhandari, S.; Khan, P.; Hong, Y.-S.; Kim, H. Large-Scale Road Network Congestion Pattern Analysis and Prediction Using Deep Convolutional Autoencoder. Sustainability 2021, 13, 5108. [Google Scholar] [CrossRef]
  5. Drop, N.; Garlińska, D. Evaluation of Intelligent Transport Systems Used in Urban Agglomerations and Intercity Roads by Professional Truck Drivers. Sustainability 2021, 13, 2935. [Google Scholar] [CrossRef]
  6. Olayode, I.; Tartibu, L.; Okwu, M.; Uchechi, U. Intelligent transportation systems, un-signalized road intersections and traffic congestion in Johannesburg: A systematic review. Procedia CIRP 2020, 91, 844–850. [Google Scholar] [CrossRef]
  7. Van Brummelen, J.; O’Brien, M.; Gruyer, D.; Najjaran, H. Autonomous vehicle perception: The technology of today and tomorrow. Transp. Res. Part. C Emerg. Technol. 2018, 89, 384–406. [Google Scholar] [CrossRef]
  8. Kuutti, S.; Fallah, S.; Katsaros, K.; Dianati, M.; Mccullough, F.; Mouzakitis, A. A survey of the state-of-the-art localization techniques and their potentials for autonomous vehicle applications. IEEE Internet Things J. 2018, 5, 829–846. [Google Scholar] [CrossRef]
  9. Garner, D.; Louw, J.; Burnett, S. Towards resolving congestion in Gauteng. In Proceedings of the SATC—South African Transport Conference Meeting the Transport Challenges in Southern Africa, Johannesburg, South Africa, 16–20 July 2001. [Google Scholar]
  10. Olayode, O.; Tartibu, L.; Okwu, M. Application of Artificial Intelligence in Traffic Control System of Non-autonomous Vehicles at Signalized Road Intersection. Procedia CIRP 2020, 91, 194–200. [Google Scholar] [CrossRef]
  11. Chakwizira, J. The question of road traffic congestion and decongestion in the greater Johannesburg area: Some perspectives. In Proceedings of the SATC—South African Transport Conference Meeting the Transport Challenges in Southern Africa, Johannesburg, South Africa, 9–12 July 2007. [Google Scholar]
  12. AlRashidi, M.R.; El-Hawary, M.E. A survey of particle swarm optimization applications in electric power systems. IEEE Trans. Evol. Comput. 2008, 13, 913–918. [Google Scholar] [CrossRef]
  13. Jain, N.K.; Nangia, U.; Jain, A. PSO for multiobjective economic load dispatch (MELD) for minimizing generation cost and transmission losses. J. Inst. Eng. Ser. B 2016, 97, 185–191. [Google Scholar] [CrossRef]
  14. Abido, M.A. Optimal power flow using particle swarm optimization. Int. J. Electr. Power Energy Syst. 2002, 24, 563–571. [Google Scholar] [CrossRef]
  15. Liang, R.-H.; Tsai, S.-R.; Chen, Y.-T.; Tseng, W.-T. Optimal power flow by a fuzzy based hybrid particle swarm optimization approach. Electr. Power Syst. Res. 2011, 81, 1466–1474. [Google Scholar] [CrossRef]
  16. Salomon, C.P.; Lambert-Torres, G.; Martins, H.G.; Ferreira, C.; Costa, C.I. Load flow computation via particle swarm optimization. In Proceedings of the 2010 9th IEEE/IAS International Conference on Industry Applications-INDUSCON, Sao Paulo, Brazil, 8–10 November 2010; pp. 1–6. [Google Scholar]
  17. Acharjee, P.; Goswami, S. Chaotic Particle Swarm Optimization based reliable algorithm to overcome the limitations of conventional power flow methods. In Proceedings of the 2009 IEEE/PES Power Systems Conference and Exposition, Washington, DC, USA, 15–18 March 2009; pp. 1–7. [Google Scholar]
  18. Gaing, Z.-L. A particle swarm optimization approach for optimum design of PID controller in AVR system. IEEE Trans. Energy Convers. 2004, 19, 384–391. [Google Scholar] [CrossRef] [Green Version]
  19. Yapıcı, H.; Çetinkaya, N. An improved particle swarm optimization algorithm using eagle strategy for power loss minimization. Math. Probl. Eng. 2017, 2017, 1063045. [Google Scholar] [CrossRef] [Green Version]
  20. Nimtawat, A.; Nanakorn, P. Simple particle swarm optimization for solving beam-slab layout design problems. Procedia Eng. 2011, 14, 1392–1398. [Google Scholar] [CrossRef]
  21. Mac, T.T.; Copot, C.; Tran, D.T.; de Keyser, R. A hierarchical global path planning approach for mobile robots based on multi-objective particle swarm optimization. Appl. Soft Comput. 2017, 59, 68–76. [Google Scholar] [CrossRef]
  22. Islam, M.J.; Li, X.; Mei, Y. A time-varying transfer function for balancing the exploration and exploitation ability of a binary PSO. Appl. Soft Comput. 2017, 59, 182–196. [Google Scholar] [CrossRef]
  23. Suresh, A.; Harish, K.; Radhika, N. Particle swarm optimization over back propagation neural network for length of stay prediction. Procedia Comput. Sci. 2015, 46, 268–275. [Google Scholar] [CrossRef] [Green Version]
  24. Zou, R.; Kalivarapu, V.; Winer, E.; Oliver, J.; Bhattacharya, S. Particle swarm optimization-based source seeking. IEEE Trans. Autom. Sci. Eng. 2015, 12, 865–875. [Google Scholar] [CrossRef] [Green Version]
  25. Wen, P.; Zhi, M.; Zhang, G.; Li, S. Fault prediction of elevator door system based on PSO-BP neural network. Engineering 2016, 8, 761–766. [Google Scholar] [CrossRef] [Green Version]
  26. Gong, T.; Tuson, A.L. Particle swarm optimization for quadratic assignment problems-a forma analysis approach. Int. J. Comput. Intell. Res. 2008, 4, 177–185. [Google Scholar] [CrossRef]
  27. Liu, Z.; Zhao, R. Equipment Possession Quantity Modeling and Particle Swarm Optimization. In Proceedings of the 2009 Third International Conference on Genetic and Evolutionary Computing, Guilin, China, 14–17 October 2009; pp. 628–632. [Google Scholar]
  28. Li, J.-q.; Pan, Q.-k.; Xie, S.-x.; Jia, B.-x.; Wang, Y.-t. A hybrid particle swarm optimization and tabu search algorithm for flexible job-shop scheduling problem. Int. J. Comput. Theory Eng. 2010, 2, 189. [Google Scholar] [CrossRef] [Green Version]
  29. Bhushan, B.; Pillai, S.S. Particle swarm optimization and firefly algorithm: Performance analysis. In Proceedings of the 2013 3rd IEEE International Advance Computing Conference (IACC), Ghaziabad, UP, India, 22–23 February 2013; pp. 746–751. [Google Scholar]
  30. Angeline, P.J. Using selection to improve particle swarm optimization. In Proceedings of the 1998 IEEE International Conference on Evolutionary Computation Proceedings, IEEE World Congress on Computational Intelligence (Cat. No. 98TH8360), Anchorage, AK, USA, 4–9 May 1998; pp. 84–89. [Google Scholar]
  31. Chen, Y.-P.; Peng, W.-C.; Jian, M.-C. Particle swarm optimization with recombination and dynamic linkage discovery. IEEE Trans. Syst. ManCybern. Part B 2007, 37, 1460–1470. [Google Scholar] [CrossRef]
  32. Sharaf, A.M.; El-Gammal, A.A. A novel discrete multi-objective Particle Swarm Optimization (MOPSO) of optimal shunt power filter. In Proceedings of the 2009 IEEE/PES Power Systems Conference and Exposition, Seattle, WA, USA, 15–18 March 2009; pp. 1–7. [Google Scholar]
  33. Goh, C.K.; Tan, K.C.; Liu, D.; Chiam, S.C. A competitive and cooperative co-evolutionary approach to multi-objective particle swarm optimization algorithm design. Eur. J. Oper. Res. 2010, 202, 42–54. [Google Scholar] [CrossRef]
  34. Harrison, K.R.; Ombuki-Berman, B.; Engelbrecht, A.P. Knowledge Transfer Strategies for Vector Evaluated Particle Swarm Optimization; Technical Report CS-12-07; Brock University, Department of Computer Science: St. Catharines, ON, Canada, 2012. [Google Scholar]
  35. Benedetti, M.; Azaro, R.; Massa, A. Memory enhanced PSO-based optimization approach for smart antennas control in complex interference scenarios. IEEE Trans. Antennas Propag. 2008, 56, 1939–1947. [Google Scholar] [CrossRef]
  36. Duan, H.; Li, P.; Yu, Y. A predator-prey particle swarm optimization approach to multiple UCAV air combat modeled by dynamic game theory. IEEE/CAA J. Autom. Sin. 2015, 2, 11–18. [Google Scholar]
  37. Liang, J.J.; Qin, A.K.; Suganthan, P.N.; Baskar, S. Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans. Evol. Comput. 2006, 10, 281–295. [Google Scholar] [CrossRef]
  38. Li, C.; Yang, S.; Nguyen, T.T. A self-learning particle swarm optimizer for global optimization problems. IEEE Trans. Syst. ManCybern. Part. B Cybern. 2011, 42, 627–646. [Google Scholar]
  39. Zhan, Z.-H.; Zhang, J.; Li, Y.; Shi, Y.-H. Orthogonal learning particle swarm optimization. IEEE Trans. Evol. Comput. 2010, 15, 832–847. [Google Scholar] [CrossRef] [Green Version]
  40. Schutte, J.F.; Groenwold, A.A. A study of global optimization using particle swarms. J. Glob. Optim. 2005, 31, 93–108. [Google Scholar] [CrossRef]
  41. Liu, W.-B.; Wang, X.-J. An evolutionary game based particle swarm optimization algorithm. J. Comput. Appl. Math. 2008, 214, 30–35. [Google Scholar] [CrossRef] [Green Version]
  42. Hossen, M.S.; Rabbi, F.; Rahman, M.M. Adaptive Particle Swarm Optimization (APSO) for multimodal function optimization. Int. J. Eng. Technol. 2009, 1, 98–103. [Google Scholar]
  43. Benmessahel, B.; Touahria, M. An improved combinatorial particle swarm optimization algorithm to database vertical partition. J. Emerg. Trends Comput. Inf. Sci. 2011, 2, 130–135. [Google Scholar]
  44. Ji, W.; Wang, K. An improved particle swarm optimization algorithm. In Proceedings of the 2011 International Conference on Computer Science and Network Technology, Harbin, China, 24–26 December 2011; pp. 585–589. [Google Scholar]
  45. Safa, M.; Shariati, M.; Ibrahim, Z.; Toghroli, A.; Bin, B.S.; Norazman, M.N.; Petkovic, D. Potential of adaptive neuro fuzzy inference system for evaluating the factors affecting steel-concrete composite beam’s shear strength. Steel Compos. Struct. 2016, 21, 679–688. [Google Scholar] [CrossRef]
  46. Mohammadhassani, M.; Nezamabadi-Pour, H.; Suhatril, M.; Shariati, M. An evolutionary fuzzy modelling approach and comparison of different methods for shear strength prediction of high-strength concrete beams without stirrups. Smart Struct. Syst. Int. J. 2014, 14, 785–809. [Google Scholar] [CrossRef]
  47. Shariati, M.; Faegh, S.S.; Mehrabi, P.; Bahavarnia, S.; Zandi, Y.; Masoom, D.R.; Toghroli, A.; Trung, N.-T.; Salih, M.N.A. Numerical study on the structural performance of corrugated low yield point steel plate shear walls with circular openings. Steel Compos. Struct. 2019, 33, 569–581. [Google Scholar]
  48. Sharafi, P.; Rashidi, M.; Samali, B.; Ronagh, H.; Mortazavi, M. Identification of factors and decision analysis of the level of modularization in building construction. J. Archit. Eng. 2018, 24, 04018010. [Google Scholar] [CrossRef]
  49. Taheri, E.; Firouzianhaji, A.; Usefi, N.; Mehrabi, P.; Ronagh, H.; Samali, B. Investigation of a method for strengthening perforated cold-formed steel profiles under compression loads. Appl. Sci. 2019, 9, 5085. [Google Scholar] [CrossRef] [Green Version]
  50. Ahmadi, R.; Rashidian, O.; Abbasnia, R.; Nav, F.M.; Usefi, N. Experimental and numerical evaluation of progressive collapse behavior in scaled RC beam-column subassemblage. Shock Vib. 2016, 2016. [Google Scholar] [CrossRef]
  51. Nguyen, H.; Drebenstedt, C.; Bui, X.-N.; Bui, D.T. Prediction of blast-induced ground vibration in an open-pit mine by a novel hybrid model based on clustering and artificial neural network. Nat. Resour. Res. 2020, 29, 691–709. [Google Scholar] [CrossRef]
  52. Olayode, I.O.; Tartibu, L.K.; Okwu, M.O. Traffic flow Prediction at Signalized Road Intersections: A case of Markov Chain and Artificial Neural Network Model. In Proceedings of the 2021 IEEE 12th International Conference on Mechanical and Intelligent Manufacturing Technologies (ICMIMT), Cape Town, South Africa, 12 July 2021; pp. 287–292. [Google Scholar]
  53. Kennedy, J.; Eberhart, R.C. A discrete binary version of the particle swarm algorithm. In Proceedings of the 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation, Orlando, FL, USA, 12–15 October 1997; Volume 5, pp. 4104–4108. [Google Scholar]
  54. Atashpaz-Gargari, E.; Lucas, C. Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition. In Proceedings of the 2007 IEEE Congress on Evolutionary Computation, Singapore, 25–28 September 2007; pp. 4661–4667. [Google Scholar]
  55. Lazzús, J.A.J.M.; Modelling, C. Neural network-particle swarm modeling to predict thermal properties. Math. Comput. Model. 2013, 57, 2408–2418. [Google Scholar] [CrossRef]
  56. Xing, B.; Gao, W.-J. Cat Swarm Optimization Algorithm. In Innovative Computational Intelligence: A Rough Guide to 134 Clever Algorithms; Springer: Berlin, Germany, 2014; pp. 93–104. [Google Scholar]
  57. Celtek, S.A.; Durdu, A.; Alı, M.E.M. Real-time traffic signal control with swarm optimization methods. Measurement 2020, 166, 108206. [Google Scholar] [CrossRef]
  58. Kennedy, J.; Eberhart, R. Particle swarm optimization. In Proceedings of the ICNN’95-International Conference on Neural Networks, Perth, WA, Australia, 1 December 1995; Volume 4, pp. 1942–1948. [Google Scholar]
  59. Eberhart, R.C.; Shi, Y.; Kennedy, J. Swarm Intelligence; Elsevier: Amsterdam, The Netherlands, 2001. [Google Scholar]
  60. Alam, M.N.; Das, B.; Pant, V. A comparative study of metaheuristic optimization approaches for directional overcurrent relays coordination. Electr. Power Syst. Res. 2015, 128, 39–52. [Google Scholar] [CrossRef]
  61. Kumar, K.; Parida, M.; Katiyar, V. Short term traffic flow prediction for a non urban highway using artificial neural network. Procedia Soc. Behav. Sci. 2013, 104, 755–764. [Google Scholar] [CrossRef] [Green Version]
  62. Goves, C.; North, R.; Johnston, R.; Fletcher, G. Short term traffic prediction on the UK motorway network using neural networks. Transp. Res. Procedia 2016, 13, 184–195. [Google Scholar] [CrossRef] [Green Version]
Figure 1. Research methodology.
Figure 1. Research methodology.
Applsci 11 08387 g001
Figure 2. An aerial drone image of the Allandale interchange.
Figure 2. An aerial drone image of the Allandale interchange.
Applsci 11 08387 g002
Figure 3. An illustrative description of the N1 (the red line) route through the South Africa Road transportation network.
Figure 3. An illustrative description of the N1 (the red line) route through the South Africa Road transportation network.
Applsci 11 08387 g003
Figure 4. A road intersection in Johannesburg showing the data loggers beside the road.
Figure 4. A road intersection in Johannesburg showing the data loggers beside the road.
Applsci 11 08387 g004
Figure 5. The black lines on the road surface are the inductive loop detectors.
Figure 5. The black lines on the road surface are the inductive loop detectors.
Applsci 11 08387 g005
Figure 6. Video cameras attached to a traffic signal light.
Figure 6. Video cameras attached to a traffic signal light.
Applsci 11 08387 g006
Figure 7. The Particle Swarm Optimization search technique for pth particle at a kth objective function in the search field.
Figure 7. The Particle Swarm Optimization search technique for pth particle at a kth objective function in the search field.
Applsci 11 08387 g007
Figure 8. A framework of the ANN-PSO Model developed for the traffic flow prediction performance.
Figure 8. A framework of the ANN-PSO Model developed for the traffic flow prediction performance.
Applsci 11 08387 g008
Figure 9. (a) ANN-PSO training response of the best performance neural network of the traffic datasets of the roadsites (13-5-1). (b) Comparison between the measured and predicted traffic volume of the roadsites for the testing performance of the ANN-PSO model.
Figure 9. (a) ANN-PSO training response of the best performance neural network of the traffic datasets of the roadsites (13-5-1). (b) Comparison between the measured and predicted traffic volume of the roadsites for the testing performance of the ANN-PSO model.
Applsci 11 08387 g009
Table 1. Types of particle swarm optimization (PSO).
Table 1. Types of particle swarm optimization (PSO).
Author(s)Types of PSOAimsKey Findings
[29]Particle swarm optimization and firefly algorithm (FFA)This paper aimed to compare the performance of PSO and the firefly algorithm by using almost ten non-linear functions. The time and mean values of the non-linear functions were used as the input and output variables.The result showed that the non-linear functions and time value is smaller compared with the firefly algorithm.
[30]Particle swarm optimization PSOThe aim was to apply PSO on four test functions to achieve an adequate selection of particles.The study implied that not all test functions were improved in terms of performance.
[31]Particle swarm optimization-recombination and dynamic linkage discovery (PSO-RDL)The aim was to use this hybrid PSO-RDL to solve economic dispatch in the power system.They discovered that the performance of PSO-RDL was similar to a modified particle swarm optimization (MPSO)
Table 2. Categorization of the traffic datasets into inputs and output.
Table 2. Categorization of the traffic datasets into inputs and output.
Input VariablesOutput Variables
Traffic densityTraffic Volume
Number of light vehicles
The average speed of light vehicles
Time of day of light vehicles
The average speed of a long truck
Time of day of long truck
Number of long trucks
The average speed of a medium truck
Time of day of medium truck
Number of medium trucks
Number of short trucks
The average speed of a short truck
Time of day of short truck
Table 3. Collection of Traffic data.
Table 3. Collection of Traffic data.
Traffic Data Collection EquipmentTraffic Data
Data LoggersVehicular Speed
Loop DetectorsVehicular Speed.
Distance.
Time.
Video CamerasNumber of Vehicles
Table 4. Values of parameters of the ANN-PSO model used for the traffic study.
Table 4. Values of parameters of the ANN-PSO model used for the traffic study.
Acceleration FactorSwarm Population SizeNumber of Neurons
Value of the parametersC1C2
12.0105
1.52.25206
22.5507
2.252.751008
2.53.02009
40010
Table 5. The Breakdown of the Roadsites traffic datasets for ANN-PSO training.
Table 5. The Breakdown of the Roadsites traffic datasets for ANN-PSO training.
RoadsitesTrainingTestingTotal
Brakfontein 1C N1 SB (Roadsite 1852)511061
Old Johannesburg road SB off-ramp (Roadsite 1854)641074
Samrand Avenue SB off-ramp (Roadsite 1856)541064
Olifantsfnt SB off-ramp (Roadsite 1858)501060
New road SB off-ramp (Roadsite 1860)471057
Allandale road SB IC off-ramp (Roadsite 1862)641074
Allandale road SB on-ramp (Roadsite 1863)341044
36470434
Table 6. The Parametric analysis of ANN-PSO Hybrid Model for the Traffic Dataset.
Table 6. The Parametric analysis of ANN-PSO Hybrid Model for the Traffic Dataset.
Number of NeuronsSwarm Population SizeC1C2Training (R2)MSETesting (R2)
5102.2520.9730647.1280.9314
5202.2520.9698252.7810.7838
5501.52.250.9831329.7340.9769
510012.750.9710250.5900.9784
52001.520.9856625.2280.8660
54001.520.9835628.9210.9822
610130.9845227.2270.9423
62022.250.9762041.8170.9781
65012.50.9875822.0070.8595
610012.50.9917214.6940.8917
620012.750.9634763.5160.9681
640012.250.9856925.1730.9140
7101.52.50.9800535.0930.8268
72012.750.9894218.7360.9353
75012.50.9881920.8490.9411
710012.50.9929912.4530.9591
72001.52.250.9931412.1990.9486
7400220.9868823.1180.9661
81012.750.9776939.1220.9546
82012.50.9857025.1620.9401
8501.52.250.9939110.8490.9276
810012.50.9857125.1280.9100
820012.750.9881620.8770.9716
840012.250.9949090.2190.8880
91012.750.9823531.0760.9356
920130.9602869.0160.9800
9501.52.250.9929012.5980.9090
9100220.9863424.0480.7637
92001.52.250.9899317.7570.8790
940012.50.9936111.2900.8218
101012.750.9746844.2810.9897
10201.52.50.9717749.3400.9564
10501.52.50.9782638.0980.8602
1010012.750.9912215.5360.9627
1020012.750.9907816.2650.9056
104001.52.50.9895018.5000.9246
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Olayode, I.O.; Tartibu, L.K.; Okwu, M.O.; Ukaegbu, U.F. Development of a Hybrid Artificial Neural Network-Particle Swarm Optimization Model for the Modelling of Traffic Flow of Vehicles at Signalized Road Intersections. Appl. Sci. 2021, 11, 8387. https://doi.org/10.3390/app11188387

AMA Style

Olayode IO, Tartibu LK, Okwu MO, Ukaegbu UF. Development of a Hybrid Artificial Neural Network-Particle Swarm Optimization Model for the Modelling of Traffic Flow of Vehicles at Signalized Road Intersections. Applied Sciences. 2021; 11(18):8387. https://doi.org/10.3390/app11188387

Chicago/Turabian Style

Olayode, Isaac Oyeyemi, Lagouge Kwanda Tartibu, Modestus O. Okwu, and Uchechi Faithful Ukaegbu. 2021. "Development of a Hybrid Artificial Neural Network-Particle Swarm Optimization Model for the Modelling of Traffic Flow of Vehicles at Signalized Road Intersections" Applied Sciences 11, no. 18: 8387. https://doi.org/10.3390/app11188387

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop