Questions tagged [meta-heuristics]

For questions related to meta-heuristics (e.g. simulated annealing, tabu search, ant colony optimization algorithms, etc).

Filter by
Sorted by
Tagged with
0
votes
1answer
60 views

Does a differential evolution algorithm mutate its population during a generation?

I'm implementing a differential evolution algorithm and when it comes to evolving a population, the page I am referencing is vague on how the new population is generated. https://en.wikipedia.org/wiki/...
0
votes
0answers
21 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
567 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
54 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
34 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
50 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
65 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, ...
2
votes
1answer
335 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 ...
4
votes
1answer
9k 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?
6
votes
1answer
137 views

Why can't I reproduce the experiments in the original paper that introduced the Firefly Algorithm?

I have been trying to reproduce the experiments done in the original: Firefly Algorithm for multimodal optimization (2010) by Xin-She Yang, but so far unsuccessfully. For the moment being, I'm okay if ...
3
votes
1answer
98 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 ...
12
votes
1answer
713 views

What are hyper-heuristics, and how are they different from meta-heuristics?

I wanted to know what the differences between hyper-heuristics and meta-heuristics are, and what their main applications are. Which problems are suited to be solved by hyper-heuristics?