Questions tagged [local-search]
The local-search tag has no summary.
23 questions
0
votes
0
answers
71
views
+50
Binary search to tune LP constraints
I have a sort of reverse question; I have a technique that finds a close approximate solution to my problem but I'm not sure what this technique is named, if at all.
My problem started as a network ...
1
vote
0
answers
94
views
Guided local search for VRP in OR-TOOLS
I am trying to solve capacitated vehicle routing problem (CVRP) using OR-TOOLS
could you please tell me how guided local search (GLS) works for this problem in OR-TOOLS?
I only find very general ...
3
votes
2
answers
188
views
Python packages for flexible metaheuristics
Are there any convenient python packages allowing to flexibly modify different parts of a metaheuristic routine?
Say I have a new idea of how to do a local search in a particular optimization problem (...
0
votes
0
answers
67
views
Formulation for data insight
There is an interesting data insight question that I want to solve using mathematical programming. I aim to find the combination of features that has the highest impact on the target indicators.
We ...
1
vote
0
answers
226
views
Node swap and edge swap for TSP
When devising heuristics for the TSP I often see edge exchange algorithms suggested. But I also find them a bit hard to understand and somewhat cumbersome to implement.
When I think about a TSP, I ...
1
vote
1
answer
74
views
What methods exist for tree search over a large complex state representation?
Tree search over a state space often assumes that the state can be represented compactly and repeated in each node of the search tree.
Suppose I have a large simulation with 100000's of entities each ...
13
votes
4
answers
3k
views
Is there an open-source equivalent to LocalSolver?
I have a constraint programming problem that is easy to formulate and solve (with high solution quality) in LocalSolver. However, I would really prefer to use something open source for ...
3
votes
0
answers
86
views
How can I use a local search meta heuristic after completing construction heuristic?
I'm investigating how I can combine a construction heuristic and a local search metaheuristic to quickly solve Capacitated Split Delivery Veichle Routing Problem (CSDVRP). The construction heuristic ...
5
votes
2
answers
362
views
Can Local Search Operators be formulated as a Mixed Integer Program?
Consider the situation of Vehicle Routing. Once we have an initial solution, one can apply various local search moves to improve it.
For example:
Removing a single customer from a route and inserting ...
2
votes
1
answer
107
views
How to do Local search when using Greedy random heuristics for GAP
If I want to try a greedy randomized adaptive search procedure for the generalized assignment problem (assign N tasks to N workers to minimize the total costs), the GRASP method requires 2 parts
...
5
votes
2
answers
2k
views
Book to learn metaheuristics
I want to learn about metaheuristics and start building one to solve combinatorial optimization which is pretty hard to solve. I am looking for book recommendation or any learning experience to learn ...
4
votes
0
answers
184
views
When to use Tabu Search or Genetic Algorithms and when not?
Are there any rules of thumb about when to implement which? For example, I am trying to solve OR scheduling problems. I see that majority of people have implemented Genetic Algorithms. However, more ...
0
votes
1
answer
221
views
Question re Tabu Search
I am working through the Udemy course "Optimizing Travelling Salesman and Vehicle Routing Problems".
A part of the course is looking at Tabu search as a solution to the vehicle routing ...
8
votes
0
answers
203
views
Traveling Salesman Problem: determine k-exchange feasibility
Given a current solution $S$ and a $k$-exchange move $(v_1, .., v_{2k+1})$ with $v_1 = v_{2k+1}$, $v_i \neq v_j$, $(v_i, v_{i+1}) \in E(S)$ iff $i$ odd, i.e. we remove all edges $(v_i, v_{i+1})$ for $...
4
votes
2
answers
621
views
When solving many MILPs how to assign CPU cores to solver instances?
Let's say I have an 16 core machine and many roughly equally hard MILP problems and enough RAM. The latency of solving doesn't matter. With how many cores should I start solvers on to maximize ...