Abstract. We are interested in the role of restricted mating schemes in the context of evolutionary multi-objective algorithms. In this paper, we propose an adaptive assortative mating scheme that uses similarity in the decision space (genotypic assortative mating) and adapts the mating pressure as the search progresses. We show that this mechanism improves the performance of the simple evolutionary algorithm for multi-objective optimisation (SEAMO2) on the multiple knapsack problem.
In multi/many-objective evolutionary algorithms (MOEAs), to alleviate the degraded convergence press...
In multi/many-objective evolutionary algorithms (MOEAs), to alleviate the degraded convergence press...
A simple steady-state, Pareto-based evolutionary algorithm is presented that uses an elitist strateg...
Abstract. This paper proposes a new mating scheme for evolutionary multiobjective optimization (EMO)...
In any traditional Genetic Algorithm (GA), recombination is a dominant search operator and capable o...
Genetic algorithms typically use crossover, which relies onmating a set of selected par-ents. As par...
Genetic algorithms typically use crossover, which relies onmating a set of selected par-ents. As par...
Abstract—Achieving balance between convergence and diver-sity is a basic issue in evolutionary multi...
In genetic algorithms, selection or mating scheme is one of the important operations. In this paper,...
Abstract—In this paper, we propose a population-based implementation of simulated annealing to tackl...
In this paper we present an evolutionary algorithm for constrained optimization. The algorithm is ba...
Multi-objectivization is the process of reformulating a single-objective problem into a multi-object...
In spite of the recent quick growth of the Evolutionary Multi-objective Optimization (EMO) research ...
In genetic algorithms, selection or mating scheme is one of the important operations. In this paper,...
In spite of the recent quick growth of the Evolutionary Multi-objective Optimization (EMO) research ...
In multi/many-objective evolutionary algorithms (MOEAs), to alleviate the degraded convergence press...
In multi/many-objective evolutionary algorithms (MOEAs), to alleviate the degraded convergence press...
A simple steady-state, Pareto-based evolutionary algorithm is presented that uses an elitist strateg...
Abstract. This paper proposes a new mating scheme for evolutionary multiobjective optimization (EMO)...
In any traditional Genetic Algorithm (GA), recombination is a dominant search operator and capable o...
Genetic algorithms typically use crossover, which relies onmating a set of selected par-ents. As par...
Genetic algorithms typically use crossover, which relies onmating a set of selected par-ents. As par...
Abstract—Achieving balance between convergence and diver-sity is a basic issue in evolutionary multi...
In genetic algorithms, selection or mating scheme is one of the important operations. In this paper,...
Abstract—In this paper, we propose a population-based implementation of simulated annealing to tackl...
In this paper we present an evolutionary algorithm for constrained optimization. The algorithm is ba...
Multi-objectivization is the process of reformulating a single-objective problem into a multi-object...
In spite of the recent quick growth of the Evolutionary Multi-objective Optimization (EMO) research ...
In genetic algorithms, selection or mating scheme is one of the important operations. In this paper,...
In spite of the recent quick growth of the Evolutionary Multi-objective Optimization (EMO) research ...
In multi/many-objective evolutionary algorithms (MOEAs), to alleviate the degraded convergence press...
In multi/many-objective evolutionary algorithms (MOEAs), to alleviate the degraded convergence press...
A simple steady-state, Pareto-based evolutionary algorithm is presented that uses an elitist strateg...