We present a new non-dominated sorting algorithm to generate the non-dominated fronts in multi-objective optimization with evolutionary algorithms, particularly the NSGA-II. The non-dominated sorting algorithm used by NSGA-II has a time complexity of O(MN(2)) in generating non-dominated fronts in one generation (iteration) for a population size N and M objective functions. Since generating non-...

....... The fast and elitist non-dominated sorting genetic algorithm (NSGA-II) contains a mechanism to sort individuals in a multi-objective optimization problem into non-dominated fronts, based on their performance in each optimization variable. When dealing with a bi-objective problem it is possible to carry-out the non-dominated sorting more efficiently, using the new sorting method presente...

integrated production-distribution planning (pdp) is one of the most important approaches in supply chain networks. we consider a supply chain network (scn) to consist of multi suppliers, plants, distribution centers (dcs), and retailers. a bi-objective mixed integer linear programming model for integrating production-distribution designed here aim to simultaneously minimize total net costs in ...

Many studies are performed by researchers about Shell and Tube Heat Exchanger but the Multi-Objective Big Bang-Big Crunch algorithm (MOBBA) technique has never been used in such studies. This paper presents application of Thermal-Economic Multi-Objective Optimization of Shell and Tube Heat Exchanger Using MOBBA. For optimal design of a shell and tube heat exchanger, it was first thermally model...

Nowadays, the capability of cloud management suppliers is one of the important advantages for suppliers that can improve the performance and flexibility and reduce costs in companies through easy access to resources. Also, the environmental impacts of suppliers are a significant issue in today’s industrialization and globalization world. This paper analyzes these subjects by fuzzy multi-objecti...

NSGA methodology discussed in Section 3.1 suffers from three weaknesses: computational complexity, non-elitist approach and the need to specify a sharing parameter. An improved version of NSGA known as NSGA-II, which resolved the above problems and uses elitism to create a diverse Pareto-optimal front, has been subsequently presented (Deb et al 2002). The main features of NSGA-II are low comput...

Abstract: In order to solve the vehicle routing problem with pickup and delivery (VRPPD), this paper proposed an improved quantum genetic algorithm based on different constraint conditions. Firstly, a mathematical model was established aiming at minimizing the dispatching time and the total cost. Secondly, the paper proposes the improved quantum genetic algorithm and non dominated sorting strat...

We present a multiobjective genetic algorithm that incorporates various genetic algorithm techniques that have been proven to be efficient and robust in their problem domain. More specifically, we integrate rank based selection, adaptive niching through coevolutionary sharing, elitist recombination, and non-dominated sorting into a multiobjective genetic algorithm called ERMOCS. As a proof of c...