Questions tagged [localsearch]

Questions on optimization algorithms that improve a solution by repeatedly applying a small modification to it.

Filter by
Sorted by
Tagged with
4
votes
1answer
125 views

How to implement a local search with different operators?

I read some papers on local search. I remark that several authors use different move operators. However, the pseudo-code I found on google only uses one operator. I am wondering how to implement the ...
2
votes
2answers
142 views

How to correct this scheduling algorithm?

I have a scheduling problem to solve. It's a resource-constrained project scheduling problem with time-varying resource availabilities. The objective is minimizing tardiness. The full detailed model ...
13
votes
1answer
220 views

In Local Search, which reheating techniques have a good track record?

Given a fast-stepping Local Search (such as Simulated Annealing or Late Acceptance), which reheating approach is proven to work well? Generally speaking, reheating works like this: if [a condition is ...
3
votes
1answer
108 views

On what kind of problems a local search may perform better than MIP / CP techniques? [closed]

In combinatorial optimization, on what type of problem a local search may lead to better & quicker solutions than usual mixed-integer programming and constraint programming techniques ? By type ...