Sciweavers

805 search results - page 4 / 161
» Combinatorial optimization problems in self-assembly
Sort
View
SWARM
2012
SPRINGER
329views Optimization» more  SWARM 2012»
12 years 4 months ago
A critical analysis of parameter adaptation in ant colony optimization
Applying parameter adaptation means operating on parameters of an algorithm while it is tackling an instance. For ant colony optimization, several parameter adaptation methods have...
Paola Pellegrini, Thomas Stützle, Mauro Birat...
EVOW
2005
Springer
14 years 2 months ago
Self-Adapting Evolutionary Parameters: Encoding Aspects for Combinatorial Optimization Problems
Abstract. Evolutionary algorithms are powerful tools in search and optimization tasks with several applications in complex engineering problems. However, setting all associated par...
Marcos H. Maruo, Heitor S. Lopes, Myriam Regattier...
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
13 years 9 months ago
A multi-start quantum-inspired evolutionary algorithm for solving combinatorial optimization problems
Quantum-inspired evolutionary algorithms (QIEAs), as a subset of evolutionary computation, are based on the principles of quantum computing such as quantum bits and quantum superp...
Parvaz Mahdabi, Saeed Jalili, Mahdi Abadi
AI
2006
Springer
13 years 8 months ago
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
Sharlee Climer, Weixiong Zhang
PPSN
2004
Springer
14 years 1 months ago
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...
Patrick Briest, Dimo Brockhoff, Bastian Degener, M...