A hybrid neural approach to combinatorial optimization
Computers and Operations Research - Special issue: artificial intelligence, evolutionary programming and operations research
Ant colony optimization and stochastic gradient descent
Artificial Life
QAPLIB – A Quadratic Assignment ProblemLibrary
Journal of Global Optimization
Modeling the dynamics of ant colony optimization
Evolutionary Computation
When Model Bias Is Stronger than Selection Pressure
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Model-Based Search for Combinatorial Optimization: A Comparative Study
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
A MAX-MIN Ant System for the University Course Timetabling Problem
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Toward the Formal Foundation of Ant Programming
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
An Ant-Based Framework for Very Strongly Constrained Problems
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
INFORMS Journal on Computing
Structural advantages for ant colony optimisation inherent in permutation scheduling problems
IEA/AIE'2005 Proceedings of the 18th international conference on Innovations in Applied Artificial Intelligence
Ant colony optimization for FOP shop scheduling: a case study on different pheromone representations
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
A study of greedy, local search, and ant colony optimization approaches for car sequencing problems
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Higher order pheromone models in ant colony optimisation
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Search bias in ant colony optimization: on the role of competition-balanced systems
IEEE Transactions on Evolutionary Computation
The hyper-cube framework for ant colony optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Alternative solution representations for the job shop scheduling problem in ant colony optimisation
ACAL'07 Proceedings of the 3rd Australian conference on Progress in artificial life
Population-ACO for the automotive deployment problem
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Two-stage updating pheromone for invariant ant colony optimization algorithm
Expert Systems with Applications: An International Journal
A method for avoiding the feedback searching bias in ant colony optimization
ICSI'12 Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part I
Countering the negative search bias of ant colony optimization in subset selection problems
Computers and Operations Research
A method for avoiding the searching bias in ACO deceptive problem solving
Web Intelligence and Agent Systems
Hi-index | 0.01 |
Ant colony optimisation is a constructive metaheuristic in which solutions are built probabilistically influenced by the parameters of a pheromone model-an analogue of the trail pheromones used by real ants when foraging for food. Recent studies have uncovered the presence of biases in the solution construction process, the existence and nature of which depend on the characteristics of the problem being solved. The presence of these solution construction biases induces biases in the pheromone model used, so selecting an appropriate model is highly important. The first part of this paper presents new findings bridging biases due to construction with biases in pheromone models. Novel approaches to the prediction of this bias are developed and used with the knapsack and generalised assignment problems. The second part of the paper deals with the selection of appropriate pheromone models when detailed knowledge of their biases is not available. Pheromone models may be derived either from characteristics of the way solutions are represented by the algorithm or characteristics of the solutions represented, which are often quite different. Recently it has been suggested that the latter is more appropriate. The relative performance of a number of alternative pheromone models for six well-known combinatorial optimisation problems is examined to test this hypothesis. Results suggest that, in general, modelling characteristics of solutions (rather than their representations) does lead to the best performance in ACO algorithms. Consequently, this principle may be used to guide the selection of appropriate pheromone models in problems to which ACO has not yet been applied.