Questions tagged [metaheuristics]

Questions on general heuristic strategies that can be instantiated for a specific problem to obtain a heuristic.

Filter by
Sorted by
Tagged with
-2
votes
1answer
87 views

Any references to the ROADEF 2020 Challenge?

The problem description of the challenge is given here. Does anyone has some references to similar problem. I would like to participate but I don't know where to start.
4
votes
1answer
88 views

How to represent time window as constraint in a vehicle routing problem

Hi I am trying to solve a vehicle routing problem using Tabu search, I have successfully completed implementation of constraints for CVRP by giving penalties to objective function , how do I implement ...
9
votes
3answers
247 views

What is good introductory literature on (meta)heuristics?

What textbook/articles would you use to introduce heuristics and meta-heuristics to OR students? Assume they have already seen some OR (e.g., LP and MILP).
10
votes
3answers
1k views

Which Python package is suitable for multiobjective optimization

I would like to start using Python for modelling and solving optimization problems. I would like to use both single-objective problems and multi-objective problems with a multidimensional objective ...
7
votes
2answers
663 views

Difference between exploration and exploitation in Simulated Annealing algorithm

In evolutionary algorithms, two main abilities maintained which are Exploration and Exploitation. In Exploration the algorithm searching for new solutions in new regions, while Exploitation means ...
4
votes
1answer
129 views

How to parallelize metaheuristics algorithms (Island Model)?

I have different metaheuristics (Tabu search, Simulated annealing, Iterated local search) solving an optimization problem (a variant of the resource-constrained project scheduling problem). Each ...
0
votes
1answer
221 views

How to solve knapsack problem with simulated annealing?

I was going through the course contents of Optimization with Metaheuristics in Python in udemy , where they have solved a quadratic assignment problem using Simulated annealing in python , i was ...
6
votes
1answer
119 views

How to solve this variant of RCPSP

We have $m$ projects in parallel that require shared resources the resources has time varying capacities (i.e $B_{rt}$ is the units of resource $r$ available in period $t$). For each project there is $...
11
votes
5answers
764 views

How to implement a “generic” solver for scheduling problems?

I have been accepted for an internship for 6 months. The aim of this internship is to implement a "generic" solver for scheduling/production planning problems. This solver will bill a small prototype ...
9
votes
1answer
254 views

Integrating genetic algorithm (or other heuristic methods) with CPLEX

[Topic to discuss GA and CPLEX] I've seen some papers trying to integrate genetic algorithm with CPLEX, such as here and here. Although they integrated both, it is done in 2 different steps; that ...
6
votes
2answers
148 views

A heuristic approach to solve a MILP problem?

I have the following optimization problem which is a MILP. I can solve it with a MILP solver. This one I posted here Is there a heuristic approach to the MILP problem? Since I have an additional but ...
8
votes
2answers
404 views

Is there a greedy heuristic approach to the MILP problem?

I have the following optimization problem which is an MILP. I can solve it with an MILP solver. \begin{alignat}{1}\max_{x_n,t}\,&\quad t\quad\\\text{s.t.}&\quad\sum_{n=1}^{N} x_n \,&= M\\...
9
votes
1answer
137 views

Rules of thumb for using classic methods (e.g. branch and bound) vs. meta-heuristics (G.A, S.A, etc..) for non-convex problems?

Are there any rules of thumb for when to use classical methods like branch and bound, branch and cut, etc...for non-convex problems, vs using meta-heuristic methods like genetic algorithms, ...
14
votes
4answers
516 views

Online Education for OR and Developing Decision Support Systems

I am looking for educational programmes which can be conducted online, such as full MSc., degree certificates, postgraduate courses/modules, MOOCs. Topics I am looking for are on advanced ...
13
votes
1answer
221 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 ...
7
votes
1answer
134 views

How to interpret the random solution pick by Lévy flight on cuckoo search

I am working on an implementation of Cuckoo Search for a set covering problem. After reading some papers I cannot understand how choosing a random solution (new cuckoo) works. What I see is that ...
11
votes
4answers
363 views

Good resources for solving techniques (Metaheuristics, MILP, CP etc)

I want some resources (tutorials, online courses, lecture notes, articles, books, etc.) to learn the different techniques to solve OR problems (metaheuristics, CP, MILP, etc). It would be better if ...
18
votes
8answers
912 views

Are metaheuristics ever practical for continuous optimization?

All of the applications of metaheuristics that I can think of are for discrete optimization (usually combinatorial optimization) problems. Are metaheuristics ever practical tools for continuous ...
10
votes
2answers
196 views

Parallelization of an existing Adaptive Large Neighbourhood Search Heuristic

I am solving (or say, trying to find good solutions for) an arbitrary combinatorial optimization problem, think of it as a Vehicle Routing Problem with a bunch of side constraints that are not ...
18
votes
1answer
226 views

Combinatorial Optimization: Metaheuristics, CP, IP — “versus” or “and”?

"Recently" someone asked on Twitter whether "people still use genetic algorithms for integer programs". The "majority answer", i.e., 1 out of 1, was: "Yes" . So, my follow-up question is: With all ...