A Study Of Vantage Point Neighbourhood Search In The Bees Algorithm For Combinatorial Optimization Problems

Tez (Yüksek Lisans) -- İstanbul Teknik Üniversitesi, Fen Bilimleri Enstitüsü, 2014Thesis (M.Sc. ) -- İstanbul Technical University, Institute of Science and Technology, 2014Bu tez çalışmasının temel amacı arıların kaynak arama davranışlarını modelleyen arı algoritmasının, kombinatoryal uzaylarda komşuluk arama fazına yeni bir yaklaşım geliştirilmesidir. Geliştirilen yaklaşım Gezgin Satıcı Problemine uygulanarak Gezgin Satıcı Problemi çözümünün en iyilenmesi amaçlanmıştır.This thesis focuses on nature-inspired optimisation algorithms, in particular, the Bees Algorithm that developed for combinatorial domains with new local search procedure and applied to Traveller Salesman Problem (TSP). An efficient and robust local neighborhood search algorithm is proposed for combinatorial domains to increase the efficiency of the Bees Algorithm.Yüksek LisansM.Sc

High dynamic range color image enhancement using fuzzy logic and bacterial foraging

High dynamic range images contain both the underexposed and the overexposed regions. The enhancement of the underexposed and the overexposed regions is the main concern of this paper. Two new transformation functions are proposed to modify the fuzzy membership values of under and the overexposed regions of an image respectively.For the overexposed regions, a rectangular hyperbolic function is used while for the underexposed regions, an S-function is applied. The shape and range of these functions can be controlled by the parameters involved, which are optimized using the bacterial foraging optimization algorithm so as to obtain the enhanced image. The hue, saturation, and intensity (HSV) color space is employed for the purpose of enhancement, where the hue component is preserved to keep the original color composition intact. This approach is applicable to a degraded image of mixed type. On comparison, the proposed transforms yield better results than the existing transformation functions17 for both the underexposed and the overexposed regions

Metaheuristic design of feedforward neural networks: a review of two decades of research

Over the past two decades, the feedforward neural network (FNN) optimization has been a key interest among the researchers and practitioners of multiple disciplines. The FNN optimization is often viewed from the various perspectives: the optimization of weights, network architecture, activation nodes, learning parameters, learning environment, etc. Researchers adopted such different viewpoints mainly to improve the FNN's generalization ability. The gradient-descent algorithm such as backpropagation has been widely applied to optimize the FNNs. Its success is evident from the FNN's application to numerous real-world problems. However, due to the limitations of the gradient-based optimization methods, the metaheuristic algorithms including the evolutionary algorithms, swarm intelligence, etc., are still being widely explored by the researchers aiming to obtain generalized FNN for a given problem. This article attempts to summarize a broad spectrum of FNN optimization methodologies including conventional and metaheuristic approaches. This article also tries to connect various research directions emerged out of the FNN optimization practices, such as evolving neural network (NN), cooperative coevolution NN, complex-valued NN, deep learning, extreme learning machine, quantum NN, etc. Additionally, it provides interesting research challenges for future research to cope-up with the present information processing era

A novel artificial bee colony based clustering algorithm for categorical data

Funding: This work was supported by the National Natural Science Foundation of China (NSFC) under Grant Nos. (21127010, 61202309, http://www.nsfc.gov.cn/), China Postdoctoral Science Foundation under Grant No. 2013M530956 (http://res.chinapostdoctor.org.cn), the UK Economic & Social Research Council (ESRC): award reference: ES/M001628/1 (http://www.esrc.ac.uk/), Science and Technology Development Plan of Jilin province under Grant No. 20140520068JH (http://www.jlkjt.gov.cn), Fundamental Research Funds for the Central Universities under No. 14QNJJ028 (http://www.nenu.edu.cn), the open project program of Key Laboratory of Symbolic Computation andKnowledge Engineering of Ministry of Education, Jilin University under Grant No. 93K172014K07 (http://www.jlu.edu.cn). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.Peer reviewedPublisher PD

Comprehensive Taxonomies of Nature- and Bio-inspired Optimization: Inspiration versus Algorithmic Behavior, Critical Analysis and Recommendations

In recent years, a great variety of nature- and bio-inspired algorithms has been reported in the literature. This algorithmic family simulates different biological processes observed in Nature in order to efficiently address complex optimization problems. In the last years the number of bio-inspired optimization approaches in literature has grown considerably, reaching unprecedented levels that dark the future prospects of this field of research. This paper addresses this problem by proposing two comprehensive, principle-based taxonomies that allow researchers to organize existing and future algorithmic developments into well-defined categories, considering two different criteria: the source of inspiration and the behavior of each algorithm. Using these taxonomies we review more than three hundred publications dealing with nature-inspired and bio-inspired algorithms, and proposals falling within each of these categories are examined, leading to a critical summary of design trends and similarities between them, and the identification of the most similar classical algorithm for each reviewed paper. From our analysis we conclude that a poor relationship is often found between the natural inspiration of an algorithm and its behavior. Furthermore, similarities in terms of behavior between different algorithms are greater than what is claimed in their public disclosure: specifically, we show that more than one-third of the reviewed bio-inspired solvers are versions of classical algorithms. Grounded on the conclusions of our critical analysis, we give several recommendations and points of improvement for better methodological practices in this active and growing research field.Comment: 76 pages, 6 figure

Hybrid ant colony system algorithm for static and dynamic job scheduling in grid computing

Grid computing is a distributed system with heterogeneous infrastructures. Resource management system (RMS) is one of the most important components which has great influence on the grid computing performance. The main part of RMS is the scheduler algorithm which has the responsibility to map submitted tasks to available resources. The complexity of scheduling problem is considered as a nondeterministic polynomial complete (NP-complete) problem and therefore, an intelligent algorithm is required to achieve better scheduling solution. One of the prominent intelligent algorithms is ant colony system (ACS) which is implemented widely to solve various types of scheduling problems. However, ACS suffers from stagnation problem in medium and large size grid computing system. ACS is based on exploitation and exploration mechanisms where the exploitation is sufficient but the exploration has a deficiency. The exploration in ACS is based on a random approach without any strategy. This study proposed four hybrid algorithms between ACS, Genetic Algorithm (GA), and Tabu Search (TS) algorithms to enhance the ACS performance. The algorithms are ACS(GA), ACS+GA, ACS(TS), and ACS+TS. These proposed hybrid algorithms will enhance ACS in terms of exploration mechanism and solution refinement by implementing low and high levels hybridization of ACS, GA, and TS algorithms. The proposed algorithms were evaluated against twelve metaheuristic algorithms in static (expected time to compute model) and dynamic (distribution pattern) grid computing environments. A simulator called ExSim was developed to mimic the static and dynamic nature of the grid computing. Experimental results show that the proposed algorithms outperform ACS in terms of best makespan values. Performance of ACS(GA), ACS+GA, ACS(TS), and ACS+TS are better than ACS by 0.35%, 2.03%, 4.65% and 6.99% respectively for static environment. For dynamic environment, performance of ACS(GA), ACS+GA, ACS+TS, and ACS(TS) are better than ACS by 0.01%, 0.56%, 1.16%, and 1.26% respectively. The proposed algorithms can be used to schedule tasks in grid computing with better performance in terms of makespan

Agoraphilic navigation algorithm in dynamic environment

This thesis presents a novel Agoraphilic (free space attraction [FSA])-based navigation algorithm. This new algorithm is capable of undertaking local path planning for robot navigation in static and dynamic environments with the presence of a moving goal. The proposed algorithm eliminates the common weaknesses of the existing navigation approaches when operating in unknown dynamic environments while using the modified Agoraphilic concept. The Agoraphilic Navigation Algorithm in Dynamic Environment (ANADE) presented in this thesis does not look for obstacles (problems) to avoid; rather, it looks for free space (solutions) to follow. Therefore, this algorithm is also a human-like optimistic navigation algorithm. The proposed algorithm creates a set of Free Space Forces (FSFs) based on the current and future growing free space around the robot. These Free Space Forces are focused towards the current and future locations of a moving goal and finally generate a single attractive force. This attractive force pulls the robot through current free space towards the future growing free space leading to the goal. The new free space concept allows the ANADE to overcome many common problems of navigation algorithms. Several versions of the ANADE have been developed throughout this research to overcome the main limitation of the original Agoraphilic algorithm and address the common weaknesses of the existing navigation approaches. The ANADE I uses an object tracking method to identify the states (locations) of moving objects accurately. The ANADE II uses a dynamic obstacle prediction methodology to identify the robot’s future environments. In the ANADE III, a novel controller based on fuzzy logic was developed and combined with the new FSA concept to provide optimal navigational solutions at a low computational cost. In the ANADE III, the effectiveness of the ANADE II was further improved by incorporating the velocity vectors of the moving objects into decision-making. In the ANADE IV, a self-tuning system was successfully applied to the ANADE III to take advantage of the performances of free space attraction-based navigation algorithms. The proposed final version of the algorithm (ANADE V) comprises nine main modules. These modules are repeatedly used to create the robot’s driving force, which pulls the robot towards the goal (moving or static). An obstacle tracking module is used to identify the time-varying free spaces by tracking the moving objects. Further, a tracking system is also used to track the moving goal. The capacity of the ANADE was strengthened further by obstacle and goal path prediction modules. Future location prediction allowed the algorithm to make decisions by considering future environments around the robot. This is further supported by a self-tuning, machine learning–based controller designed to efficiently account for the inherent high uncertainties in the robot’s operational environment at a reduced computational cost. Experimental and simulation-based tests were conducted under dynamic environments to validate the algorithm. Further, the ANADE was benchmarked against other recently developed navigation algorithms. Those tests were focused on the behaviour of the algorithm under challenging environments with moving and static obstacles and goals. Further, the test results demonstrate that the ANADE is successful in navigating robots under unknown, dynamically cluttered environments.Doctor of Philosoph

Meta-heuristic algorithms in car engine design: a literature survey

Meta-heuristic algorithms are often inspired by natural phenomena, including the evolution of species in Darwinian natural selection theory, ant behaviors in biology, flock behaviors of some birds, and annealing in metallurgy. Due to their great potential in solving difficult optimization problems, meta-heuristic algorithms have found their way into automobile engine design. There are different optimization problems arising in different areas of car engine management including calibration, control system, fault diagnosis, and modeling. In this paper we review the state-of-the-art applications of different meta-heuristic algorithms in engine management systems. The review covers a wide range of research, including the application of meta-heuristic algorithms in engine calibration, optimizing engine control systems, engine fault diagnosis, and optimizing different parts of engines and modeling. The meta-heuristic algorithms reviewed in this paper include evolutionary algorithms, evolution strategy, evolutionary programming, genetic programming, differential evolution, estimation of distribution algorithm, ant colony optimization, particle swarm optimization, memetic algorithms, and artificial immune system

A review: On path planning strategies for navigation of mobile robot

This paper presents the rigorous study of mobile robot navigation techniques used so far. The step by step investigations of classical and reactive approaches are made here to understand the development of path planning strategies in various environmental conditions and to identify research gap. The classical approaches such as cell decomposition (CD), roadmap approach (RA), artificial potential field (APF); reactive approaches such as genetic algorithm (GA), fuzzy logic (FL), neural network (NN), firefly algorithm (FA), particle swarm optimization (PSO), ant colony optimization (ACO), bacterial foraging optimization (BFO), artificial bee colony (ABC), cuckoo search (CS), shuffled frog leaping algorithm (SFLA) and other miscellaneous algorithms (OMA) are considered for study. The navigation over static and dynamic condition is analyzed (for single and multiple robot systems) and it has been observed that the reactive approaches are more robust and perform well in all terrain when compared to classical approaches. It is also observed that the reactive approaches are used to improve the performance of the classical approaches as a hybrid algorithm. Hence, reactive approaches are more popular and widely used for path planning of mobile robot. The paper concludes with tabular data and charts comparing the frequency of individual navigational strategies which can be used for specific application in robotics