Marriage In Honey Bees Optimization Research Articles

Chaotic Honeybees Optimization Algorithms Approach for Traveling Salesperson Problem

Due to the difficulty in solving combinatorial optimization problems, it is necessary to improve the performance of the algorithms by improving techniques to deal with complex optimizations. This research addresses the metaheuristics of marriage in honey‐bees optimization (MBO) based on the behavior of bees. The current study proposes a technique for solving combinatorial optimization problems within proper computation times. The purpose of this study focuses on the travelling salesperson problem and the application of chaotic methods in important sections of the MBO metaheuristic. Three experiments were conducted to measure the efficiency and quality of the solutions: (1) MBO with chaos to generate initial solutions (MBO2); (2) MBO with chaos in the workers (MBO3); and (3) MBO with chaos to generate initial solutions and the workers (MBO4). The application of chaotic functions in MBO was significantly better at solving the travelling salesperson problem.

Memetic algorithm based on marriage in honey bees optimization for flexible job shop scheduling problem

This paper proposes a new memetic algorithm based on marriage in honey bees optimization (MBO) algorithm for solving the flexible job shop scheduling problem. The proposed algorithm introduces four new features to the standard MBO algorithm, mainly to get the search to move away from the local optimum: (1) the use of a harmony memory to improve the quality of initial population; (2) the introduction of a new crossover operator called triparental crossover to help increase the genetic diversity in the offspring; (3) the addition of adaptive crossover probability ( $$\hbox {P}_{\mathrm{c}})$$ and mutation probability ( $$\hbox {P}_{\mathrm{m}})$$ to remove the need for users to specify these probabilities; and (4) the incorporation of simulated annealing algorithm embedded with a set of heuristics to enhance the local search capability. The proposed algorithm was evaluated and compared to several state-of-the-art algorithms in the literature. The experimental results on five sets of standard benchmarks show that the proposed algorithm is very effective in solving the flexible job shop scheduling problems.

Materialized View Selection using Marriage in Honey Bees Optimization

Data warehouse was designed to cater to the strategic decision making needs of an organization. Most queries posed on them are on-line analytical queries, which are complex and computation intensive in nature and have high query response times when processed against a large data warehouse. This time can be substantially reduced by materializing pre-computed summarized views and storing them in a data warehouse. All possible views cannot be materialized due to storage space constraints. Also, an optimal selection of subsets of views is shown to be an NP-Complete problem. This problem of view selection has been addressed in this paper by selecting a beneficial set of views, from amongst all possible views, using the swarm intelligence technique Marriage in Honey Bees Optimization (MBO). An MBO based view selection algorithm (MBOVSA), which aims to select views that incur the minimum total cost of evaluating all the views (TVEC), is proposed. In MBOVSA, the search has been intensified by incorporating the royal jelly feeding phase into MBO. MBOVSA, when compared with the most fundamental greedy based view selection algorithm HRUA, is able to select comparatively better quality views.

Algorithm of Marriage in Honey Bees Optimization Coperate with Linear Method

Marriage in Honey Bees Optimization (MBO) is a new swarm-intelligence method, but it has the shortcomings of low speed and complex computation process. By changing the structure of MBO and utilizing a linear method to perform the local characteristic, we propose a new optimization algorithm. The global convergence characteristic of the proposed algorithm is proved by using the Markov Chain theory. And then some simulations are done on Traveling Salesman Problem (TSP) and several public evaluation functions. By comparing the proposed algorithm with MBO and Genetic Algorithm, simulation results show that the proposed algorithm has better convergence performance.

An Improved Marriage in Honey Bees Optimization Algorithm for Single Objective Unconstrained Optimization

Marriage in honey bees optimization (MBO) is a metaheuristic optimization algorithm developed by inspiration of the mating and fertilization process of honey bees and is a kind of swarm intelligence optimizations. In this study we propose improved marriage in honey bees optimization (IMBO) by adding Levy flight algorithm for queen mating flight and neighboring for worker drone improving. The IMBO algorithm's performance and its success are tested on the well-known six unconstrained test functions and compared with other metaheuristic optimization algorithms.

Swarm Intelligence and Its Applications

Swarm Intelligence and Its Applications

Bee life-based multi constraints multicast routing optimization for vehicular ad hoc networks

A vehicular ad hoc network (VANET) is a subclass of mobile ad hoc networks, considered as one of the most important approach of intelligent transportation systems (ITS). It allows inter-vehicle communication in which their movement is restricted by a VANET mobility model and supported by some roadside base stations as fixed infrastructures. Multicasting provides different traffic information to a limited number of vehicle drivers by a parallel transmission. However, it represents a very important challenge in the application of vehicular ad hoc networks especially, in the case of the network scalability. In the applications of this sensitive field, it is very essential to transmit correct data anywhere and at any time. Consequently, the VANET routing protocols should be adapted appropriately and meet effectively the quality of service (QoS) requirements in an optimized multicast routing. In this paper, we propose a novel bee colony optimization algorithm called bees life algorithm (BLA) applied to solve the quality of service multicast routing problem (QoS-MRP) for vehicular ad hoc networks as NP-Complete problem with multiple constraints. It is considered as swarm-based algorithm which imitates closely the life of the colony. It follows the two important behaviors in the nature of bees which are the reproduction and the food foraging. BLA is applied to solve QoS-MRP with four objectives which are cost, delay, jitter, and bandwidth. It is also submitted to three constraints which are maximum allowed delay, maximum allowed jitter and minimum requested bandwidth. In order to evaluate the performance and the effectiveness of this realized proposal using C++ and integrated at the routing protocol level, a simulation study has been performed using the network simulator (NS2) based on a mobility model of VANET. The comparisons of the experimental results show that the proposed algorithm outperformed in an efficient way genetic algorithm (GA), bees algorithm (BA) and marriage in honey bees optimization (MBO) algorithm as state-of-the-art conventional metaheuristics applied to QoS-MRP problem with the same simulation parameters.

Forecasting output of integrated circuit industry by support vector regression models with marriage honey-bees optimization algorithms

Integrated circuit (IC) is a vital component of most electronic commodity. IC manufacturing in Taiwan is booming, with revenues from the ICs industry having grown significantly in the recent years. Given the nature of technology, capital intensity and high value-added, accurate forecasting of IC the industry output can improve the competitivity of IC cooperation. Support vector regression (SVR) is an emerging forecasting scheme that has been successfully adopted in many time-series forecasting areas. Additionally, the data preprocessing procedure and the determination of SVR parameters significantly impact the forecasting accuracy of SVR models. Thus, this work develops a support vector regression model with scaling preprocessing and marriage in honey-bee optimization (SVRSMBO) model to accurately forecast IC industry output. The scaling preprocessing procedure is utilized to lower the fluctuation of input data, and the marriage in honey-bees optimization (MBO) algorithm is adopted to determine the three parameters of the SVR model. Numerical data collected from the previous literature are used to demonstrate the performance of the proposed SVRSMBO model. Simulation results indicate that the SVRSMBO model outperforms other forecasting models. Hence, the SVRSMBO model is a promising means of forecasting IC industry output.

A Multi-objective Evolutionary Algorithm of Marriage in Honey Bees Optimization Based on the Local Particle Swarm Optimization

Marriage in Honey Bees Optimization (MBO) is a new swarm-intelligence method, but existing researches concentrate more on its application in single-objective optimization. In this paper, we focus on improving the algorithm to solve the multi-objective problem and increasing its convergence speed. The proposed algorithm is named as multi-objective Particle Swarm Marriage in Honey Bees Optimization (MOPSMBO). It uses non-dominated sorting strategy and crowded-comparison approach, utilizes the local Particle Swarm Optimization (PSO) to perform the local characteristic, and simpler the structure of MBO. Based on the Markov chain theory, we prove that MOPSMBO can converge with probability one to the entire set of minimal elements. Simulations are done on several multi-objective test functions and multi-objective Traveling Salesman Problem (TSP). By comparing MOPSMBO with MOGA, NPGA, NSGA and NSGA-II, simulation results show that MOPSMBO has better convergence speed and can better converge near the true Pareto-optimal front.

Converging Marriage in Honey-Bees Optimization and Application to Stochastic Dynamic Programming

In this paper, we first refine a recently proposed metaheuristic called "Marriage in Honey-Bees Optimization" (MBO) for solving combinatorial optimization problems with some modifications to formally show that MBO converges to the global optimum value. We then adapt MBO into an algorithm called "Honey-Bees Policy Iteration" (HBPI) for solving infinite horizon-discounted cost stochastic dynamic programming problems and show that HBPI also converges to the optimal value.

A TRUE ANNEALING APPROACH TO THE MARRIAGE IN HONEY-BEES OPTIMIZATION ALGORITHM

Marriage in Honey-Bees Optimization is a new swarm intelligence technique inspired by the marriage process of honey-bees. It has been shown to be very effective in solving the propositional satisfiability problem known as 3-SAT. The objective of this paper is to test a conventional annealing approach as the basis for determining the pool of drones. The modified algorithm is tested using a group of randomly generated hard 3-SAT problems to compare its behavior and efficiency against previous implementations. The overall performance of the MBO algorithm was found to have improved significantly using the proposed annealing function. Furthermore, a dramatic improvement was noted with the committee machine using this true annealing approach.