Search

With the advancement of combat equipment technology and combat concepts, new requirements have been put forward for air defense operations during a group target attack. To achieve high-efficiency and lowloss defensive operations, a reasonable air defense weapon assignment strategy is a key step. In this paper, a multi-objective and multi-constraints weapon target assignment (WTA) model is established that aims to minimize the defensive resource loss, minimize total weapon consumption, and minimize the target residual effectiveness. An optimization framework of air defense weapon mission scheduling based on the multiobjective artificial bee colony (MOABC) algorithm is proposed. The solution for point-to-point saturated attack targets at different operational scales is achieved by encoding the nectar with real numbers. Simulations are performed for an imagined air defense scenario, where air defense weapons are saturated. The non-dominated solution sets are obtained by the MOABC algorithm to meet the operational demand. In the case where there are more weapons than targets, more diverse assignment schemes can be selected. According to the inverse generation distance (IGD) index, the convergence and diversity for the solutions of the non-dominated sorting genetic algorithm III (NSGA-III) algorithm and the MOABC algorithm are compared and analyzed. The results prove that the MOABC algorithm has better convergence and the solutions are more evenly distributed among the solution space. [ABSTRACT FROM AUTHOR]

Robots are now widely used in product disassembly lines, which significantly improves end-of-life (EOL) product disassembly efficiency. Most of the current research on disassembly line balancing problems focuses on decomposing one product. More than one product can be disassembled concurrently, which can further improve the efficiency. Moreover, uncertainty such as the depreciation of EOL products, may result in disassembly failure. In this research, a stochastic multi-product robotic disassembly line balancing model is established using an AND/OR graph. It takes the precedence relationship, cycle constraint, and disassembly failure into consideration to maximize the profit and minimize the energy consumption for disassembling multiple products. A Pareto-improved multi-objective brainstorming optimization algorithm combined with stochastic simulation is proposed to solve the problem. Furthermore, by conducting experiments on some real cases and comparing with four state-of-the-art multi-objective optimization algorithms, i.e., the multi-objective discrete gray wolf optimizer, artificial bee colony algorithm, nondominated sorting genetic algorithm II, and multi-objective evolutionary algorithm based on decomposition, this paper validates its excellent performance in solving the concerned problem. [ABSTRACT FROM AUTHOR]

Feature selection typically aims to select a feature subset that maximally contributes to the performance of a further process (such as clustering, classification and regression). Most of the current feature selection methods handle all features in the dataset with the same importance while evaluating the possible feature subsets in a solution space. However, this case may not be appropriate since each feature in a dataset comes with its own impact and importance. In particular, each feature may provide a different cost to achieve some specific purposes. To address this issue, we introduce an improved multi-objective artificial bee colony-based cost-sensitive subset selection method which simultaneously tries to minimize two main conflicting objectives: the classification error rate and the feature cost. According to the results on well-known benchmarks, the proposed cost-sensitive subset selection approach outperforms the recently introduced multi-objective variants of the artificial bee colony, particle swarm optimization and genetic algorithms. To the best of our knowledge, this work is one of the earliest studies on multi-objective cost-sensitive subset selection in the literature. [ABSTRACT FROM AUTHOR]

Online users buy a product with more features from e-commerce website. They might be unsatisfied with the some usability issues called feature fatigue. Therefore, it is essential to analyze the product usability. A new method is developed in this work to assist the manufacturers to identify feature that provides the manufacturers for decision-making that to improve the usability of the product to the users. Customer reviews about product usability are gathered from web which is processed by Latent Dirichlet allocation for mining the product feature. The pareto-based genetic algorithm with association rule is used to get an optimal customer's opinions and product usability. A Hybrid optimization algorithm is proposed for analyzing the feature fatigue on the product usability. The experimental result of the proposed work provides 99% accuracy than existing algorithm. [ABSTRACT FROM AUTHOR]

Vehicle Routing Problem is one of the classic problems in GIS (Geospatial Information System) which had been studied for long times. An answer can be accepted as a good solution if it would be able to optimize the total length of the route or decrease the number of vehicles. A VRP defines finding the optimum route for some vehicles that serve to some customers and return to the service center. This problem is economically important because the cost and the time of serving to costumers are related to optimization of the problem's answer. Furthermore, there are many problems like BUS management, Post pickup and delivery system and other servicing systems, which are technically similar to VRP. The aim of these problems is finding a composition of optimum routes between server and costumers. In addition, as the cost is related to time, finding shortest path means decreasing cost serving and decreasing time. In this article, a hybrid model using Artificial Bee Colony and Genetic Algorithm is proposed to solve VRP. In the first step, Artificial Bee Colony has been used to find a solution for five vehicles. The scout and the onlooker bees produced in 8 modes by two methods including the nearest neighborhood and the wide neighborhood. In the second step, the Genetic Algorithm helps to optimize the solutions. The results show that the production of the scout bees is the most effective factor in the answers to the problem and helps greatly converging the answers as soon as possible. [ABSTRACT FROM AUTHOR]

Although the introduction of fuzzy theory into a portfolio selection model can help improve the model's practicality, it would increase the difficulty of solving the model. To tackle the issue, this paper proposes a novel mechanism based artificial bee colony algorithm (ABC) consisting of two new proposed learning strategies—direction learning and elite learning. The direction learning strategy has a great potential to guide the search toward the promising areas. The elite learning strategy can gradually pick up the convergence rate without loss of the population diversity. The cooperation of the two approaches forms a mechanism, complementing each other to improve the performance of the algorithms. The proposed mechanism, named LL-mechanism, is introduced into three ABC variants-ABC, gbest-guided ABC (GABC), and CABC, generating LL-ABC, LL-GABC, and LL-CABC, respectively. The experimental results demonstrate the superior performance of the LL-mechanism and LL-CABC outperforms other methods in terms of solution quality, convergence rate, robustness, and numerical stability. Finally, the proposed LL-CABC approach is employed to solve the portfolio selection with fuzzy security return. The experiments on two portfolio selection models illustrate that LL-CABC is effective and promising for a fuzzy portfolio selection. [ABSTRACT FROM AUTHOR]

The dispatching of hydro-thermal system is a nonlinear programming problem with multiple constraints and high dimensions and the solution techniques of the model have been a hotspot in research. Based on the advantage of that the artificial bee colony algorithm (ABC) can efficiently solve the high-dimensional problem, an improved artificial bee colony algorithm has been proposed to solve DHTS problem in this paper. The improvements of the proposed algorithm include two aspects. On one hand, local search can be guided in efficiency by the information of the global optimal solution and its gradient in each generation. The global optimal solution improves the search efficiency of the algorithm but loses diversity, while the gradient can weaken the loss of diversity caused by the global optimal solution. On the other hand, inspired by genetic algorithm, the nectar resource which has not been updated in limit generation is transformed to a new one by using selection, crossover and mutation, which can ensure individual diversity and make full use of prior information for improving the global search ability of the algorithm. The two improvements of ABC algorithm are proved to be effective via a classical numeral example at last. Among which the genetic operator for the promotion of the ABC algorithm’s performance is significant. The results are also compared with those of other state-of-the-art algorithms, the enhanced ABC algorithm has general advantages in minimum cost, average cost and maximum cost which shows its usability and effectiveness. The achievements in this paper provide a new method for solving the DHTS problems, and also offer a novel reference for the improvement of mechanism and the application of algorithms. [ABSTRACT FROM AUTHOR]

This paper investigates a well-known complex combinatorial problem known as the vehicle routing problem with time windows (VRPTW). Unlike the standard vehicle routing problem, each customer in the VRPTW is served within a given time constraint. This paper solves the VRPTW using an improved artificial bee colony (IABC) algorithm. The performance of this algorithm is improved by a local optimization based on a crossover operation and a scanning strategy. Finally, the effectiveness of the IABC is evaluated on some well-known benchmarks. The results demonstrate the power of IABC algorithm in solving the VRPTW. [ABSTRACT FROM AUTHOR]

Honey Bee Mating Optimization (HBMO) is a recent swarm-based optimization algorithm to solve highly nonlinear problems, whose based approach combines the powers of simulated annealing, genetic algorithms, and an effective local search heuristic to search for the best possible solution to the problem under investigation within a reasonable computing time. In this work, the HBMO-based design is carried out for a front-end amplifier subject to be a subunit of a radar system in conjunction with a cost effective 3-D SONNET-based Support Vector Regression Machine (SVRM) microstrip model. All the matching microstrip widths, lengths are obtained on a chosen substrate to satisfy the maximum power delivery and the required noise over the required bandwidth of a selected transistor. The proposed HBMO-based design is applied to the design of a typical ultra-wide-band low noise amplifier with NE3512S02 on a substrate of Rogers 4350 for the maximum output power and the noise figure F(f)=1dB within the 5-12 GHz using the T- type of microstrip matching circuits. Furthermore, the effectiveness and efficiency of the proposed HBMO based design are manifested by comparing it with the Genetic Algorithm (GA), Particle Swarm Optimization (PSO) and the simple HBMO based designs. [ABSTRACT FROM AUTHOR]

Abstract: A Classifier Ensemble combines a finite number of classifiers of same kind or different, trained simultaneously for a common classification task. The Ensemble efficiently improves the generalization ability of the classifier compared to a single classifier. Stacking is one of the most influential ensemble techniques that applies a two level structure of classification namely the base classifiers level and the meta-classifier level. Finding suitable configuration of base level classifiers and the meta-level classifier is always a tedious task and it is domain specific. The Artificial Bee Colony (ABC) Algorithm is a relatively new and popular meta-heuristic search algorithm proved to be successful in solving optimization problems. In this work, we propose the construction of two types of stacking using ABC algorithm: ABC-Stacking1 and ABC-Stacking2. The proposed ABC based stacking is tested using 10 benchmark datasets. The results show that the ABC-Stacking yields promising results and is most useful in selecting the optimal base classifiers configuration and the meta-classifier. [Copyright &y& Elsevier]

This paper proposes a global multi-level thresholding method for image segmentation. As a criterion for this, the traditional method uses the Shannon entropy, originated from information theory, considering the gray level image histogram as a probability distribution, while we applied the Tsallis entropy as a general information theory entropy formalism. For the algorithm, we used the artificial bee colony approach since execution of an exhaustive algorithm would be too time-consuming. The experiments demonstrate that: 1) the Tsallis entropy is superior to traditional maximum entropy thresholding, maximum between class variance thresholding, and minimum cross entropy thresholding; 2) the artificial bee colony is more rapid than either genetic algorithm or particle swarm optimization. Therefore, our approach is effective and rapid. [ABSTRACT FROM AUTHOR]

This paper investigates and compares genetic algorithms (GA) and bees algorithms (BA) applied to the finite element (FE) model update. The bees algorithm is a new population based optimisation algorithm that mimics the natural foraging of a swarm of bees. The investigation was carried out experimentally on a free-free beam. Five material and geometrical beam parameters were used in this FE model updating procedure. Two objective functions were used: the first one is the residual force vector, while the second consists of experimental and numerical modal parameters only. In order to implement the residual force vector it is necessary to apply model reduction. The effect of model reduction on the process of model updating is investigated. At the end, the values of modal parameters obtained by experimental modal testing were compared with numerical ones obtained by using these two objective functions with GA and BA. [ABSTRACT FROM AUTHOR]

Selecting a set of reasonable milling parameters of computerized numerical control (CNC) machines is of great importance in decreasing energy consumption and enhancing processing productivity. However, existing works pay little attention to the optimization of energy-conscious milling parameters. This work establishes a dual-objective optimization model for the selection of milling parameters such that power consumption and process time are minimized. With multiple constraints of milling processing conditions, an improved artificial bee colony (ABC) intelligent algorithm is used to handle the proposed dual-objective optimization model. Compared with the non-dominated sorting genetic algorithm (NSGA-II), our improved algorithm has good performance. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]