Simulated annealing and the (1+1) EA, a simple evolutionary algorithm, are both general randomized search heuristics that optimize any objective function with probability
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...
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...
— In this paper, we propose a population-based implementation of simulated annealing to tackle multi-objective optimisation problems, in particular those of combinatorial nature....
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, ...