Sciweavers

94 search results - page 6 / 19
» On the usefulness of infeasible solutions in evolutionary se...
Sort
View
EMO
2009
Springer
190views Optimization» more  EMO 2009»
14 years 1 months ago
Solving Bilevel Multi-Objective Optimization Problems Using Evolutionary Algorithms
Abstract. Bilevel optimization problems require every feasible upperlevel solution to satisfy optimality of a lower-level optimization problem. These problems commonly appear in ma...
Kalyanmoy Deb, Ankur Sinha
CEC
2007
IEEE
14 years 1 months ago
Improving hypervolume-based multiobjective evolutionary algorithms by using objective reduction methods
— Hypervolume based multiobjective evolutionary algorithms (MOEA) nowadays seem to be the first choice when handling multiobjective optimization problems with many, i.e., at lea...
Dimo Brockhoff, Eckart Zitzler
HEURISTICS
2002
65views more  HEURISTICS 2002»
13 years 6 months ago
Probability Distribution of Solution Time in GRASP: An Experimental Investigation
A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for combinatorial optimization. We study the probability distributions of solution time to a su...
Renata M. Aiex, Mauricio G. C. Resende, Celso C. R...
EMO
2001
Springer
150views Optimization» more  EMO 2001»
13 years 11 months ago
On the Effects of Archiving, Elitism, and Density Based Selection in Evolutionary Multi-objective Optimization
This paper studies the influence of what are recognized as key issues in evolutionary multi-objective optimization: archiving (to keep track of the current non-dominated solutions...
Marco Laumanns, Eckart Zitzler, Lothar Thiele
TCC
2007
Springer
100views Cryptology» more  TCC 2007»
14 years 24 days ago
Private Approximation of Clustering and Vertex Cover
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
Amos Beimel, Renen Hallak, Kobbi Nissim