Vehicle Routing Problems Based on Harris Hawks Optimization

The vehicle routing problem (VRP) is one of the challenging problems in optimization and can be described as combinatorial optimization and NP-hard problem. Researchers have used many artificial intelligence techniques in order to try to solve this problem. Among these techniques, metaheuristic algorithms that can perform random search are the most promising because they can be used to find the right solution in the shortest possible time. Therefore, in this paper, the Harris hawks optimization (HHO) algorithm was used to attempt to solve the VRP. The algorithm was applied to 10 scenarios and the experimental results revealed that the HHO had a strong ability to check for and find the best route as compared to other metaheuristic algorithms, namely, simulated annealing and artificial bee colony optimization. The comparison was based on three criteria: minimum objective function obtained, minimum number of iterations required and satisfaction of capacity constraints. In all scenarios, the HHO showed clear superiority over the other methods.

Mining of structural motifs in proteins using artificial bee colony optimization framework for druggability

In this work, we have developed an optimization framework for digging out common structural patterns inherent in DNA binding proteins. A novel variant of the artificial bee colony optimization algorithm is proposed to improve the exploitation process. Experiments on four benchmark objective functions for different dimensions proved the speedier convergence of the algorithm. Also, it has generated optimum features of Helix Turn Helix structural pattern based on the objective function defined with occurrence count on secondary structure. The proposed algorithm outperformed the compared methods in convergence speed and the quality of generated motif features. The motif locations obtained using the derived common pattern are compared with the results of two other motif detection tools. 92% of tested proteins have produced matching locations with the results of the compared methods. The performance of the approach was analyzed with various measures and observed higher sensitivity, specificity and area under the curve values. A novel strategy for druggability finding by docking studies, targeting the motif locations is also discussed.

The use of band similarity in urban water demand forecasting as a new method

Water consumptions and demands by persons vary from time to time and from location to location depending on countless factors, notably, population, socio-economic and climatic variables. Today, studies which create models on water consumption of persons, using numerous methods including artificial neural networks and regression models in this regard and ensure that projections are made are ongoing. In this study; parameters affecting water consumption were examined within the scope of the study area, and the parameter reduction was realized with the help of the Factor Analysis. Then, as a new method, the Band Similarity method was used together with the Artificial Bee Colony optimization algorithm, and urban water demand models were produced and the temporal dependence of the relevant variables was examined. As a result of the study, it was seen that the Band Similarity method improved the results obtained with the optimization algorithm and helped to understand the temporal dependencies of the variables. The fact that the Band Similarity method, which was put forward for the first time in its field, worked successfully and produced results, can be said to be the main contribution of this study to the knowledge.

Protruder optimization-based routing protocol for energy efficient routing in Wireless Sensor Networks

The energy efficiency problem is addressed using the Cluster Head (CH) formation, data aggregation, and routing techniques. Therefore,an energy-aware routing algorithm named as protruder optimization algorithm is proposed, which boosts the network lifetime through finding the optimal routing path. The proposed protruder optimization is developed with the hybridization of the wave propagator characteristics and weed characteristics in such a way that the global optimal convergence is boosted while selecting the optimal routing path. Moreover, the communication in the network through the optimal path is progressed through the optimal CHs selection based on fractional artificial bee colony optimization (FABC) and in turn, the energy minimization problem is aided with data aggregation process using sliding window approach that avoids retransmission of the data. The results of the proposed method are compared with the existing methods on the basis of its performance measures such as energy, alive nodes and throughput.

Artificial Bee Colony Optimization Algorithm for Enhancing Routing in Wireless Networks

The throughput of wireless multi-channel networks are enhanced using artificial intelligence algorithm. The performance of the network may be improved while reducing the interference. This technique involves three steps namely creation of wireless environment specific model, performance optimization using the right tools and improvement of routing by selecting the performance indicators cautiously. Artificial bee colony optimization algorithm and its evaluative features positively affects communication in wireless networks. The simple behavior of bee agents in this algorithm assist in making synchronous and decentralized routing decisions. The advantages of this algorithm is evident from the MATLAB simulations. The nature inspired routing algorithm offers improved performance when compared to the existing state-of-the-art models. The simple agent model can improve the performance values of the network. The breadth first search variant is utilized for discovery and deterministic evaluation of multiple-paths in the network increasing the overall routing protocol output.