A Hybrid Chaotic Biogeography Based Optimization for the Sequence Dependent Setup Times Flowshop Scheduling Problem With Weighted Tardiness Objective

Evolutionary biogeography-based whale optimization methods with communication structure: Towards measuring the balance

The permutation flow shop problem (PFSSP) is an NP-hard problem of wide engineering and theoretical background. In this paper, a biogeography based optimization (BBO) based on memetic algorithm, named HBBO is proposed for PFSSP. Firstly, to make BBO suitable for PFSSP, a new LRV rule based on random key is introduced to convert the continuous position in BBO to the discrete job permutation. Secondly, the NEH heuristic was combined with the random initialization to initialize the population with certain quality and diversity. Thirdly, a fast local search is used for enhancing the individuals with a certain probability. Fourthly, the pair wise based local search is used to enhance the global optimal solution and help the algorithm to escape from local minimum. Additionally, simulations and comparisons based on PFSSP benchmarks are carried out, showing that our algorithm is both effective and efficient. Key words: Biogeography based optimization, permutation flow shop scheduling, memetic algorithm, local search.

Landing aircraft safely is an important operation that air traffic controllers have to deal with on a daily basis. For each arriving aircraft a runway and a landing time must be allocated. If these allocations can be done in an efficient way, it could give the airport a competitive advantage. The Aircraft Landing Problem (ALP) aims to minimize the deviation from a preferred target time of each aircraft. It is an NP-hard problem, meaning that we may have to resort to heuristic methods as exact methods may not be suitable, especially as the problem size increases. This paper proposes an iterated local search (ILS) algorithm for the ALP. ILS is a single solution based search methodology that successively invokes a local search procedure to find a local optimum solution. A perturbation operator is used to modify the current solution in order to escape from the local optimum and to provide a new solution for the local search procedure. As different problems and/or instances have different characteristics, the success of the ILS is highly dependent on the local search, the perturbation operator(s) and the perturbation strength. To address these issues, we utilize four perturbation operators and a time varying perturbation strength which changes as the algorithm progresses. A variable neighborhood descent algorithm is used as our local search. The proposed ILS generates high quality solutions for the ALP benchmark instances taken from the scientific literature, demonstrating its efficiency in terms of both solution quality and computational time. Moreover, the proposed ILS produces new best results for some instances.

Biogeography-based Optimization (BBO) Algorithm for Single Machine Total Weighted Tardiness Problem (SMTWTP)

This article presents a hybrid model involving artificial neural networks and biogeography-based optimization for long-term forecasting of India's sector-wise electrical energy demand. It involves socio-economic indicators, such as population and per capita gross domestic product, and uses two artificial neural networks, which are trained through a biogeography-based optimization algorithm with a goal of perfect mapping of the input–output data in the non-linear space through obtaining the global best weight parameters. The biogeography-based optimization based training of the artificial neural network improves the forecasting accuracy and avoids trapping in local optima besides enhancing the convergence to the lowest mean squared error at the minimum number of iterations than existing approaches. The model requires an input and the year of the forecast and predicts the sector-wise energy demand. Forecasts up to the year 2025 are compared with those of the regression model, the artificial neural network model trained by back-propagation, and the artificial neural network model trained by harmony search algorithm to exhibit its effectiveness.

Technology has enabled us to carry the world on our tips. Cloud computing has majorly contributed to this by providing infrastructure services on the go using pay per use model and with high quality of services. Cloud services provide resources through various distributed datacenters and client requests been fulfilled over these datacenters which act as resources. Therefore, resource allocation plays an important role in providing a high quality of service like utilization, network delay and finish time. Biogeography-based optimization (BBO) is an optimization algorithm that is an evolutionary algorithm used to find optimized solution. In this work BBO algorithm is been used for resource optimization problem in cloud environment at infrastructure as a service level. In past several task scheduling algorithms are being proposed to find a global best schedule to achieve least execution time and high performance like genetic algorithm, ACO and many more but as compared to GA, BBO has high probability to find global best solution. Existing solutions aim toward improving performance in term of power execution time, but they have not considered network performance and utilization of the systems performance parameters. Therefore, to improve the performance of cloud in network-aware environment we have proposed an efficient nature inspired BBO algorithm. Further, the proposed approach takes network overhead and utilization of the system into consideration to provide improved performance as compared to ACO, Genetic algorithm as well as with PSO.

As an essential factor of evolutionary algorithms (EAs), mutation operator plays an important role in exploring the search space, maintaining the diversity of individuals and breaking away local optimums. In most standard evolutionary algorithms, the mutation operator is independent from the recombination operator. Nevertheless, in biogeography-based optimization (BBO), the mutation operator is affected not only by predefined constants but also by recombination models, namely the migration operator. However to date, the relationship between the mutation and migration has never been investigated. To reveal the relationship and evaluate the mutation models, we utilize drift analysis to investigate the expected first hitting time of BBO with different migration models. The analysis compares three different kinds of mutation models in a mathematical way and the conclusion is helpful for designing migration models of BBO. The simulation results are also in agreement with our analysis.

Recent trend of research is to hybridize two and more metaheuristics algorithms to obtain superior solution in the field of optimization problems. This paper proposes a newly developed wrapper‐based feature selection method based on the hybridization of Biogeography Based Optimization (BBO) and Sine Cosine Algorithm (SCA) for handling feature selection problems. The position update mechanism of SCA algorithm is introduced into the BBO algorithm to enhance the diversity among the habitats. In BBO, the mutation operator is got rid of and instead of it, a position update mechanism of SCA algorithm is applied after the migration operator, to enhance the global search ability of Basic BBO. This mechanism tends to produce the highly fit solutions in the upcoming iterations, which results in the improved diversity of habitats. The performance of this Improved BBO (IBBO) algorithm is investigated using fourteen benchmark datasets. Experimental results of IBBO are compared with eight other search algorithms. The results show that IBBO is able to outperform the other algorithms in majority of the datasets. Furthermore, the strength of IBBO is proved through various numerical experiments like statistical analysis, convergence curves, ranking methods, and test functions. The results of the simulation have revealed that IBBO has produced very competitive and promising results, compared to the other search algorithms.

Edge computing can be widely used in unmanned aerial vehicle (UAV) inspection, field operation control, power consumption information collection and other businesses in the power Internet of Things scene. Edge computing offloads functions such as data processing and applications to network edge nodes near the terminals to provide low-latency services and ensure service quality. However, with the explosive growth of business terminals, the capacity of single edge node is limited and it is difficult to meet all business requirements at the same time. Therefore, this article proposes a task allocation mechanism based on cooperative edge computing. Firstly, a task allocation model based on cooperation of two edge nodes is established to minimize the average task completion delay while meeting business requirements. Secondly, the Two-edge-node Cooperative-task Allocation based on Improved Particle Swarm Optimization (TCA-IPSO) algorithm is proposed, which applies the crossover and mutation strategy in genetic algorithm to improve the particle swarm optimization algorithm, and solves the problem that the task allocation scheme in cooperation is prone to fall into a local optimum. Finally the simulation results show that the proposed TCA-IPSO algorithm reduces the average task completion delay by 53.8% and 36.0% compared to the benchmark and QoS-based Task Distribution (QBTD) algorithm.

Bat algorithm (BA) is a population based stochastic search technique encouraged from the intrinsic manner of bee swarm seeking for their food source. BA has been mostly used to resolve diverse kind of optimization problems and one of major issue faced by BA is frequently captured in local optima meanwhile handling the complex real world problems. Many authors improved the standard BA with different mutation strategies but an exhausted comprehensive overview about mutation strategies is still lacking. This paper aims to furnish a concise and comprehensive study of problems and challenges that prevent the performance of BA. It has been tried to provide guidelines for the researchers who are active in the area of BA and its mutation strategies. The objective of this study is divided in two sections: primarily to display the improvement of BA with mutation strategies that may enhance the performance of standard BA up to great extent and secondly, to motivate the researchers and developers for using BA to solve the complex real world problems. This study presents a comprehensive survey of the various BA algorithms based on mutation strategies. It is anticipated that this survey would be helpful to study the BA algorithm in detail for the researcher.

The Particle swarm optimization (PSO) algorithm is a population-based intelligent stochastic search technique encouraged from the intrinsic manner of bee swarm seeking for their food source. With flexibility for numerical experimentation, the PSO algorithm has been mostly used to resolve diverse kind of optimization problems. The PSO algorithm is frequently captured in local optima meanwhile handling the complex real-world problems. Many authors improved the standard PSO algorithm with different mutation strategies but an exhausted comprehensive overview about mutation strategies is still lacking. This article aims to furnish a concise and comprehensive study of problems and challenges that prevent the performance of the PSO algorithm. It has tried to provide guidelines for the researchers who are active in the area of the PSO algorithm and its mutation strategies. The objective of this study is divided into two sections: primarily to display the improvement of the PSO algorithm with mutation strategies that may enhance the performance of the standard PSO algorithm to great extent and secondly, to motivate researchers and developers to use the PSO algorithm to solve the complex real-world problems. This study presents a comprehensive survey of the various PSO algorithms based on mutation strategies. It is anticipated that this survey would be helpful to study the PSO algorithm in detail for researchers.

This paper presents a shuffled frog leaping algorithm (SFLA) based solution to solve the View Selection Problem (VSP) subject to dual constraints, which is often used to accelerate data warehouse queries. Since VSP is both discrete and constrained, a greedy-repaired strategy under dual constraints is proposed to handle unfeasible solutions. This proposed solution also profits from a mutation strategy in order to improve the quality of solutions, particularly to avoid being trapped in local optima. Experimental results show that under different constraints combinations, SFLA is able to find a near-optimal feasible solution, with maximum error less than 1%. Comparisons with GA and PSO show that SFLA has better solution quality and faster convergence rate, and also scales with the problem size.

Mutation and dynamic objective-based farmland fertility algorithm for workflow scheduling in the cloud

A nonlinear African vulture optimization algorithm combining Henon chaotic mapping theory and reverse learning competition strategy

The biogeography-based optimisation (BBO) algorithm is a novel evolutionary algorithm inspired by biogeography. Similarly, to other evolutionary algorithms, entrapment in local optima and slow convergence speed are two probable problems it encounters in solving challenging real problems. Due to the novelty of this algorithm, however, there is little in the literature regarding alleviating these two problems. Chaotic maps are one of the best methods to improve the performance of evolutionary algorithms in terms of both local optima avoidance and convergence speed. In this study, we utilise ten chaotic maps to enhance the performance of the BBO algorithm. The chaotic maps are employed to define selection, emigration, and mutation probabilities. The proposed chaotic BBO algorithms are benchmarked on ten test functions. The results demonstrate that the chaotic maps (especially Gauss/mouse map) are able to significantly boost the performance of BBO. In addition, the results show that the combination of chaotic selection and emigration operators results in the highest performance.