273 search results - page 15 / 55 » Genetic local search for multi-objective combinatorial optim... |
128
click to vote
TAINN
2005
Springer
15 years 4 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
ICRA
2003
IEEE
15 years 4 months ago
2003
IEEE
— This paper addresses the problem of simultaneous localization and mapping (SLAM) by a mobile robot. The SLAM problem is defined as a global optimization problem in which the o...
GECCO
2009
Springer
15 years 5 months ago
2009
Springer
Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations use...
INFORMATICALT
2006
14 years 10 months ago
2006
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
GECCO
2004
Springer
15 years 4 months ago
2004
Springer
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...