Sciweavers

111 search results - page 1 / 23
» On the local performance of simulated annealing and the (1 1...
Sort
View
GECCO
2006
Springer
153views Optimization» more  GECCO 2006»
13 years 8 months ago
On the local performance of simulated annealing and the (1+1) evolutionary algorithm
Simulated annealing and the (1+1) EA, a simple evolutionary algorithm, are both general randomized search heuristics that optimize any objective function with probability
Thomas Jansen, Ingo Wegener
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
13 years 11 months ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
GECCO
2009
Springer
131views Optimization» more  GECCO 2009»
13 years 9 months ago
Rapid prototyping using evolutionary approaches: part 1
In this paper we describe a multi-objective problem solving approach, simultaneously minimizing average surface roughness Ra and build Time T, for object manufacturing by Rapid Pr...
Nikhil Padhye, Subodh Kalia
CEC
2008
IEEE
13 years 11 months ago
Evolutionary Multi-objective Simulated Annealing with adaptive and competitive search direction
— In this paper, we propose a population-based implementation of simulated annealing to tackle multi-objective optimisation problems, in particular those of combinatorial nature....
Hui Li, Dario Landa Silva
ESWA
2010
105views more  ESWA 2010»
13 years 2 months ago
A numerical comparison between simulated annealing and evolutionary approaches to the cell formation problem
The Cell Formation Problem is a crucial component of a cell production design in a manufacturing system. This problem consists of a set of product parts to be manufactured in a gr...
Andres Pailla, Athila R. Trindade, Victor Parada, ...