نتایج جستجو برای: non dominated sorting technique
تعداد نتایج: 1932750 فیلتر نتایج به سال:
In this paper, a multi-objective enhanced imperialist competitive algorithm (MOEICA) is presented. The main structures of the original ICA are employed while some novel approaches are also developed. Other than the non-dominated sorting and crowding distance methods which are used as the main tools for comparing and ranking solutions, an auxiliary comparison approach called fuzzy possession is ...
A novel approach to solve multi-objective optimization problems of complex mechanical systems is proposed based on evolutionary algorithm. Discrete mechanics derives structure preserving constraint equations and objective functions. Standard non-linear optimization techniques used to obtain optimal solution to these equations fails to find global optimum solution and also requires system satisf...
Computational Intelligence in Optimization of Wire Electrical Discharge Machining of Cold-Work Steel
In this study, two parameters of surface roughness and volumetric material removal rate are optimized based on computational intelligence method. Wire electrical discharge machine is used for machining of cold-work steel 2601. The relation between Input parameters including electrical current, pulse-off time, open-circuit voltage and gap voltage and output parameters is studied via Experimental...
Convex hull; Non-dominated solutions; Multi-objective evolutionary algorithms; Complexity; Ranking procedure. Abstract Due tomany applications of multi-objective evolutionary algorithms in real world optimization problems, several studies have been done to improve these algorithms in recent years. Since most multi-objective evolutionary algorithms are based on the non-dominated principle, and t...
This paper presents a new technique for the optimum placement of processors to minimize the total effective communication load under multi-processor communication dominated environment. This is achieved by placing heavily loaded processors near each other and lightly loaded ones far away from one another in the physical grid locations. The results are mathematically proved for the Algorithms ar...
A Case Study of a Multiobjective Elitist Recombinative Genetic Algorithm with Coevolutionary Sharing
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...
In the facility location problem usually reducing total transferring cost and time are common objectives. Designing of a network with hub facilities can improve network efficiency. In this study a new model is presented for P-hub covering location problem. In the p-hub covering problem it is attempted to locate hubs and allocate customers to established hubs while allocated nodes to hubs are in...
GAs have been successfully used in an aerodynamic shape design optimization. Time efficiency issues related to the evaluation of a fitness are becoming a critical point as large calculations are needed. In this paper two efficient methods are applied to the original GAs to save computational time. Firstly, parallelized GA is used for a single disciplinary optimization to investigate the scalabi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید