Cooperative Artificial Bee Colony Algorithm With Multiple Populations for Interval Multiobjective Optimization Problems

Evacuation is an important activity for reducing the number of casualties and amount of damage in disaster management. Evacuation planning is tackled as a spatial optimization problem. The decision-making process for evacuation involves high uncertainty, conflicting objectives, and spatial constraints. This study presents a Multi-Objective Artificial Bee Colony (MOABC) algorithm, modified to provide a better solution to the evacuation problem. The new approach combines random swap and random insertion methods for neighborhood search, the two-point crossover operator, and the Pareto-based method. For evacuation planning, two objective functions were considered to minimize the total traveling distance from an affected area to shelters and to minimize the overload capacity of shelters. The developed model was tested on real data from the city of Kigali, Rwanda. From computational results, the proposed model obtained a minimum fitness value of 5.80 for capacity function and 8.72 × 108 for distance function, within 161 s of execution time. Additionally, in this research we compare the proposed algorithm with Non-Dominated Sorting Genetic Algorithm II and the existing Multi-Objective Artificial Bee Colony algorithm. The experimental results show that the proposed MOABC outperforms the current methods both in terms of computational time and better solutions with minimum fitness values. Therefore, developing MOABC is recommended for applications such as evacuation planning, where a fast-running and efficient model is needed.

Targeting at the parameters reconfiguration of a cognitive radio system, a novel cognitive decision engine (CDE), based on an improved multi-objective artificial bee colony (IMOABC) algorithm and f...

Grain is an important economic and strategic material of the country. In grain transportation, it is necessary to consider the running time, vehicle number, path length and other factors at the same time, which is a typical multi-objective problem, but also a NP-Hard problem. In this paper, an Artificial Bee Colony algorithm is introduced to solve the routing problem of grain transportation vehicles with multi-objective and time windows. Combined with the practical problems of grain transportation, the standard Artificial Bee Colony algorithm is improved in four aspects: population initialization, domain search mode, bulletin board setting and scout bee search mode, and a Multi-objective Artificial Bee Colony algorithm is proposed by using the strategy of first classification and then sorting and final iteration. The proposed algorithm is compared with other algorithms by using the standard test set in Solomon database. The results show that the Multi-objective Discrete Artificial Bee Colony algorithm has great advantages in solving the routing problem of grain transportation vehicles with time windows.

Artificial Bee Colony algorithm is a very powerful Swarm Intelligence Algorithm that has been applied in a number of different kind of optimization problems since the time that it was published. In recent years there is a growing number of optimization models that trying to reduce the energy consumption in routing problems. In this paper, a new variant of Artificial Bee Colony algorithm, the Parallel Multi-Start Multiobjective Artificial Bee Colony algorithm (PMS-ABC) is proposed for the solution of a Vehicle Routing Problem variant, the Multiobjective Energy Reduction Multi-Depot Vehicle Routing Problem (MERMDVRP). In the formulation four different scenarios are proposed where the distances between the customers and the depots are either symmetric or asymmetric and the customers have either demand or pickup. The algorithm is compared with three other multiobjective algorithms, the Parallel Multi-Start Non-dominated Sorting Differential Evolution (PMS-NSDE), the Parallel Multi-Start Non-dominated Sorting Particle Swarm Optimization (PMS-NSPSO) and the Parallel Multi-Start Non-dominated Sorting Genetic Algorithm II (PMS-NSGA II) in a number of benchmark instances.

In the model of hybrid flow shop scheduling problem with unrelated parallel machines, the makespan, total weighted earliness/tardiness and total waiting time are established as evaluation index. An algorithm of artificial bee colony based on the method of adaptive neighborhood search is designed. According to the characteristics of the model, initial processing sequence is used as solution vector in order to narrow down feasible solutions. Fitness of populations is distinguished by non-dominated sorting. In the process of iteration, excellent individuals are retained so that the diversity of population distribution is increased. Finally, the method is applied to a simulation example, compared with the traditional multi-objective algorithm. The results obtained demonstrate that the improved ABC algorithm for hybrid flow shop scheduling problem is good effective and diversified.

The various sensor nodes in a wireless sensor network (WSN) have restricted energy resources which severely affect the long time performance of the network. So, the current research focus is to design energy efficient algorithms for WSNs for improving network lifetime. This paper proposes artificial bee colony (ABC) algorithm with a clustering model to improve the energy capability of the network. The ABC algorithm can improve the internal dynamics of the cluster head nodes and sensor nodes in the WSN. The proposed algorithm can reduce the energy dissipation of nodes, balance the energy consumption across nodes and maximize the lifetime of the network. The ABC algorithm has less number of control parameters in the objective function compared to other algorithms, so it is simple to implement in clustered sensor network. The simulation results prove the superiority of the ABC algorithm compared to other algorithms in maximizing the energy efficiency and longevity of the network.

This study addresses the route scheduling problem for the heterogeneous robotic delivery system (HRDS) that perform delivery tasks in an urban environment. The HRDS comprises two distinct types of vehicles: an unmanned ground vehicle (UGV), which is constrained by road networks, and an unmanned aerial vehicle (UAV), which is capable of traversing terrain but has limitations in terms of energy and payload. The problem is formulated as an optimal route scheduling problem in a road network, where the goal is to find the route with minimum delivery cost and maximum customer satisfaction (CS) enabling the UAV to deliver packages to customers. We propose a new method of route scheduling based on an improved artificial bee colony algorithm (ABC) and the non-dominated sorting genetic algorithm II (NSGA-II) that provides the optimal delivery route. The effectiveness and superiority of the method we proposed are demonstrated by comparison in simulations. Moreover, the physical experiments further validate the practicality of the model and method.

Energy costs have dramatically increased in data center networks as an increasing number of large-scale Internet applications are used. In software-defined vehicular networks (SDVN), the communication delay between two vehicles and between vehicles and the controller will dramatically climb up as the number of vehicles increases. This requires more controllers to provide communication service to minimize the latency. More controllers lead to high energy costs. Therefore, the number of controllers and their placement, the so-called controller placement problem (CPP), should be addressed. The appropriate placement of controllers can decrease the energy cost, enabling green communication in SDVN. Although CPP has been studied for static networks, it has not been effectively solved in highly dynamic and complex networks. In this article, a novel cost-effective CPP scheme for SDVN is proposed. First, our proposed minimum controller selection mechanism (MOSA) can reduce the number of controllers and guarantee the coverage of the area. Besides, an improved multiobjective artificial bee colony algorithm (IMABC) is proposed based on the original artificial bee colony algorithm. The IMABC can judge which controller should be switched on for data transmission based on real-time traffic flow. A route computation mechanism is proposed to evaluate the performance of our CPP scheme. The experimental results confirm that compared to other existing CPP schemes, our scheme can achieve a higher packet delivery ratio while greatly reducing energy consumption and latency.

© 2017 Elsevier Inc. Feature selection has two major conflicting aims, i.e., to maximize the classification performance and to minimize the number of selected features to overcome the curse of dimensionality. To balance their trade-off, feature selection can be handled as a multi-objective problem. In this paper, a feature selection approach is proposed based on a new multi-objective artificial bee colony algorithm integrated with non-dominated sorting procedure and genetic operators. Two different implementations of the proposed approach are developed: ABC with binary representation and ABC with continuous representation. Their performance are examined on 12 benchmark datasets and the results are compared with those of linear forward selection, greedy stepwise backward selection, two single objective ABC algorithms and three well-known multi-objective evolutionary computation algorithms. The results show that the proposed approach with the binary representation outperformed the other methods in terms of both the dimensionality reduction and the classification accuracy.

The FIR filter has been widely used in the digital signal processing and other engineering calculations for its strictly linear phase and stability performance. The artificial bee colony (ABC) algorithm is a new kind of swarm intelligence optimization algorithm which has a strong search mechanism. This paper applies ABC into the linear-phase FIR filter design based on frequency sampling method which can search the optimal frequency sampling points in order to obtain the top minimum stop-band attenuation. By comparing the maximum stop-band attenuation of the traditional frequency sampling method, common genetic algorithm (GA) and ABC algorithm, the experiment shows that the application of ABC algorithm used in FIR filter design is effective.

An improved multi-objective artificial bee colony algorithm is designed in this paper reflecting the multi-objective characteristic of multi-robot path planning problems. Firstly, the foraging mechanism is optimized and a new method to calculate crowding distance is proposed. The restructuring and elimination mechanism of food sources are also presented. Secondly, an improved environment map representation method is presented in which the path information of robots is denoted using Cartesian coordinates directly. Thirdly, three objective functions for path planning are designed according to three key performance indicators which are length, safety and smoothness of the path. Finally, the simulation results show that the improved multi-objective artificial bee colony algorithm can be effectively applied to solve multi-robot path planning problems.

Complex network clustering has been extensively studied in recent years, mostly through optimization approaches. In such approaches, the multi-objective optimization methods have been shown to be capable of overcoming the limitations (e.g., instability) of the single-objective methods. Nevertheless, such methods suffer from the shortcoming of incapability of maintaining a good tradeoff between exploration and exploitation, that is, to find better solutions based on the good ones obtained so far. In this paper, we present a new nature-inspired heuristic optimization method, called multi-objective discrete moth-flame optimization (DMFO) method, which achieves such a tradeoff. We describe the detailed algorithm of DMFO that utilizes the Tchebycheff decomposition approach with an \(l_2\)-norm constraint on the direction vector (2-Tch). Furthermore, we show the experimental results on synthetic and several real-world networks that verify that the proposed DMFO and the algorithm are both effective and promising for tackling the task of complex network clustering.

Disassembly lines are widely utilized to disassemble end-of-life products. Most of the research focuses on the complete disassembly of obsolete products. However, there is a lack of studies on profit and on carbon emission saved. Hence, this study considers the multi-objective partial disassembly line balancing problem with AND/OR precedence relations to optimize profit, saved carbon emission and line balance simultaneously. Firstly, a multi-objective mixed-integer programming model is formulated, which could optimally solve the small number of instances with a single objective. Meanwhile, an improved multi-objective artificial bee colony algorithm is developed to generate a set of high-quality Pareto solutions. This algorithm utilizes two-layer encoding of the task permutation vector and the number of selected parts, and develops two-phase decoding to handle the precedence relation constraint and cycle time constraint. In addition, the modified employed bee phase utilizes the neighborhood operation, and the onlooker phase utilizes the crossover operator to achieve a diverse population. The modified scout phase selects a solution from the Pareto front to replace the abandoned individual to obtain a new high-quality solution. To test the performance of the proposed algorithm, the algorithm is compared with the multi-objective simulated annealing algorithm, the original multi-objective artificial bee colony algorithm and the well-known fast non-dominated genetic algorithm. The comparative study demonstrates that the proposed improvements enhance the performance of the method presented, and the proposed methodology outperforms all the compared algorithms.

In this study, we developed an efficient computer-aided design tool for scaling combustor designs. From a limited number of fluid simulations, an original design is scaled while preserving most of the flow properties, using a multi-objective optimization method and deep neural network or kriging surrogate models. The accuracy and robustness of the method were first tested with a simple geometry. Investigations have shown a strong sensitivity of the surrogate models to the sample distribution, which can be reduced using a strategic sampling method. Subsequently, the geometry was scaled down to a factor of two using both surrogate models while preserving most of the flow features.

For multi-objective optimization under condition of complicated objective function, the data processing in the evaluation is sometime tediously long, special algorithm is needed to be adopted. Since the remarkable features of uniform distribution of test points within the test domain and the small number of tests, fully representative of each point, and easy to perform regression analysis, the uniform test design method is hybrid with the “intersection” method for multi-objective optimization to simplify the complicated data process in evaluation first. Furthermore, the "intersection" multi-objective optimization methodology is combined with sequential uniform design so as to get a more precise approximation for solving multi-objective optimization problem, the procedure for searching optimum of the “intersection“ multi-objective optimization methodology with sequential uniform design algorithm is put forward. A multi-objective optimization of linear programming problem with three variables is taken as our example, which involves a maximum for one objective and a minimum for another objective. The result for applying the novel approach to the example indicates the effectiveness of current hybrids.