Sciweavers

345 search results - page 50 / 69
» Ant Colony Optimization for Multi-Objective Optimization Pro...
Sort
View
CEC
2007
IEEE
14 years 1 months ago
SAT-decoding in evolutionary algorithms for discrete constrained optimization problems
— For complex optimization problems, several population-based heuristics like Multi-Objective Evolutionary Algorithms have been developed. These algorithms are aiming to deliver ...
Martin Lukasiewycz, Michael Glaß, Christian ...
GECCO
2009
Springer
139views Optimization» more  GECCO 2009»
14 years 4 days ago
Meta-heuristics for reconstructing cross cut shredded text documents
In this work, we present two new approaches based on variable neighborhood search (VNS) and ant colony optimization (ACO) for the reconstruction of cross cut shredded text documen...
Matthias Prandtstetter, Günther R. Raidl
GECCO
2008
Springer
153views Optimization» more  GECCO 2008»
13 years 8 months ago
G-Metric: an M-ary quality indicator for the evaluation of non-dominated sets
An open problem in multiobjective optimization using the Pareto optimality criteria, is how to evaluate the performance of different evolutionary algorithms that solve multi– o...
Giovanni Lizárraga Lizárraga, Arturo...
CEC
2010
IEEE
13 years 7 months ago
The differential Ant-Stigmergy Algorithm for large-scale global optimization
— Ant-colony optimization (ACO) is a popular swarm intelligence metaheuristic scheme that can be applied to almost any optimization problem. In this paper, we address a performan...
Peter Korosec, Katerina Taskova, Jurij Silc
CEEMAS
2005
Springer
14 years 1 months ago
The "Dance or Work" Problem: Why Do not all Honeybees Dance with Maximum Intensity
A honeybee colony has to choose among several nectar sources in the environment, each fluctuating in quality over time. Successful forager bees return to the hive and perform dance...
Ronald Thenius, Thomas Schmickl, Karl Crailsheim