Development of a hybrid system of artificial neural networks and artificial bee colony algorithm for prediction and modeling of customer choice in the market

With the increasing growth of technology and the emergence of various industries, numerous manufacturers have entered this field. In today's world, sellers and manufacturers find themselves among a vast number of competitors. Therefore, they need to adopt a variety of policies and strategies for their own survival and profitability. Companies should identify their customers’ needs and adopt their own policies based on customers’ purchase behaviors. To this end, attempts have been made to identify the customer choice model since the past decades. These models aim at modeling and predicting customer choice among several brands. Traditional models were of interest for many years and these methods were frequently used with the advent of artificial intelligence and machine learning systems. They could demonstrate very good results. In this study, it has been attempted to present a new method for the modeling and prediction of customer choice in the market using the combination of artificial intelligence and data mining. Indeed, the new model is to be applied in helping managers with decision-making. Hence, probabilistic neural networks have been combined with artificial bee colony algorithm.  The proposed model was tested in a real market and its efficiency and accuracy were finally compared with those of other models, including neural network trained with back-propagation, probabilistic neural networks, and the neural networks trained with genetic algorithm. The results reveal that the hybrid model shows better performance than the other models.Keywords: Consumer Choice Model, Data Mining, Artificial Intelligence, modeling, predicting, probabilistic neural network, artificial bee colony algorith

Computational meta-heuristics based on Machine Learning to optimize fuel consumption of vessels using diesel engines

With the expansion of means of river transportation, especially in the case of small and medium-sized vessels that make routes of greater distances, the cost of fuel, if not taken as an analysis criterion for a larger profit margin, is considered to be a primary factor , considering that the value of fuel specifically diesel to power internal combustion machines is high. Therefore, the use of tools that assist in decision-making becomes necessary, as is the case of the present research, which aims to contribute with a computational model of prediction and optimization of the best speed to decrease the fuel cost considering the characteristics of the SCANIA 315 machine. propulsion model, of a vessel from the river port of Manaus that carries out river transportation to several municipalities in Amazonas. According to the results of the simulations, the best training algorithm of the Artificial Neural Network (ANN) was the BFGS Quasi-Newton considering the characteristics of the engine for optimization with Genetic Algorithm (AG)

Traveling Salesman Problem

The idea behind TSP was conceived by Austrian mathematician Karl Menger in mid 1930s who invited the research community to consider a problem from the everyday life from a mathematical point of view. A traveling salesman has to visit exactly once each one of a list of m cities and then return to the home city. He knows the cost of traveling from any city i to any other city j. Thus, which is the tour of least possible cost the salesman can take? In this book the problem of finding algorithmic technique leading to good/optimal solutions for TSP (or for some other strictly related problems) is considered. TSP is a very attractive problem for the research community because it arises as a natural subproblem in many applications concerning the every day life. Indeed, each application, in which an optimal ordering of a number of items has to be chosen in a way that the total cost of a solution is determined by adding up the costs arising from two successively items, can be modelled as a TSP instance. Thus, studying TSP can never be considered as an abstract research with no real importance

Improved particle swarm optimization and gravitational search algorithm for parameter estimation in aspartate pathways

One of the main issues in biological system is to characterize the dynamic behaviour of the complex biological processes. Usually, metabolic pathway models are used to describe the complex processes that involve many parameters. It is important to have an accurate and complete set of parameters that describe the characteristics of a given model. Therefore, the parameter values are estimated by fitting the model with experimental data. However, the estimation on these parameters is typically difficult and even impossible in some cases. Furthermore, the experimental data are often incomplete and also suffer from experimental noise. These shortcomings make it challenging to identify the best-fit parameters that can represent the actual biological processes involved in biological systems. Previously, a computational approach namely optimization algorithms are used to estimate the measurement of the model parameters. Most of these algorithms previously often suffered bad estimation for the biological system models, which resulted in bad fitting (error) the model with the experimental data. This research proposes a parameter estimation algorithm that can reduce the fitting error between the models and the experimental data. The proposed algorithm is an Improved Particle Swarm Optimization and Gravitational Search Algorithm (IPSOGSA) to obtain the near-optimal kinetic parameter values from experimental data. The improvement in this algorithm is a local search, which aims to increase the chances to obtain the global solution. The outcome of this research is that IPSOGSA can outperform other comparison algorithms in terms of root mean squared error (RMSE) and predictive residual error sum of squares (PRESS) for the estimated results. IPSOGSA manages to score the smallest RMSE with 12.2125 and 0.0304 for Ile and HSP metabolite respectively. The predicted results are benefits for the estimation of optimal kinetic parameters to improve the production of desired metabolites

Neural network training using hybrid particle-move artificial bee colony algorithm for pattern classification

The Artificial Neural Networks Training (ANNT) process is an optimization problem of the weight set which has inspired researchers for a long time. By optimizing the training of the neural networks using optimal weight set, better results can be obtained by the neural networks.Traditional neural networks algorithms such as Back Propagation (BP) were used for ANNT, but they have some drawbacks such as computational complexity and getting trapped in the local minima.Therefore, evolutionary algorithms like the Swarm Intelligence (SI) algorithms have been employed in ANNT to overcome such issues.Artificial Bees Colony (ABC) optimization algorithm is one of the competitive algorithms in the SI algorithms group. However, hybrid algorithms are also a fundamental concern in the optimization field, which aim to cumulate the advantages of different algorithms into one algorithm. In this work, we aimed to highlight the performance of the Hybrid Particle-move Artificial Bee Colony (HPABC) algorithm by applying it on the ANNT application.The performance of the HPABC algorithm was investigated on four benchmark pattern-classification data sets and the results were compared with other algorithms.The results obtained illustrate that HPABC algorithm can efficiently be used for ANNT.HPABC outperformed the original ABC and PSO as well as other state-of-art and hybrid algorithms in terms of time, function evaluation number and recognition accuracy

Artificial Bee Colony training of neural networks: comparison with back-propagation

Abstract: The Artificial Bee Colony (ABC) is a swarm intelligence algorithm for optimization that has previously been applied to the training of neural networks. This paper examines more carefully the performance of the ABC algorithm for optimizing the connection weights of feed-forward neural networks for classification tasks, and presents a more rigorous comparison with the traditional Back-Propagation (BP) training algorithm. The empirical results for benchmark problems demonstrate that using the standard “stopping early ” approach with optimized learning parameters leads to improved BP performance over the previous comparative study, and that a simple variation of the ABC approach provides improved ABC performance too. With both improvements applied, the ABC approach does perform very well on small problems, but the generalization performances achieved are only significantly better than standard BP on one out of six datasets, and the training times increase rapidly as the size of the problem grows. If different, evolutionary optimized, BP learning rates are allowed for the two layers of the neural network, BP is significantly better than the ABC on two of the six datasets, and not significantly different on the other four

Driver drowsiness detection using Gray Wolf Optimizer based on voice recognition

Globally, drowsiness detection prevents accidents. Blood biochemicals, brain impulses, etc., can measure tiredness. However, due to user discomfort, these approaches are challenging to implement. This article describes a voice-based drowsiness detection system and shows how to detect driver fatigue before it hampers driving. A neural network and Gray Wolf Optimizer are used to classify sleepiness automatically. The recommended approach is evaluated in alert and sleep-deprived states on the driver tiredness detection voice real dataset. The approach used in speech recognition is mel-frequency cepstral coefficients (MFCCs) and linear prediction coefficients (LPCs). The SVM algorithm has the lowest accuracy (71.8%) compared to the typical neural network. GWOANN employs 13-9-7-5 and 30-20-13-7 neurons in hidden layers, where the GWOANN technique had 86.96% and 90.05% accuracy, respectively, whereas the ANN model achieved 82.50% and 85.27% accuracy, respective

Driver Drowsiness Detection Using Gray Wolf Optimizer Based on Voice Recognition

Globally, drowsiness detection prevents accidents. Blood biochemicals, brain impulses, etc., can measure tiredness. However, due to user discomfort, these approaches are challenging to implement. This article describes a voice-based drowsiness detection system and shows how to detect driver fatigue before it hampers driving. A neural network and Gray Wolf Optimizer are used to classify sleepiness automatically. The recommended approach is evaluated in alert and sleep-deprived states on the driver tiredness detection voice real dataset. The approach used in speech recognition is mel-frequency cepstral coefficients (MFCCs) and linear prediction coefficients (LPCs). The SVM algorithm has the lowest accuracy (71.8%) compared to the typical neural network. GWOANN employs 13-9-7-5 and 30-20-13-7 neurons in hidden layers, where the GWOANN technique had 86.96% and 90.05% accuracy, respectively, whereas the ANN model achieved 82.50% and 85.27% accuracy, respectively