Results 241 to 250 of about 12,149,384 (283)
Some of the next articles are maybe not open access.
Dynamic Multi-objective Optimization Evolutionary Algorithm
Third International Conference on Natural Computation (ICNC 2007), 2007A new evolutionary algorithm for Dynamic multiobjective optimization is proposed in this paper. First, the time period is divided into several random subperiods. In each subperiod, the problem is approximated by a static multi- objective optimization problem.
Chun-an Liu, Yuping Wang 0003
openaire +2 more sources
A multi-objective evolutionary algorithm for examination timetabling
Journal of Scheduling, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chun Yew Cheong +2 more
openaire +3 more sources
An new evolutionary multi-objective optimization algorithm
The 2003 Congress on Evolutionary Computation, 2003. CEC '03., 2004We introduce a new, simple and efficient evolutionary algorithm to multiobjective optimization problem, which based on neighborhood and archived operation (NAGA). The innovations contain two main parts: neighborhood identify procedure to obtain Pareto optimal solutions from the population and neighborhood crowding procedure to maintain the diversity of
Shengjing Mu +3 more
openaire +2 more sources
An Evolutionary Algorithm for Dynamic Multi-Objective TSP
2007Dynamic multi-objective TSP (DMOTSP), a new research filed of evolutionary computation, is an NP-hard problem which comes from the applications of mobile computing, mobile communications. Currently, only a small number of literatures related to the research of static multi-objective TSP and dynamic single objective TSP.
Ming Yang 0003, Lishan Kang, Jing Guan
openaire +2 more sources
The Initialization of Evolutionary Multi-objective Optimization Algorithms
2015Evolutionary algorithms are the most widely used meta-heuristics for solving multi objective optimization problems, and since all of these algorithms are population based, such as NSGAII, there are a set of factors that affect the final outcomes of these algorithms such as selection criteria, crossover, mutation and fitness evaluation.
Mohammad Hamdan 0001, Osamah Qudah
openaire +1 more source
An evolutionary algorithm for constrained multi-objective optimization
Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600), 2003The paper follows the line of the design and evaluation of new evolutionary algorithms for constrained multi-objective optimization. The evolutionary algorithm proposed (ENORA) incorporates the Pareto concept of multi-objective optimization with a constraint handling technique and with a powerful diversity mechanism to obtain multiple nondominated ...
Fernando Jiménez +3 more
openaire +1 more source
Interval Robust Multi-Objective Evolutionary Algorithm
2009 IEEE Congress on Evolutionary Computation, 2009Uncertainties are commonly present in optimization systems, and when they are considered in the design stage, the problem usually is called a robust optimization problem. Robust optimization problems can be treated as noisy optimization problems, as worst case minimization problems, or by considering the mean and standard deviation values of the ...
Gustavo L. Soares +4 more
openaire +1 more source
Multi-Objective Evolutionary Algorithms
2015Evolutionary algorithms (EA s) have amply shown their promise in solving various search and optimization problems for the past three decades. One of the hallmarks and niches of EAs is their ability to handle multi-objective optimization problems in their totality, which their classical counterparts lack.
openaire +1 more source
Performance Scaling of Multi-objective Evolutionary Algorithms
2003MOEAs are getting immense popularity in the recent past, mainly because of their ability to find a wide spread of Pareto-optimal solutions in a single simulation run. Various evolutionary approaches to multi-objective optimization have been proposed since 1985.
Vineet R. Khare +2 more
openaire +1 more source
Self-Adaptation for Multi-objective Evolutionary Algorithms
2003Evolutionary Algorithms are a standard tool for multi-objective optimization that are able to approximate the Pareto front in a single optimization run. However, for some selection operators, the algorithm stagnates at a certain distance from the Pareto front without convergence for further iterations. We analyze this observation for different multi-
Dirk Büche +2 more
openaire +1 more source

