Weapon Selection and Planning Problems Using MOEA/D with Distance‐Based Divided Neighborhoods

Abstract

Real-world multiobjective optimization problems are characterized by multiple types of decision variables. In this paper, we address weapon selection and planning problems (WSPPs), which include decision variables of weapon-type selection and weapon amount determination. Large solution space and discontinuous, nonconvex Pareto front increase the difficulty of problem solving. This paper solves the addressed problem by means of a multiobjective evolutionary algorithm based on decomposition (MOEA/D). Two mechanisms are designed for the complex combinatorial characteristic of WSPPs. The first is that the neighborhood of each individual is divided as selection and replacement neighborhoods. The second is that the neighborhood size is changing during the evolution by introducing a distance parameter to constrain the search scope of each subproblem. The proposed algorithm is termed as MOEA/D with distance-based divided neighborhoods (MOEA/D-DDNs) which can overcome possible drawbacks of original MOEA/D with weighted sum approach for complex combinatorial problems. Benchmark instances are generated to verify the proposed approach. Experimental results suggest the effectiveness of the proposed algorithm.

Optimizing Long-Term Bank Financial Products Portfolio Problems with a Multiobjective Evolutionary Approach

“…e addressed problem is combinatorial and the trade-off surface in the objective space might be nonconvex and disconnected. For such a type of problem, multiobjective evolutionary algorithms are preferable as solution techniques [34][35][36][37]. In this paper, we develop a solution technique based on a classic multiobjective genetic algorithm named NSGA-II [38], which is widely used to solve other financial problems such as feature selection in credit scoring [39].…”

The Influence of NMI against Modularity in Community Detection Problem: A Case Study for Unsigned and Signed Networks

“…Evolutionary algorithms (EAs) are a group of stochastic optimisation techniques that mimic the natural evolution process. The use of EAs, especially evolutionary multi-objective optimisation (EMO) algorithms or MOEAs, in solving MOPs has attracted much interest over the last decade; these algorithms have recorded success in various fields, such as engineering, chemistry, biology, physics, operations research, economics, marketing, and social sciences [58][59][60][61][62]. This success of EAs in different fields is attributed to their two major advantages; (i) they do not need much problem features and can handle large and highly complex solution spaces; (ii) they can approximate the Pareto Front problem as their search is population-based and each solution represents a specific balance between the objectives.…”

Fine-Grained Ensemble of Evolutionary Operators for Objective Space Partition Based Multi-Objective Optimization

“…The MOPs coming from various real-world applications [5], [37], [38] have complex relationships among decision variables, e.g., linear linkage, non-linear linkage, rotation, epistasis, and alike. Then, different sub-problems or subspaces of an MOP have distinct properties [31], and the requirements of evolutionary operators should vary from one sub-space to another.…”