Multi-objective Artificial Bee Colony Algorithm Research Articles

IMOABC: An efficient multi-objective filter–wrapper hybrid approach for high-dimensional feature selection

With the development of data science, the challenge of high-dimensional data has become increasingly prevalent. High-dimensional data contains a significant amount of redundant information, which can adversely affect the performance and effectiveness of machine learning algorithms. Therefore, it is necessary to select the most relevant features from the raw data and perform feature selection on high-dimensional data. In this paper, a novel filter–wrapper feature selection method based on an improved multi-objective artificial bee colony algorithm (IMOABC) is proposed to address the feature selection problem in high-dimensional data. This method simultaneously considers three objectives: feature error rate, feature subset ratio, and distance, effectively improving the efficiency of obtaining the optimal feature subset on high-dimensional data. Additionally, a novel Fisher Score-based initialization strategy is introduced, significantly enhancing the quality of solutions. Furthermore, a new dynamic adaptive strategy is designed, effectively improving the algorithm’s convergence speed and enhancing its global search capability. Comparative experimental results on microarray cancer datasets demonstrate that the proposed method significantly improves classification accuracy and effectively reduces the size of the feature subset when compared to various traditional and state-of-the-art multi-objective feature selection algorithms. IMOABC improves the classification accuracy by 2.27% on average compared to various multi-objective feature selection methods, while reducing the number of selected features by 88.76% on average. Meanwhile, IMOABC shows an average improvement of 4.24% in classification accuracy across all datasets, with an average reduction of 76.73% in the number of selected features compared to various traditional methods.

Delivery Route Scheduling of Heterogeneous Robotic System with Customers Satisfaction by Using Multi-Objective Artificial Bee Colony Algorithm

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.

Multi-objective artificial bee colony algorithm for reducing carbon emission and maximizing profit in a circular supply chain network

Multi-objective artificial bee colony algorithm for reducing carbon emission and maximizing profit in a circular supply chain network

Matheuristic and learning-oriented multi-objective artificial bee colony algorithm for energy-aware flexible assembly job shop scheduling problem

With the increase of mass customization, flexible job shop scheduling problem considering assembly stage has widely existed in many manufacturing industries, such as die-casting mould factories. This problem is to find a reasonable machine assignment and operation sequence both in fabrication and assembly stages and simultaneously maximize production efficiency. In reality, energy shortages and environmental pollution have given an impetus to the development of energy-aware production scheduling problems. In this study, we address an energy-aware flexible assembly job shop scheduling problem (EFAJSP) with the objectives of minimizing flow time and energy consumption and first develop a mixed-integer linear programming (MILP) model to solve EFAJSP problem. Then, the model-specific characteristics are extracted and applied to a matheuristic decoding method for exploring the Pareto optimal solution. Due to the complexity of EFAJSP problem, a matheuristic and learning-oriented multi-objective artificial bee colony algorithm (MLABC), which combines the advantages of mathematical programming, reinforcement learning and meta-heuristic algorithm, is proposed. In addition, an initialization, destruction/construction operator and population update operator are proposed and work together to improve the exploration and exploitation performance of the proposed MLABC. Finally, numerical experimental results demonstrate the effectiveness of the proposed MILP model and the superiority of the MLABC over other algorithms in the literature.

An enhanced multi-objective artificial bee colony algorithm with non-dominated sorting strategy

<p>This paper presents an improved metaheuristic technique inspired by the foundational concepts of the artificial bee colony (ABC) algorithm adapted to deal with multi-objective optimization challenges. Our approach combines the main ideas of ABC with a non-dominated sorting strategy including aspects of Pareto dominance, crowding distance, and greedy selection method. Furthermore, the chosen non-dominated solutions are archived in a repository with a static size. The presented approach, multi-objective artificial bee colony (MOABC), is compared to other state-of-the-art algorithms including the non-dominated sorting genetic algorithm II (NSGA II) and the multi-objective particle swarm optimization (MOPSO). MOABC and selected algorithms from the literature are applied to five zitzler-deb-thiele (ZDT) Multi-objective benchmark functions. Then three key metrics are employed for performance evaluations: generational distance (GD), spread (SP), and hypervolume (HV). The simulation results suggest that the proposed method is competitive and presents an effective choice for tackling multi-objective optimization problems.</p>

Using common redundancy components for suppliers in a supply chain network design problem considering energy costs and environmental effects

Improving the reliability of factories and suppliers through appropriate allocation of redundancy components is crucial in responding to customer demand. However, if individual factories independently buy and allocate redundancy components, huge investments will be required. To optimize the reliability level and costs of the supply chain network, the present study allocates these components to suppliers based on customer demand. While allocating redundancy components to factories improves the chain's reliability, it increases energy consumption and greenhouse gas emissions. Therefore, a balance between cost, reliability, and pollution needs to be established. The study considers a three-level supply chain, including the supplier (factories), distributor, and retailer, with stochastic and normally distributed demand assumed for each retailer. To address demand fluctuations, the risk pooling effect is implemented. As the problem belongs to the class of NP-hard problems, the study develops three multi-objective meta-heuristic algorithms, namely Non-dominated Sorting Genetic Algorithm II (NSGAII), Archived Multi-Objective Simulated Annealing (AMOSA), and Multi-Objective Artificial Bee Colony (MOABC) to solve it. The performance of these algorithms is evaluated using the results of the complete enumeration method. The comparison results based on six multi-objective performance metrics show that the MOABC algorithm has better performance in finding high-quality solutions in less time, while the NSGAII algorithm provides more diverse Pareto optimal solutions.

Optimal Location and Sizing of Multi-Resource Distributed Generator Based on Multi-Objective Artificial Bee Colony Algorithm

Optimal Location and Sizing of Multi-Resource Distributed Generator Based on Multi-Objective Artificial Bee Colony Algorithm

A Novel Model for Dynamic Manufacturing Service Collaboration on Industrial Internet

Industrial Internet enables distributed manufacturing enterprises to efficiently and promptly respond to the requirements of stakeholders using a manufacturing service collaboration chain (MSCC) composed of networked enterprises. However, various dynamic uncertainties may interrupt the MSCC, such as device malfunctions, urgent order insertions, and dynamic logistics, resulting in inexactitude practical applications. This paper proposes a novel reliability-based dynamic manufacturing service collaboration optimization (R-DMSCO) model for uncertain manufacturing collaboration procedures on Industrial Internet. The RDMSCO model reformulates the MSCC reliability in the form of an expectation-standard deviation of uncertain job completion time described by discrete scenarios pertaining to the uncertain perturbation of processing time and logistics time. Subsequently, an enhanced multi-objective artificial bee colony (EMOABC) algorithm that embeds four improvements is intended to address the manufacturing service collaboration optimization (MSCO) problem. The experimental results demonstrate that EMOABC outperforms other typical multi-objective algorithms for MSCO problems. Additionally, the R-DMSCO model can cope with dynamic uncertainties with better robustness and stability than two other effective strategies for dynamic manufacturing service collaboration.

Environmental economic dispatch method of power system based on multiobjective artificial bee colony algorithm

Environmental economic dispatch method of power system based on multiobjective artificial bee colony algorithm

Energy consumption calculation and energy-saving measures of substation based on Multi-objective artificial bee colony algorithm

Abstract Electric energy is the most commonly used energy in people’s daily life. In the process of use, how to improve the utilization rate of resources, so as to achieve the purpose of energy saving and environmental protection of power resources is a very significant work. The power grid is crucial in the transmission of electricity, and the energy consumption of substations is a major factor affecting the operation cost. Therefore, it is a key condition to ensure the stable operation of the power grid to scientifically calculate its energy consumption and formulate appropriate energy-saving measures. After consulting a large number of relevant documents and data, it has been found that many researchers have provided new ideas for the calculation of energy consumption and the study of energy-saving measures in substations. This article was adding its own understanding and taking it as the direction and basis. In the introduction, the research significance of substation energy consumption calculation was introduced, and then the academic research and analysis were carried out on the two key sentences of substation energy consumption calculation and analysis and the research of multi-objective artificial bee colony (ABC) algorithm in substation. In the method part, a constructive algorithm theory was proposed, and the application of the algorithm in substation energy consumption was proposed to provide a theoretical basis for the energy consumption calculation and energy conservation measures research of substations based on multi-objective ABC algorithm. At the end of the article, a simulation comparison experiment was carried out and the experiment was summarized and discussed. Firstly, the performance of the two algorithms was analyzed. Then, through the first selection of power plant T and Y, it was concluded that the resistivity of the cable in the distribution room in power plant Y was much higher than the average value based on the experimental results. Therefore, it was taken as the sample subject of the following experiments and analyzed again. For the second time, the analysis of district power plant Y showed that through simple calculation, the average energy efficiency difference of the distribution room before and after use was 3.1. Finally, it was analyzed that the ABC algorithm could not only improve the energy efficiency of the distribution room in the power plant, but also improve the effective efficiency of its power station. It shows that this kind of algorithm is effective and worthy of further study.

Improved multi-objective artificial bee colony algorithm for parallel machine lot-streaming scheduling problem with limited and unequal sub-lots

Job splitting is a full-time effective measure used to improve corporate competitiveness, especially when the lot size of jobs is considerably large. This work investigates a parallel machine lot-streaming scheduling problem, where unequal sub-lot is considered and the number of sub-lots is strictly limited by that of cutters. Focus on this problem, a mixed-integer linear programming model is formulated to minimize makespan and due time deviation simultaneously, to scrutinize the coupling relationship among decision variables, i.e., the number and size of sub-lots, the machine allocation, and the processing order of all sub-lots. Then, an improved multi-objective artificial bee colony algorithm (IMOABC) with two categories of improvements is developed to obtain high-quality Pareto front solutions. Specifically, a semi-random initialization is proposed to balance the workload as evenly as possible, which includes a half-normal distribution strategy for determining the number of utilized sub-lots, an equal-probability lot-splitting strategy for determining the size of each sub-lots, and a machine allocation strategy to synchronize the completion time of all machines. Besides, a multipoint preservative crossover is designed to enhance diversity in the employed bee phase, a sub-lot adjustment operator is proposed to implement objective-oriented local search in the onlooker bee phase, and an individual restart mechanism is adopted to avoid being trapped in local optimum in the scout bee phase. Extensive experiment results demonstrate that IMOABC significantly outperforms the other six state-of-the-art algorithms in terms of diversity and convergence.

Improved multi-objective artificial bee colony algorithm-based path planning for mobile robots.

Mobile robots are widely used in various fields, including cosmic exploration, logistics delivery, and emergency rescue and so on. Path planning of mobile robots is essential for completing their tasks. Therefore, Path planning algorithms capable of finding their best path are needed. To address this challenge, we thus develop improved multi-objective artificial bee colony algorithm (IMOABC), a Bio-inspired algorithm-based approach for path planning. The IMOABC algorithm is based on multi-objective artificial bee colony algorithm (MOABC) with four strategies, including external archive pruning strategy, non-dominated ranking strategy, crowding distance strategy, and search strategy. IMOABC is tested on six standard test functions. Results show that IMOABC algorithm outperforms the other algorithms in solving complex multi-objective optimization problems. We then apply the IMOABC algorithm to path planning in the simulation experiment of mobile robots. IMOABC algorithm consistently outperforms existing algorithms (the MOABC algorithm and the ABC algorithm). IMOABC algorithm should be broadly useful for path planning of mobile robots.

Multiobjective Optimization of Networked Switched Systems Subject to DoS Attack Using Artificial Bee Colony Algorithm

In this article, the multiobjective optimization problem of networked switched systems under denial-of-service (DoS) attack is studied. DoS attacks launched by network layer attackers will affect the performance of switched systems in the physical layer, so it is necessary to deploy a defender to deal with it. Taking account of the properties of each switched subsystem and the characteristics of the attacker group composed of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$m$</tex-math></inline-formula> DoS attackers, cost functions of the defender and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$m$</tex-math></inline-formula> attackers are first constructed. Next, the Stackelberg game is used to analyze the game between the defender and attacker group, and the strategy sets of both sides are given by Stackelberg Equilibrium. In addition, for switched systems of the physical layer, the switching times and performance index are modeled as two objectives to be optimized. Based on the equilibrium condition of the network layer, the control input of switched systems is designed. Then, an encoding and decoding strategy of the switching signal is proposed to ensure that the multiobjective artificial bee colony (MOABC) algorithm can be applied to the multiobjective optimization problem of switched systems. Furthermore, the Pareto optimal solution set of switching signals is obtained by using the MOABC algorithm. Finally, the effectiveness of the strategy proposed in this article is verified through the networked continuous stirred tank reactor and a numerical simulation.

PCNN Model Guided by Saliency Mechanism for Image Fusion in Transform Domain.

In heterogeneous image fusion problems, different imaging mechanisms have always existed between time-of-flight and visible light heterogeneous images which are collected by binocular acquisition systems in orchard environments. Determining how to enhance the fusion quality is key to the solution. A shortcoming of the pulse coupled neural network model is that parameters are limited by manual experience settings and cannot be terminated adaptively. The limitations are obvious during the ignition process, and include ignoring the impact of image changes and fluctuations on the results, pixel artifacts, area blurring, and the occurrence of unclear edges. Aiming at these problems, an image fusion method in a pulse coupled neural network transform domain guided by a saliency mechanism is proposed. A non-subsampled shearlet transform is used to decompose the accurately registered image; the time-of-flight low-frequency component, after multiple lighting segmentation using a pulse coupled neural network, is simplified to a first-order Markov situation. The significance function is defined as first-order Markov mutual information to measure the termination condition. A new momentum-driven multi-objective artificial bee colony algorithm is used to optimize the parameters of the link channel feedback term, link strength, and dynamic threshold attenuation factor. The low-frequency components of time-of-flight and color images, after multiple lighting segmentation using a pulse coupled neural network, are fused using the weighted average rule. The high-frequency components are fused using improved bilateral filters. The results show that the proposed algorithm has the best fusion effect on the time-of-flight confidence image and the corresponding visible light image collected in the natural scene, according to nine objective image evaluation indicators. It is suitable for the heterogeneous image fusion of complex orchard environments in natural landscapes.

Area and power optimization for Fixed Polarity Reed–Muller logic circuits based on Multi-strategy Multi-objective Artificial Bee Colony algorithm

Area and power optimization of Fixed Polarity Reed–Muller (FPRM) circuits has received a lot of attention. Polarity optimization for FPRM circuits is essentially a binary multi-objective optimization problem. However, the existing area and power optimization approaches for FPRM logic circuits rarely produce a frontier and a greater number of Pareto optimal solutions. In this paper, a Multi-strategy Multi-objective Artificial Bee Colony (MMABC) algorithm is proposed to solve the binary multi-objective optimization problem. The main innovation of MMABC can be summarized as follows: a flexible foraging behavior strategy for employed bees is proposed to improve the searching ability of the algorithm; a genetic retention evolution for onlooker bees is proposed to improve the quality of the population; an efficient transform strategy is proposed to help the algorithm to jump out the local optimal and increase convergence speed. Moreover, we propose an area and power optimization approach for FPRM logic circuits, which uses the MMABC to search for the polarities (i.e., Pareto optimal solutions) with smaller area and lower power. Experimental results demonstrated the effectiveness and superiority of our approach in optimizing area and power of FPRM logic circuits.

Discrete multi-objective artificial bee colony algorithm for green co-scheduling problem of ship lift and ship lock

This paper investigates a multi-objective green co-scheduling problem of ship lift and ship lock (GCP-SL&SL) at the Three Gorges Cascade Hub (TGCH). A mathematical model of GCP-SL&SL with objectives of the average utilizations rate of the lock chamber, average waiting time and total energy consumption of vessels, is proposed by separating it into three sub-problems: the facility assignment, lockage assignment and lockage operation scheduling. To solve this problem, a discrete multi-objective artificial bee colony (DMOABC) algorithm is developed. Within the DMOABC, a two-dimensional matrix encoding scheme is designed to encode and a group right-shift decoding scheme is specifically proposed to decode each food source. Then, a novel fitness evaluation mechanism based on fuzzy relative entropy is introduced to hand this multi-objective problem. Next, the food sources are improved from three aspects: (1) the employed bee phase uses new evolutionary operators for fast local search; (2) the onlooker bee phase adopts a modified tabu search for strong global search; (3) the scout bee phase embeds chemical reaction optimization for disturbing population. Finally, extensive experiments are conducted with the real data from historical traffic at TGCH. The results demonstrate our proposed algorithm is significantly better at solving the GCP-SL&SL than other five well-known multi-objective algorithms. The effect analysis under different scenarios indicates that the average waiting time of vessels at the dam is greatly reduced because of considering the synchronous moving process.

Parallel machine scheduling optimisation based on an improved multi-objective artificial bee colony algorithm

Parallel machine scheduling optimisation based on an improved multi-objective artificial bee colony algorithm

Multi-objective artificial bee colony algorithm in redundancy allocation problem

Multi-objective artificial bee colony algorithm in redundancy allocation problem

An Air Defense Weapon Target Assignment Method Based on Multi-Objective Artificial Bee Colony Algorithm

An Air Defense Weapon Target Assignment Method Based on Multi-Objective Artificial Bee Colony Algorithm

Parallel machine scheduling optimisation based on an improved multi-objective artificial bee colony algorithm

Parallel machine scheduling optimisation based on an improved multi-objective artificial bee colony algorithm