Abstract
The density of population in cities is growing at a faster rate to make the life of people in cities comfortable and save. The city needs to be smart. It can be mainly achieved by intelligent decision making process using computational intelligence based systems. Keeping this in view, many researchers and organizations are working to develop and implement computational intelligence decision support systems. To obtain a comprehensive overview on the current status on SI based smart city community the present investigation has been made. To achieve this objective recently published standard articles on this important sub area have been collected and reviewed. The summary of the review has been presented in systematic manner to facilitate the researchers who are currently working in the area of smart city community. The important findings of the review have been made and presented. The important performance measures in various aspects of smart city obtained by the computational intelligence methods have been listed. It is expected that the findings and the contribution of the paper will benefit the researchers, the related government and private organizations in terms of furthering their research efforts and producing different smart products pertaining to community development and improvement of comfort level of the dwellers of the smart city.
Keywords
Introduction
It is reported [1] that the urbanization will grow from the present 54%to 66%by 2050. Further, the cities occupy only 3%of the land area of the earth but its green house gas emission is 60–80%. This will lead to severe impact on the environment, security and management of the cities. To control and manage the exponential growth of urbanization, the concept of smart cities has emerged. In many countries of the globe have adopted this so that the resources can be managed and energy consumption can be optimal. The smart city projects aim for maintaining green environment, low carbon emission and reduction of global warming. To meet the requirement of smart city, effective utilization of information, communication and artificial intelligence (AI) techniques are essential [2].
To have an in depth understanding of the role of computational intelligence (CI) methods in smart city community development, relevant recently published articles have been collected and thoroughly reviewed in this paper. The outcome of the review is systematically presented in this article so that the interested researchers working in this field as well as the associated scientists and engineers in smart city projects will be immensely benefitted.
The CI is a broad area of AI which constitutes three groups. The first group comprises of artificial neural network (ANN) and its variations. The second group deals with fuzzy logic and its variations. The biologically inspired/ nature inspired techniques constitute the evolutionary computing. The various types of deep learning (DL) come under the broad area of ANN. In this review paper, smart city community related papers employing CI technique have been chosen. The analysis of the review on this emerging area is presented in tabular forms to facilitate the new researchers.
Research gap, motivation of research, research objectives and organization
Research gap
The review articles [1–6] on the theme of the present paper reveal that CI techniques have been extensively used for the smart city community. Some of the important aspects of smart community which need further investigation and improvement are: (i) Review articles on smart city (RA) (ii) intelligent transportation system (ITS) (iii) cyber security (CS) (iv) efficient utilization of smart grid (SG) (v) unmanned aerial vehicle (UAV) (vi) smart environment (SE) (vii) Smart education (SEd) (viii) swarm intelligence based optimization (SI) and (ix) smart health care (SH).
Motivation of research
For the benefit of the community living in smart cities the various developmental areas listed in Section 2.1 have to be focused keeping this in view relevant articles have been collected and analysis has been carried out. These issues are required to be addressed with suitable methodologies and implementation to achieve the objectives and benefits of smart cities.
Research objectives
Based on the motivation of the research the objectives of the proposed article are: (i) articles related to each of the six aspects stated in Section 2.1 have been collected and categorized (ii) the standard databases used in various articles have been identified and listed (iii) for each category the CI techniques used have been identified and listed (iv) the performance achieved by use of each CI technique for different aspects of smart city has been presented in tabular form (v) the contribution of the paper and the possible extensions are also presented.
Organization
The organization of the paper proceeds as follows: In Section 3, the detailed review of the articles on CI based smart city community is presented. The sources of data and the CI techniques used to solve various aspects of the smart city have been identified and explained in Section 4. In Section 5, the various CI methods employed for smart city community are dealt in brief. In Section6, the analysis of the results of various articles reviewed in this paper has been dealt. Finally, in Section 7, the major contribution of the paper and possible extensions are presented.
Literature review
This section presents a comprehensive view of collected articles on smart city community. In total 28 articles published in recent years in standard journals and dealing with on the theme of the paper has been collected. The summary of the review is presented in Table 1. Each row of this table is subdivided into five columns. These are (i) Title of the paper, Name of the Journal and Name of the Publisher (ii) Datasets used (iii) Problem statement and methods employed (iv) contribution of the paper and (v) conclusion.
Summary of literature review of articles
Summary of literature review of articles
It is observed from the review of articles that the researchers are working in nine different aspects of smart city community. These are listed in the beginning of Section 2. Accordingly the categorization of the articles have been made and presented in Table 2. It is observed from this table that the numbers of articles in the nine categories are 6, 4, 4, 3, 2, 2, 2, 3 and 2 respectively. The table reveals that maximum numbers of articles are being published in the sub area of literature review and intelligent transportation system.
Categorization of articles
In this Section, the standard sources of data pertaining to smart city community used by authors of different articles have been collected and presented in Table 3. Many of the data sets have been obtained from real life experiments and others have been taken from standard websites.
Sources of data
Sources of data
Most of the articles have focused on obtaining appropriate decision relating to smart city community by employing machine learning and CI techniques. These have been identified from each article and presented in Table 4.
CI Techniques used for different tasks related to smart city community
This Section deals with the various CI methods used in problems related to smart city community. It provides brief outline of each of the CI methods listed in Table 5.
List of various CI methods used in smart city community articles
List of various CI methods used in smart city community articles
The Long short-term memory (LSTM), proposed by Gers et al. in 2000, is a feed forward-feedback artificial recurrent neural network. It processes single data point as well as sequence of data. The LSTM is superior to recurrent neural network (RNN) in terms of control ability. There are five steps in LSTM model. The first step defines the network as a sequence of layers. The LSTM layer comprises of memory cells. The second step, transforms the simple sequence of layers into a format which can be executed by GPU. In the third step, the weights are adapted using back propagation learning. In fourth step, after completion of successful training the performance of the network is evaluated. The LSTM model retains the information for a long period of time and hence in fifth step, the trained model is used for predicting and classifying tasks as per the requirement.
Random forest (RF)
The random forest, proposed by Tin Kam Ho, and developed by Leo and Adele in 2019 is an ensemble learning method for classification and prediction operation. It constructs a multiple of decision trees during training time. Finally, the class is estimated on the mean prediction of the individual trees. The overfitting issue associated with decision trees is overcome by random forest. The random forest outperforms the decision trees. The steps involved in random forest algorithm is- Select random samples from a given dataset Construct a separate decision tree for every randomly selected set. Obtain prediction result from each decision tree. Perform voting for every predicted result Choose the final prediction result by selecting the most voted prediction.
Deep reinforcement learning (DRL)
It combines the principle of both deep and reinforcement learnings to exploit the benefits of the two. In reinforcement learning an agent learns to perform an action through the method of trial and error. Based on the reward received by the agent it optimizes its behavior until the goal is achieved. Through DRL the desired output is achieved by passing the raw data through number of layers of reinforcement learning.
Deep belief network (DBN)
The DBN is a generative graphical model which learns to reconstruct its inputs. It comprises of multiple layers of hidden units such that there is no connections between units within each layer but there is connection between the layers. The layers of DBN act as feature detectors. After the completion of the training stage, the DBN can further learn with supervision to function as a classifier. The DBN can be viewed as a deep learning model as it is trained greedily one layer at a time. The steps involved in the training of the DBN are: Initialize the training vector (Visible units) Update the hidden units in parallel. Update the visible units in parallel. Reupdate the hidden units. Update the weights.
The DBN finds applications in classification and forecasting tasks in many engineering fields.
Multiple Regressions (MR)
It establishes the straight line relationships among two or more variables. The MR estimates the regression coefficients by least square approach. The steps employed in MR based approach are: Model building Model Adequacy Model Assumptions Potential Modeling and solutions Model validation
Deep learning (DL)
The DL algorithms are a subset of machine learning algorithms which uses multiple layers to sequentially extract higher level features from the raw input data. The deep refers to the number of layers through which the data is transformed. It helps to pick up the right features which improve the prediction and classification performance. The DL can be applied for speech and audio recognition, bio-informatics, drug design, computer vision, health care etc. The major seven steps involved in DL are: Collect the raw data Pre-process the data Choose a deep learning model Train the model Evaluate the model Tune the hyperparameters Perform prediction or classification task
Convolutional neural network (CNN)
The CNN is a class of DL. There also known as space invariant artificial neural network (SIANN). The CNN comprises of multiple perceptrons in which networks are fully connected. The hidden layers perform series of convolution. The ReLu function is commonly used as activation function. The pooling operations are carried out to reduce the dimensions of the data without much sacrificing the quality of the data. After suitable features are extracted the two dimensional convolved data as converted to one dimension before the prediction or classification operation is carried out in last few neural networks.
Dragonfly algorithm (DA)
Based on the dynamic and static swarming behavior of artificial dragon flies the DA algorithm has been developed in the literature. The various step involved in this algorithm are: Separation It indicates the static collision avoidance in which the individuals follow to avoid collision with each other. Alignment It represents the velocity matching of individual with other neighborhood of the same group. Cohesion It represents the tendency of the individuals towards the centre of the group. Attraction It denotes the attraction towards the food source Distraction It computes the diversion from the enemy. It performs better than several meta-heuristic algorithms.
Moth-flame optimization (MFO)
The MFO, Proposed by Mirjalili, is one of the promising meta-heuristic algorithms which finds application in many fields. The steps involved in MFO are: Define the parameters of the algorithm Generate the initial moths randomly Calculate the fitness functions and find the best positions by flames. Update the flame number Calculate the space between the ith moth and jth flame. Update position of each moth. Move to step 3, if terminating criteria are not satisfied. End
This MFO finds applications in various optimization problems, data mining, clustering and medical engineering.
Ant colony optimization (ACO)
The ACO, proposed by Dorigo in 1992 is an important optimization algorithm which has been developed by following the behavior of the ants. The ACO is applied to vehicle routing, internet routing, travelling salesman problem (TSP) and other commercial applications. The principle behind ACO is computation of pheromone intensity of ants through the path on which each ant travels. An artificial ant travels towards a node based on a path on which the probability is highest. The steps of ACO are: Initialization Initialize pheromone intensity in each path Initialize the change in pheromone intensity in each path Compute inverse of the given distance matrix. Compute the probability of each path using Steps 1 and 2. Place the ant at a node which leads through a path of maximum probability. Update the change in pheromone intensity as well as pheromone intensity of each path. Repeat Steps 3 to 5 for the same ant until it reaches to the initial node. Repeat Steps 3 to 6 for each ant Find the best route (which offers the least distance) by comparing the minimum of the distances travelled by all artificial ants. The least distance provides the solution.
Bayesian network (BN)
It is also called belief network or Bayes Network. It represents a probabilistic graphical model based on directed acyclic graph. This network establishes probabilistic relationship between cause and effect. The steps involved in this network are: Identification of important model parameters which are required for estimating the risk of violent re-offence. Construction of casual model structure using the variables identified in Step 1 Linking of the required data to variables of models. Performance of parameterization of model and handling of missing data using expectation maximization algorithm. Review of the behavior of the developed model and suggestion for further revision if required.
The BN is a popular method for modeling uncertain and complexed systems. It provides robust framework for the analysis of the problem.
C4.5 algorithm
It is an extension of ID3 algorithm and known as statistical classifier. It generates decision trees which are used for classification. It is a widely used as an efficient classifier. The steps involved in this algorithm are: Construct a node called N Return N as a leaf node, labeled with C (If all the training dataset belongs to same class C) Return N as a leaf node labeled with majority class if attribute list is empty.
The C4.5 has few improvements over ID3. These are: It is capable of handling both discrete and continuous variables. It can handle training data with missing attribute values. It can handle attributes with different costs.
Naive bayes (NB)
The NB is a probabilistic classifier which employs Bayes’ theorem. This classifier is highly scalable, requires a number of linear parameters. It is based on maximum-likelihood training and does not employ iterative method of learning. The Steps in NB classifier are: Compute the frequency table using the given datasets Create likelihood table using Step 1. Calculate the posterior probability for each class using Naive Bayes equation. Estimate the class based on highest posterior probability.
It finds the class faster. It performs well in the categorical input. One limitation of this classifier is the assumption of the independent predictor.
Random tree
A random tree represents a spanning tree of a graph in which each tree has equal chance of being selected. Two different distributions are usually used. According to a random permutation binary trees are formed by inserting one node at a time. In the other case, binary trees are chosen from uniform discrete distribution.
ANN Ensemble (ANNE)
The ANN Ensemble is a two-stage model which includes model training and model combination. During training phase each ANN model is trained with same input set. Each model is then used to make a prediction or classification. The final result is obtained by taking the average of the results. In some cases, the output of each of the ANN model is weighted and then summed to produce the final output. The magnitude of each of the weight is found by employing biologically inspired technique based optimization. The key steps of ANNE model are: Vary the choice of data to train the each ANN model Vary the choice of the models used in the ensemble system. Vary the choice of the way that the outputs from ensemble models are combined.
Fuzzy expert system (FES)
The FES uses fuzzy logic. It comprises of fuzzification, inference, composition and de-fuzzification. In the inference process using rules and membership functions, the output variables are computed using specific values of input variables. In the fuzzification stage, using suitable membership function, the input values are mapped to obtain the degree of truth. In the inference stage the truth value is computed and applied to each rule. In the composition stage all the fuzzy subsets are assigned to each output variable are combined together. Then a single fuzzy subset for each output variable is obtained. In the de-fuzzification stage, the membership values are converted back to the crisp values. There are many methods of defuzzification such as centroid method and average maximum method. The defuzzified output provides the desired result. The FESs is used in several fields such as pattern recognition, non-linear control and financial systems.
Multi-objective optimization (MOO)
It refers to optimization of multi objective problems with many variables and many constraints. Mostly the MOO problems are solved using biologically inspired techniques. The MOO finds applications in almost all fields for the purpose of prediction, classification, detection tasks. Some common types of biologically inspired MOOs are Non-dominated sorting algorithm (NSGA) version 2, Multi-objective particle swarm optimization (MOPSO), Multi-objective cat swarm optimization (MOCSO) etc. These algorithms are population based and work iteratively to arrive at an optimized solution. Even though the process is time taking, the solutions are better and can be conveniently used for offline applications.
Recurrent neural network (RNN)
The RNN is a generalization of artificial neural network having internal memory. In RNN the same function is performed for every input of the data. The output of the current input depends on the past one computation. After the output is produced it is sent back to the recurrent network to arrive at a decision. It uses the current input and the output which has been obtained from the previous input. The RNN models sequence of data so that each sample is assumed to be dependent on previous one. The major steps in RNN are: Apply an input at a particular time. Compute its current state using current input and previous state. Assume the current state as the previous state for the next time state. Repeat steps 1 to 3 until all time steps are completed and then the output is computed using the final current state. Generate the error term by comparing the actual and target outputs. Back propagate the error to update the connecting weights.
The RNN is associated with gradient vanishing and exploding problems.
Support vector machine (SVM)
The SVM algorithm was invented by Vapnik and Chervonenkis in 1963 for non linear classification purpose. The SVM model represents the input datasets as points in the space in such a way that the data are divided into separate categories by a maximum possible clear gap. The steps of SVM are: Prepare and format the dataset. Normalize the datasets Select activation function Optimize the parameters using search algorithm Train the SVM model Test SVM model Evaluate the performance of classification
The SVM is more effective if dimensional spaces are high and particularly number of dimension is more than the number of samples.
Conditional restricted boltzmann machine (CRBM)
The CRBM, introduced by Taylor and Hinton in 2009, is used for multi dimensional system modeling which learns using the probability distribution over a set of data. It consists of history, hidden and present layers. These layers are connected through a three way weight tensor among them. When an input dataset is applied the CRBM learns by fitting the weight tensor in such a way that the energy function is progressively minimized. The training of the algorithm is computationally expensive.
Factored conditional restricted boltzmann machine (FCRBM)
The RBMs are unidirectional graphical models which use hidden variables to develop higher order non linear prediction models. The RBM represents probability distributions over random variables under an energy based model. After completion of training the model it provides a closed form representation for the distribution following the observation. The CRBM model is suitable for multi-label classification given a training dataset with missing labels. The true label vectors are simultaneously learnt by maximizing the regularized conditional marginal likelihood of the label. In addition, it incorporates label co-occurrence information received from auxiliary resources as previous knowledge. The FCRBM is a compact and efficient multi class model. It is a deep layered structure and employs ReLu function and multi variate auto regressive algorithm for training. The performance of this model is consistent and robust in nature.
Artificial bee colony (ABC) algorithm
It is a bio-inspired optimization algorithm which exploits foraging behavior of honey bee. It was proposed by Dervis Karaboga in 2005. The colony comprises of employed bees onlookers and scouts. It is assumed that the number of food sources surrounding the hive is equal to the number of employed bees. The employed bees after returning from food source dance near the hive. The employed bee becomes a scout after its food source is abandoned. It is then searches for new food source. The onlookers choose the food sources based on the dances of the employed bees. The steps of the algorithms are: Produce the initial food sources for all employed bees. Each employed bee finds a closest food source based on her memory. It evaluates its nectar amount and dances in the hive. Each onlooker chooses a source depending on the dances of the employed bee. It goes to the source and evaluates the nectar amount. The scouts discover the abandoned food sources which are replaced by new food sources. The best food source is identified. Steps 2 to 6 are repeated until the condition in step 6 is satisfied.
The ABC is a promising optimization algorithm which finds potential applications in many fields.
Quantum induced swarm intelligence (QPSO)
It is a new swarm intelligence algorithm, introduced in 2004 with improved ability over PSO. It involves fewer adjustable parameters and produces effective solution better than the PSO. It assumes that the particle in the space has quantum behavior. The steps of the algorithm are:- Initialize the population Initialize the optimal particle history and global optimal history. Evaluate the fitness function of particles. Update history optimal of particles. Update the global optimum of particle swarm history. Update all particles in the population. Check the terminating condition. Go to step 2 if step 7 is not satisfied. Otherwise outputs the optimal solution.
This algorithm is a powerful one and provides better and faster solution in many applications.
Particle Swarm Optimization (PSO)
It is a population based optimization algorithm originally contributed by Kennedy, Eberhart and Shi. Each member of the population is called a particle and a set of particles constitutes a swarm. Each particle has a position as well as a velocity. The initial position for each particle represents an initial solution. Each particle has personal best (p-best) value which changes from time to time. At a given time, the best of the p-best is known as global best (g-best) which represents the solution. After each time instant the velocity and the position of each particle are updated using the p-best of each particle as well as the g-best. The steps of PSO algorithm are: Initialize the position and velocity of each particle of the swarm. Compute the p-best of each particle and the g-best of the swarm. Update the velocity and position of each particle using the p-best and g-best values. Update the p-best and g-best. Repeat Steps 3 and 4 until the stopping criterion is made (The value of g-best remains constant).
The PSO is a simple but effective optimization algorithm which finds applications in all fields of the engineering.
Feature fusion
The feature fusion learns the features of the given dataset which are compact representation of integrated features. It involves lower computational complexity and provides better detection performance. It integrates multiple different feature information to obtain more prominent set of features.
Analysis of results presented in various articles
The reviews of the key results in the collected articles have been made and are presented in Table 6. This table also presents the best possible performance achieved by the CI method employed
Analysis of results
Analysis of results
The observation of Table 6 shows the name of the CI technique which offers highest performance accuracy. The performance measures used are mostly standard type and hence the definition and formulae of these measures have not been provided.
A review of standard articles on CI based smart city community has been made and the important finding of the review has been presented in precise and systematic manner. It is expected that the researcher working in this field would find the paper interesting and useful. In essence, the paper has identified nine different directions of smart city in which development is taking place and research work is being carried out. It is, in general, observed that major investigations have been made in the area of intelligent transportation and security issues related to smart city. Less emphasis has been made in the area of smart education. Due to severity of COVID-19 in the whole globe, e-learning and smart education have become more important and hence more emphasis should be given for developing tools, techniques and platform to strengthen smart education system using CI. It is further observed that CI and particularly DL have become promising and essential methods for smart city community. Many more efforts need to be made to address and solve various other challenging problems related to smart city using ML and CI techniques. Very few of the proposed methods have been implemented in practice. Work can be carried out to develop prototype working online models to be used for the service of smart city community.
