544 search results - page 49 / 109 » Improving Local Search for Fuzzy Scheduling Problems |
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
— Capacitated arc routing problem (CARP) has attracted much attention due to its generality to many real world problems. Memetic algorithm (MA), among other metaheuristic search ...
CP
2008
Springer
13 years 9 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
AMEC
2003
Springer
14 years 1 months ago
2003
Springer
Digital information economies require information goods producers to learn how to position themselves within a potentially vast product space. Further, the topography of this spac...
GECCO
2000
Springer
13 years 11 months ago
2000
Springer
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
CONIELECOMP
2005
IEEE
14 years 1 months ago
2005
IEEE
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...