Skip to main content
3 votes
Accepted

What is the meaning of the square brackets in ant colony optimization?

The square brackets $[]$ in $[\tau_{ij}]^\alpha$ and $[\eta_{ij}]^\beta$ may be just a way of emphasing that the elements $\tau_{ij} \in \mathbb{R}$ and $\eta_{ij} \in \mathbb{R}$ of respectively the ...
nbro's user avatar
  • 40.9k
2 votes

What is the difference between the ant system and the max-min ant system?

Let's start by making clear that both AS and MMAS use only global pheromone update. Now, the MMAS has two main differences regarding AS: In AS, all ants that completed a solution are used for the ...
djbetancourt's user avatar
2 votes
Accepted

What are the applications of ant colony optimization algorithms?

The first ant colony optimisation algorithm was introduced by Marco Dorigo in the report Positive Feedback as a Search Strategy (1991) and his PhD thesis Optimization, Learning and Natural Algorithms (...
nbro's user avatar
  • 40.9k
1 vote
Accepted

Which algorithms, between ant colony or classical routing algorithms, have a better time complexity for the shortest path problem?

No. In general, you can't find a tight bound for evolutionary algorithms, and it is one of the main difference of these algorithms with the classical algorithms. You should notice that it does not ...
OmG's user avatar
  • 1,826
1 vote

What is the difference between continuous domains and discrete combinatorial optimization?

A continous domain can be imagined as a space in which the axes of the coordinate systems are the parameters of the continous domain. If we take 2D Cartesian space as an example, it is a continous ...
50k4's user avatar
  • 225
1 vote

How can I benchmark an application of ant colony optimization?

The biggest issue here may be similarity to prior work. As for the benchmarks, benchmarks are a common means for comparing algorithms. What it means here would be to compare the end-result (your ...
N E Techno Tech Blog's user avatar
1 vote
Accepted

How can I benchmark an application of ant colony optimization?

I would assume that in this case, they are asking you to compare the performance of your particular algorithm to other similar algorithms used in pathfinding. For example, A*
hisairnessag3's user avatar

Only top scored, non community-wiki answers of a minimum length are eligible