Solution bias in ant colony optimisation: Lessons for selecting pheromone models
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- scientific article; zbMATH DE number 710069 (Why is no real title available?)
- scientific article; zbMATH DE number 1961994 (Why is no real title available?)
- scientific article; zbMATH DE number 1488089 (Why is no real title available?)
- scientific article; zbMATH DE number 2173651 (Why is no real title available?)
- scientific article; zbMATH DE number 1390344 (Why is no real title available?)
- An ant colony optimization algorithm for shop scheduling problems
- Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
- The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances
Cited in
(6)- Modeling shortest path selection of the ant \textit{Linepithema humile} using psychophysical theory and realistic parameter values
- Experimental evaluation of pheromone models in ACOPlan
- Pheromone models in ant colony optimization (ACO)
- Countering the negative search bias of ant colony optimization in subset selection problems
- Numerical Analysis and Its Applications
- A new hidden Markov model approach for pheromone level exponent adaptation in ant colony system
This page was built for publication: Solution bias in ant colony optimisation: Lessons for selecting pheromone models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2475837)
