98 search results - page 3 / 20 » Cut-and-solve: An iterative search strategy for combinatoria... |
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
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...
TELSYS
2011
13 years 2 months ago
2011
GRASP (Greedy Randomized Adaptive Search Procedures) is a multistart metaheuristic for producing good-quality solutions of combinatorial optimization problems. Each GRASP iteration...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Genetic algorithms (GAs) have recently become very popular by solving combinatorial optimization problems. In this paper, we propose an extension of the hybrid genetic algorithm f...
ICEC
1994
13 years 8 months ago
1994
Combinatorial optimization problems require computing efforts which grow at least exponentially with the problem dimension. Therefore, the use of the remarkable power of massively...
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
An important challenge within hyper-heuristic research is to design search methodologies that work well, not only across different instances of the same problem, but also across di...