Questions tagged [local-search]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
4
votes
2answers
144 views

Increase the dimension to ease the local search?

Local search, as the name suggests, takes a local angle to the optimization problem. In deep learning, an adjacent field, the "local minima" problem is frequently mitigated by increasing the ...
8
votes
5answers
665 views

Paper suggestions on local search algorithms

I am looking for papers (or any resources) that go deep into the details of implementing local search algorithms. I don't want an introductory paper on the subject. Rather, I would prefer a survey ...
7
votes
4answers
395 views

Learning local search operator selection

I'm just reading [1]. The authors use a neural network to solve capacitated vehicle routing problems through iterative generation of tours by solving a price-collecting traveling salesman problem in ...
3
votes
1answer
117 views

PSO. Hyperparameter Optimization for Similar Problems

I am doing a project where I am using Particle Swarm Optimization (PSO) for a design optimization problem. Naturally, in there I had to conduct hyperparameter optimization to find the most optimal ...
4
votes
1answer
143 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 ...
1
vote
2answers
179 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
237 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
129 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 ...