8
votes
Paper suggestions on local search algorithms
Below are some papers from LocalSolver team members that detail local search approaches for diverse combinatorial optimization problems, with some focus on low-level implementation details:
T. Benoist,...
- 2,609
8
votes
Accepted
In Local Search, which reheating techniques have a good track record?
This is where automatic algorithm configuration and design comes to the rescue. In my experience, different combinations of strategies work equally fine, at least when combined with other components ...
- 1,028
6
votes
Accepted
Learning local search operator selection
In addition to the hyperheuristics mentioned by batwing, you can look for the broader topic of (automatic) algorithm selection and configuration.
Generally speaking, algorithm selection is the task of ...
- 1,028
5
votes
Learning local search operator selection
I think you may be interested in the topic of hyper-heuristics. Very loosely, given a bunch of local search operators for a problem, the idea is to combine those local search operators to form a short ...
- 1,311
4
votes
When solving many MILPs how to assign CPU cores to solver instances?
So we know that MILP instances are independent and that the total throughput is to be maximized. In practice, increasing the number of threads used by a solver to solve a MILP instance could ...
- 2,110
4
votes
Increase the dimension to ease the local search?
Redefining the solution space is a way to make local search heuristics perform better. This is useful for tightly constrained problems where moving from one feasible solution to another is difficult.
...
- 2,609
4
votes
Paper suggestions on local search algorithms
This answer focuses on the "papers that go into the details of implementation on a given optimization problem" part of the question.
In "Variable neighborhood search for the $p$-median&...
- 5,347
4
votes
Paper suggestions on local search algorithms
I'm not an expert in the field, but the paper An effective implementation of the Lin-Kernighan traveling salesman heuristic by Keld Helsgaun was mentioned in another question before.
- 2,265
4
votes
Accepted
PSO. Hyperparameter Optimization for Similar Problems
In general you are correct, but the extent to which you are depends heavily on your objective function (and set of constraints, if you have any).
As you say, when the problem changes, the landscape ...
- 1,028
3
votes
How to implement a local search with different operators?
I suggest you take a look at Variable Neighborhood Search (VNS) method. The Wikipedia page has some useful pseudo codes.
My answer to OP EDIT:
First, I think there is no good or bad algorithm, it ...
- 2,034
3
votes
How to correct this scheduling algorithm?
I'm not sure there is a way to tweak your heuristic that will guarantee finding a feasible solution (assuming one exists). What you might try is a restart approach combined with a modification of your ...
- 28.9k
3
votes
On what kind of problems a local search may perform better than MIP / CP techniques?
Those that you can't completely explore the branch-and-bound tree within your time limit. 😉 Don't forget you can do local search and large neighbourhood search in a branch-and-bound tree: fix some ...
- 1,225
3
votes
Paper suggestions on local search algorithms
Blot et al. (2018)1 did an extensive literature review on multi-objective LS algorithms. You may wish to take a look at Ishibuchi and Murata (2004)2 which focuses on issues in evolutionary algorithms.
...
- 5,010
2
votes
Paper suggestions on local search algorithms
For what it's worth, here you can download our paper on Multithreaded Incremental Solving for Local Search (not to be confused with multi-walk solving (AKA multi-bet solving), multi-tentant solving or ...
- 4,377
2
votes
Learning local search operator selection
Elementary learning approaches to select local search operators dynamically - that is, during the search - work well in practice. Here is what we call "elementary learning approaches". Given ...
- 2,609
2
votes
Accepted
Question re Tabu Search
Your doubt is right: you should NOT go back to your best solution if the current solution is not in the tabu list. You should invert the if statement and see if the tabu search leads to better ...
- 584
2
votes
Accepted
When solving many MILPs how to assign CPU cores to solver instances?
As far as I know, solution speed for solvers is typically a sublinear function of the number of threads/cores. This makes sense since parallel processing requires additional effort (CPU cycles) to ...
- 28.9k
1
vote
Increase the dimension to ease the local search?
In general, increasing the dimension of the neighbourhood of a local search can improve the final results, because a local optimum for a neighbourhood is not necessarily a local optimum for a ...
- 1,028
1
vote
Learning local search operator selection
This talk discusses several approaches to integrate machine learning in local search algorithms by identifying
good solutions
bad solutions
promising neighborhoods
through offline learning of ...
- 461
Only top scored, non community-wiki answers of a minimum length are eligible