Skip to main content

Questions tagged [local-search]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
0 votes
0 answers

When does local search algorithm for SMT (1-Steiner algorithm) not output the optimal solution?

I am trying to find an example where the 1-steiner algorithm (local search algorithm for Steiner Minimum Tree) does not output the optimal solution, but each instance I find seems to be optimal.
Marie's user avatar
  • 9
0 votes
0 answers

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 ...
Ying's user avatar
  • 105
1 vote
0 answers

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 ...
Djames's user avatar
  • 1,143
1 vote
1 answer

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 ...
Brendan Hill's user avatar
11 votes
4 answers

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 ...
Kathryn Twomey's user avatar
3 votes
0 answers

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 ...
Parseval's user avatar
  • 207
5 votes
2 answers

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 ...
watchdogs132's user avatar
2 votes
1 answer

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 ...
gameveloster's user avatar
5 votes
2 answers

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 ...
overboxed's user avatar
  • 593
4 votes
0 answers

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 ...
Amogh Bhosekar's user avatar
0 votes
1 answer

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 ...
dkent's user avatar
  • 217
8 votes
0 answers

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 $...
fontanf's user avatar
  • 2,623
4 votes
2 answers

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 ...
worldsmithhelper's user avatar
4 votes
2 answers

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 ...
Joannes Vermorel's user avatar
10 votes
6 answers

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 ...
Approximations's user avatar
7 votes
4 answers

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 ...
ktnr's user avatar
  • 491
3 votes
1 answer

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 ...
chupa_kabra's user avatar
  • 1,485
4 votes
1 answer

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 ...
joo's user avatar
  • 41
1 vote
2 answers

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 ...
Joffrey L.'s user avatar
13 votes
1 answer

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 ...
Geoffrey De Smet's user avatar
3 votes
1 answer

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 ...
Aral's user avatar
  • 63