273 search results - page 19 / 55 » Genetic local search for multi-objective combinatorial optim... |
149
click to vote
TSE
2010
15 years 2 months ago
2010
Search based optimization techniques have been applied to structural software test data generation since 1992, with a recent upsurge in interest and activity within this area. How...
152
Voted
PPSN
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
105
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
This work studies the mGA operator (Micro Genetic Algorithm), that has been proposed in literature as a “local search” operator for optimization with Genetic Algorithm. A new ...
137
Voted
LPAR
2005
Springer
15 years 9 months ago
2005
Springer
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
138
Voted
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
A bit climber using a Gray encoding is guaranteed to converge to a global optimum in fewer than ¢¤£¦¥¨§© evaluations on unimodal 1-D functions and on multi-dimensional sph...