Improved Smell Agent Optimization Sizing Technique Algorithm for a Grid-Independent Hybrid Renewable Energy System

This chapter discuss an improvement on the novel computational intelligent algorithm using the smell phenomenon. In the standard smell agent optimization algorithm, the olfactory capacity is constant thereby assuming that every smell agent has the same sensing capacity. In the improved smell agent optimization algorithm, that is changed to account for the difference in smell agent capacity. The algorithm was run against the standard smell agent optimization on Matlab to find the best HRES design using annual cost, Levelized cost of electricity (LCE), loss of power supply probability (LPSP) and excess energy. It was shown after the comparative analysis that there was a 79%, 99.9% and 53.4% improvement for annual cost, LCE and LPSP respectively. Statistically, results showed that the iSAO obtained the most cost effective HRES design compared to the benchmarked algorithms

Optimized Feedback-based Traffic Congestion Pricing and Control for Improved Return on Investment (ROI)

Traffic congestion is a serious problem in any developing society. One of the approaches used in addressing this problem is congestion pricing. In this paper, the effects of social behavior on congestion pricing and control were considered and a scenario of a 1 x 2 traffic tolling system is used. Also, this work considers the rate of return on investment (RoI) of toll facilities in order to justify the worthiness of the design to investors. In earlier works on feedback-based traffic congestion pricing, the traffic parameters in the logit expression were selected arbitrarily and this made it difficult for traffic designers to arrive at optimum parameters within a reasonable amount of time. In order to address this challenge, the traffic parameter problem is formulated into a traffic congestion control optimization problem whose goal is to maximize the congestion price. The constraints are boundaries for the traffic parameters and the investment boundary conditions. The fitness of the formulated optimization problem was determined using genetic algorithm (GA). A number of simulations were performed by considering different multiplication factors and results were obtained for each multiplication factor (m.f). The simulation results justify the exactness of the formulated optimization problem and the superior performance of this work over the one that involves manually selection of traffic parameters

Optimized Model Simulation of a Capacitated Vehicle Routing problem based on Firefly Algorithm

This paper presents an optimized solution to a capacitated vehicle routing (CVRP) model using firefly algorithm (FFA). The main objective of a CVRP is to obtain the minimum possible total travelled distance across a search space. The conventional model is a formal description involving mathematical equations formulated to simplify a more complex structure of logistic problems. These logistic problems are generalized as the vehicle routing problem (VRP). When the capacity of the vehicle is considered, the resulting formulation is termed the capacitated vehicle routing problem (CVRP). In a practical scenario, the complexity of CVRP increases when the number of pickup or drop-off points increase making it difficult to solve using exact methods. Thus, this paper employed the intelligent behavior of FFA for solving the CVRP model. Two instances of solid waste management and supply chain problems is used to evaluate the performance of the FFA approach. In comparison with particle swarm optimization and few other ascribed metaheuristic techniques for CVRP, results showed that this approach is very efficient in solving a CVRP model

Development of Hybrid Automatic Segmentation Technique of a Single Leaf from Overlapping Leaves Image

The segmentation of a single leaf from an image with overlapping leaves is an important step towards the realization of effective precision agricultural systems. A popular approach used for this segmentation task is the hybridization of the Chan-Vese model and the Sobel operator CV-SO. This hybridized approach is popular because of its simplicity and effectiveness in segmenting a single leaf of interest from a complex background of overlapping leaves. However, the manual threshold and parameter tuning procedure of the CV-SO algorithm often degrades its detection performance. In this paper, we address this problem by introducing a dynamic iterative model to determine the optimal parameters for the CV-SO algorithm, which we dubbed the Dynamic CV-SO (DCV-SO) algorithm. This is a new hybrid automatic segmentation technique that attempts to improve the detection performance of the original hybrid CV-SO algorithm by reducing its mean error rate. The results obtained via simulation indicate that the proposed method yielded a 1.23% reduction in the mean error rate against the original CV-SO method

A Hybrid Fuzzy Time Series Technique for Forecasting Univariate Data

In this paper a hybrid forecasting technique that integrates Cat Swarm optimization Clustering (CSO-C) and Particle Swarm Optimization (PSO) with Fuzzy Time Series (FTS) forecasting is presented. In the three stages of FTS, CSO-C found application at the fuzzification module where its efficient capability in terms of data classification was utilized to neutrally divide the universe of discourse into unequal parts. Then, disambiguated fuzzy relationships were obtained using Fuzzy Set Group (FSG). In the final stage, PSO was adopted for optimization; by tuning weights assigned to fuzzy sets in a rule. This rule is a fuzzy logical relationship induced from FSG. The forecasting results showed that the proposed method outperformed other existing methods; using RMSE and MAPE as performance metrics.            

Development of a Dynamic Cuckoo Search Algorithm

This research is aimed at the developing a modified cuckoo search algorithm called dynamic cuckoo search algorithm (dCSA). The standard cuckoo search algorithm is a metaheuristics search algorithm that mimic the behavior of brood parasitism of some cuckoo species and Levy flight behavior of some fruit flies and birds. It, however uses fixed value for control parameters (control probability and step size) and this method have drawbacks with respect to quality of the solutions and number of iterations to obtain optimal solution. Therefore, the dCSA is developed to address these problems in the CSA by introducing random inertia weight strategy to the control parameters so as to make the control parameters dynamic with respect to the proximity of a cuckoo to the optimal solution. The developed dCSA was compared with CSA using ten benchmark test functions. The results obtained indicated the superiority of dCSA over CSA by generating a near global optimal result for 9 out of the ten benchmark test functions

Drone’s node placement algorithm with routing protocols to enhance surveillance

Flying ad-hoc network (FANET) is characterized by key component features such as communication scheme, energy awareness, and task distribution. In this research, a surveillance space considering standard petroleum pipe was created with three drones viz: drone 1 (D1), master drone (DM), and drone 2 (D2) to survey as FANET. DM aggregate packets from D1, D2 and communicate with the static ground control station (SGCS). The starting point of the three drones and their trajectories during deployment were calculated and simulated. Selection of DM, D1, and D2 was done using battery level before take-off. Simulation results show take-off time difference which depends on the distance of each drone to the SGCS during deployment. D1 take-off first, while DM and D2 followed after 0.0704 and 0.1314 ms respectively. The position-oriented routing protocols results indicated variation of information flow within time notch due to variation in the density of the transmitted packets. Packets delivery periods are 0.00136×103 sec, 0.00110×103 sec, and 0.00246×103 sec for time notch 1, 2, and aggregating time notch respectively. From the results obtained, two algorithms were used successfully in deploying the drone

Single- and multi-objective modified aquila optimizer for optimal multiple renewable energy resources in distribution network

Nowadays, the electrical power system has become a more complex, interconnected network that is expanding every day. Hence, the power system faces many problems such as increasing power losses, voltage deviation, line overloads, etc. The optimization of real and reactive power due to the installation of energy resources at appropriate buses can minimize the losses and improve the voltage profile, especially for congested networks. As a result, the optimal distributed generation allocation (ODGA) problem is considered a more proper tool for the processes of planning and operation of power systems due to the power grid changes expeditiously based on the type and penetration level of renewable energy sources (RESs). This paper modifies the AO using a quasi-oppositional-based learning operator to address this problem and reduce the burden on the primary grid, making the grid more resilient. To demonstrate the effectiveness of the MAO, the authors first test the algorithm performance on twenty-three competitions on evolutionary computation benchmark functions, considering different dimensions. In addition, the modified Aquila optimizer (MAO) is applied to tackle the optimal distributed generation allocation (ODGA) problem. The proposed ODGA methodology presented in this paper has a multi-objective function that comprises decreasing power loss and total voltage deviation in a distribution system while keeping the system operating and security restrictions in mind. Many publications investigated the effect of expanding the number of DGs, whereas others found out the influence of DG types. Here, this paper examines the effects of different types and capacities of DG units at the same time. The proposed approach is tested on the IEEE 33-bus in different cases with several multiple DG types, including multi-objectives. The obtained simulation results are compared to the Aquila optimizer, particle swarm optimization algorithm, and trader-inspired algorithm. According to the comparison, the suggested approach provides a superior solution for the ODGA problem with faster convergence in the DN

DEVELOPMENT OF AUTOMATED CERAMIC TILES SURFACE DEFECT DETECTION AND CLASSIFICATION SYSTEM

This research presented the development of an automated system for ceramic tiles surface defect detection and classification. The production process of ceramic tiles is very fast through the use of automated system except the inspection process that is manually carried out. The fast rate of production and numerous amounts to be produced make it difficult to manually inspect the tiles defects. Currently many literatures have proposed various automated systems for detecting and classifying defects on ceramic tiles. In this research different defected and non-defected images of ceramic tiles were taking at the firing unit in a Ceramic Company with a Nikon D40 camera. A statistical method called Rotation Invariant Measure of Local Variance (RIMLV) operator was used for detection of the defects while morphological operator was used to fill and smooth detected regions. Then, the detected defects are labelled to extract the corresponding features vectors using Fourier descriptors. To categorize the defect, multi-class support vector machine classifier (SVM) was used. The proposed system recorded an accuracy of 98 percent for classification and 0.094939 seconds for classification using one-against all SVM classifier