Questions tagged [meta-heuristics]
For questions related to meta-heuristics (e.g. simulated annealing, tabu search, ant colony optimization algorithms, etc).
10
questions
1
vote
0answers
19 views
What to do when Iterated Local Search (ILS) method keeps making the solution worse?
I've been trying to solve an optimization problem with ITERATED LOCAL SEARCH (ILS) method. I've generated the initial solution, then followed the steps of ILS. However, even after running the ...
5
votes
1answer
136 views
What is the difference between Stochastic Hill Climbing and Simulated Annealing?
I am reading about local search: hill climbing, and its types, and simulated annealing
One of the hill climbing versions is "stochastic hill climbing", which has the following definition:
...
1
vote
0answers
44 views
What is the difference between exploitation and exploration in the context of optimization?
In the paper Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm (2015, published in Knowledge-Based Systems)
The test functions are divided to three groups: unimodal, multi-...
2
votes
0answers
30 views
How are the lower and upper bound values of the moths determined in the Moth-Flame Optimization algorithm?
I am currently implementing the Moth-Flame Optimization (MFO) Algorithm, based on the paper: Moth-Flame Optimization Algorithm: A Novel Nature-inspired Heuristic Paradigm.
To calculate the values of ...
1
vote
1answer
28 views
What are most commons methods to measure improvement rate in a meta-heuristic?
When I run a meta-heuristics, like a Genetic Algorithm or a Simulated Annealing, I want to have a termination criterion that stops the algorithms when there is not any significant fitness improvement.
...
1
vote
2answers
39 views
Why does Simulated Annealing not take worse solution if the energy difference becomes higher?
In Simulated Annealing, a worse solution is accepted with this probability:
$$p=e^{-\frac{E(y)-E(x)}{kT}}.$$
If that understanding is correct: Why is this probability function used? This means that, ...
0
votes
0answers
23 views
Which of these two strategies is the best to select solutions in simulated annealing?
I am using simulated annealing (SA) for an NP-hard combinatorial optimisation problem.
1) I am testing over a range of problem instances in which the objective values can be in the 100's or in the ...
2
votes
1answer
86 views
What are advantages of using meta-heuristic algorithms on optimization problems?
What are the advantages and disadvantages of using meta-heuristic algorithms on optimization problems? Simply, why do we use meta-heuristic algorithms, like PSO, over traditional mathematical ...
3
votes
1answer
7k views
What is an objective function?
Local search algorithms are useful for solving pure optimization problems, in which the aim is to find the best state according to an objective
function.
My question is what is the objective function?
3
votes
1answer
92 views
How to find proper parameter settings for a given optimization algorithm?
Is there any methodology to find proper parameter settings for a given meta-heuristic algorithm, e.g. the firefly algorithm or the cuckoo search? Is this an open issue in optimization? Is extensive ...
