The dynamic weapon target assignment (DWTA) problem is of great significance in modern air combat. However, DWTA a highly complex constrained multi-objective combinatorial optimization problem. An improved elitist non-dominated sorting genetic algorithm-II (NSGA-II) called the shuffled frog leaping algorithm (NSFLA) proposed to maximize damage enemy targets and minimize self-threat combat const...

Abstract This paper proposes a method for improving the diversity of Pareto front and uniformity non-dominated solution distributions in fast elitist sorting genetic algorithm (NSGA-II), which is an evolutionary multi-objective optimization algorithm. Conventional NSGA-II has excellent convergence to front, but it been reported that some test cases, does not produce more diverse distribution th...

We present a new multiobjective evolutionary algorithm (MOEA), called fast Pareto genetic algorithm (FPGA). FPGA uses a new ranking strategy for the simultaneous optimization of multiple objectives where each solution evaluation is computationally expensive. New genetic operators are employed to enhance the algorithm’s performance in terms of convergence behavior and computational effort. Compu...

A multi-objective genetic algorithm is introduced to predict the assignment of protein solid-state NMR (SSNMR) spectra with partial resonance overlap and missing peaks due to broad linewidths, molecular motion, and low sensitivity. This non-dominated sorting genetic algorithm II (NSGA-II) aims to identify all possible assignments that are consistent with the spectra and to compare the relative ...

Multiobjective evolutionary algorithm based on decomposition (MOEA/D) and an improved non-dominating sorting multiobjective genetic algorithm (NSGA-II) are two well known multiobjective evolutionary algorithms (MOEAs) in the field of evolutionary computation. This paper mainly reviews their hybrid versions and some other algorithms which are developed for solving multiobjective optimization pro...

We consider an open shop scheduling problem with setup and processing times separately such that not only the setup times are dependent on the machines, but also they are dependent on the sequence of jobs that should be processed on a machine. A novel bi-objective mathematical programming is designed in order to minimize the total tardiness and the makespan. Among several mult...

This paper proposes a modified non-dominated sorting genetic algorithm (NSGA-II) for a bi-objective location-allocation model. The purpose is to define the best places and capacity of the distribution centers as well as to allocate consumers, in such a way that uncertain consumers demands are satisfied. The objectives of the mixed-integer non-linear programming (MINLP) model are to (1) minimize...

A novel multiobjective optimisation accelerator is introduced that uses direct manipulation in objective space together with neural network mappings from objective space to decision space. This operator is a portable component that can be hybridized with any multiobjective optimisation algorithm. The purpose of this Convergence Acceleration Operator (CAO) is to enhance the search capability and...

Network reconfiguration is an alternative to reduce power losses and optimize the operation of power distribution systems. In this paper, an encoding scheme for evolutionary algorithms is proposed in order to search efficiently for the Pareto-optimal solutions during the reconfiguration of power distribution systems considering multiobjective optimization. The encoding scheme is based on the ed...

this paper considers the job scheduling problem in virtual manufacturing cells (vmcs) with the goal of minimizing two objectives namely, makespan and total travelling distance. to solve this problem two algorithms are proposed: traditional non-dominated sorting genetic algorithm (nsga-ii) and knowledge-based non-dominated sorting genetic algorithm (kbnsga-ii). the difference between these algor...