Sciweavers

91 search results - page 6 / 19
» Dynamics of local search heuristics for the traveling salesm...
Sort
View
GECCO
2010
Springer
213views Optimization» more  GECCO 2010»
13 years 7 months ago
Consultant-guided search algorithms for the quadratic assignment problem
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
Serban Iordache
HEURISTICS
2002
122views more  HEURISTICS 2002»
13 years 7 months ago
Complete Local Search with Memory
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
Diptesh Ghosh, Gerard Sierksma
LION
2007
Springer
139views Optimization» more  LION 2007»
14 years 1 months ago
Evolution of Fitness Functions to Improve Heuristic Performance
In this paper we introduce the variable fitness function which can be used to control the search direction of any search based optimisation heuristic where more than one objective ...
Stephen Remde, Peter I. Cowling, Keshav P. Dahal, ...
JAR
2000
149views more  JAR 2000»
13 years 7 months ago
Guided Local Search for Solving SAT and Weighted MAX-SAT Problems
In this paper, we show how Guided Local Search (GLS) can be applied to the SAT problem and show how the resulting algorithm can be naturally extended to solve the weighted MAX-SAT ...
Patrick Mills, Edward P. K. Tsang
GECCO
2008
Springer
238views Optimization» more  GECCO 2008»
13 years 8 months ago
Using multiple offspring sampling to guide genetic algorithms to solve permutation problems
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
Antonio LaTorre, José Manuel Peña, V...