New answers tagged local-search
6
votes
Can Local Search Operators be formulated as a Mixed Integer Program?
What you describe is a special case of Large Neighborhood Search.
Large Neighborhood search is an optimization method that consists in destroying a part of a solution and recreating it with a ...
4
votes
Can Local Search Operators be formulated as a Mixed Integer Program?
I'm not aware of any work on modeling local search heuristics as MIPs. It is certainly possible to come up with a MIP model for each heuristic you mentioned. What is not clear is whether it is worth ...
2
votes
Book to learn metaheuristics
Two good (free) books are:
Essentials of Metaheuristics: https://cs.gmu.edu/~sean/book/metaheuristics/
Clever Algorithms: https://github.com/clever-algorithms/CleverAlgorithms
If you want to try ...
2
votes
How to do Local search when using Greedy random heuristics for GAP
Shifts and swaps are already good neighborhoods for the Generalized Assignment Problems:
Shift: move a task to another worker
Swap: swap the workers of two tasks
Another neighborhood found in some ...
9
votes
Book to learn metaheuristics
The most famous book on metaheuristics is probably the Handbook of Metaheuristics:
Michel Gendreau and Jean-Yves Potvin. 2010. Handbook of Metaheuristics (2nd. ed.). Springer Publishing Company, ...
Top 50 recent answers are included
Related Tags
local-search × 15metaheuristics × 5
reference-request × 4
mixed-integer-programming × 3
heuristics × 3
optimization × 2
combinatorial-optimization × 2
scheduling × 1
constraint-programming × 1
algorithms × 1
traveling-salesman × 1
assignment-problem × 1
branch-and-bound × 1
machine-learning × 1
feasible-points × 1
benchmark × 1
implementation × 1
parallel-computing × 1
simulated-annealing × 1
genetic-algorithm × 1