Sciweavers

285 search results - page 1 / 57
» Intelligent Neighborhood Exploration in Local Search Heurist...
Sort
View
ICTAI
2006
IEEE
13 years 10 months ago
Intelligent Neighborhood Exploration in Local Search Heuristics
Standard tabu search methods are based on the complete exploration of current solution neighborhood. However, for some problems with very large neighborhood or time-consuming eval...
Isabelle Devarenne, Hakim Mabed, Alexandre Caminad...
AIPS
2004
13 years 6 months ago
An Empirical Analysis of Some Heuristic Features for Local Search in LPG
LPG is a planner that performed very well in the last International planning competition (2002). The system is based on a stochastic local search procedure, and it incorporates se...
Alfonso Gerevini, Alessandro Saetti, Ivan Serina
HM
2007
Springer
135views Optimization» more  HM 2007»
13 years 11 months ago
Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem
This paper proposes a local search algorithm that makes use of a complex neighborhood relation based on a hybridization with a constructive heuristics for the classical resource-co...
Igor Pesek, Andrea Schaerf, Janez Zerovnik
HEURISTICS
2002
122views more  HEURISTICS 2002»
13 years 4 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
IPPS
2010
IEEE
13 years 2 months ago
Large neighborhood local search optimization on graphics processing units
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...