A template is presented that captures a vast majority of the local search algorithms proposed in the literature, including iterative improvement, simulated annealing, threshold accepting, tabu search and genetic algorithms. The template leads to a classification of existing local search algorithms and offers the possibility to fit in new types of local search approaches
We present a computational performance analysis of local search algorithms for job shop scheduling. ...
Local search has been applied successfully to a diverse collection of optimization problems. It's ap...
Date du colloque : 07/2008International audienceIn the paper we describe a theoretical framewor...
A template is presented that captures a vast majority of the local search algorithms proposed in the...
A template is presented that captures the majority of local search algorithms proposed in the litera...
A template is presented that captures the majority of local search algorithms proposed in the litera...
The major problem in solving combinatorial optimization problems is the huge size of the search spac...
AbstractThe major problem in solving combinatorial optimization problems is the huge size of the sea...
International audienceMany stochastic local search (SLS) methods rely on the manipulation of single ...
Many stochastic local search (SLS) methods rely on the manipulation of single solutions at each of t...
peer reviewedAchieving a balance between the exploration and exploitation capabilities of genetic al...
Achieving a balance between the exploration and exploitation capabilities of genetic algorithms is a...
We present a computational performance analysis of local search algorithms for job shop scheduling. ...
Local search techniques like simulated annealing and tabu search are based on a neighborhood structu...
Production planning under uncertain demands leads to optimisation problems that are hard both to mod...
We present a computational performance analysis of local search algorithms for job shop scheduling. ...
Local search has been applied successfully to a diverse collection of optimization problems. It's ap...
Date du colloque : 07/2008International audienceIn the paper we describe a theoretical framewor...
A template is presented that captures a vast majority of the local search algorithms proposed in the...
A template is presented that captures the majority of local search algorithms proposed in the litera...
A template is presented that captures the majority of local search algorithms proposed in the litera...
The major problem in solving combinatorial optimization problems is the huge size of the search spac...
AbstractThe major problem in solving combinatorial optimization problems is the huge size of the sea...
International audienceMany stochastic local search (SLS) methods rely on the manipulation of single ...
Many stochastic local search (SLS) methods rely on the manipulation of single solutions at each of t...
peer reviewedAchieving a balance between the exploration and exploitation capabilities of genetic al...
Achieving a balance between the exploration and exploitation capabilities of genetic algorithms is a...
We present a computational performance analysis of local search algorithms for job shop scheduling. ...
Local search techniques like simulated annealing and tabu search are based on a neighborhood structu...
Production planning under uncertain demands leads to optimisation problems that are hard both to mod...
We present a computational performance analysis of local search algorithms for job shop scheduling. ...
Local search has been applied successfully to a diverse collection of optimization problems. It's ap...
Date du colloque : 07/2008International audienceIn the paper we describe a theoretical framewor...
DOI
Add to ORKG