The ant colony optimization meta-heuristic
New ideas in optimization
ACO algorithms for the quadratic assignment problem
New ideas in optimization
Ant algorithms for discrete optimization
Artificial Life
A Population Based Approach for ACO
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Case-Based Initialization of Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
A Comparison of Dominance Mechanisms and Simple Mutation on Non-stationary Problems
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Applying Population Based ACO to Dynamic Optimization 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
Chromosome reuse in genetic algorithms
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
A memory-based colonization scheme for particle swarm optimization
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Incorporating Tabu Search Principles into ACO Algorithms
HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
Cunning ant system for quadratic assignment problem with local search and parallelization
PReMI'07 Proceedings of the 2nd international conference on Pattern recognition and machine intelligence
cAS: ant colony optimization with cunning ants
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Iterated ants: an experimental study for the quadratic assignment problem
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Hi-index | 0.00 |
A novel external memory implementation based on the use of partially complete sequences of solution components from above-average quality individuals over a number of previous iterations is introduced. Elements of such variable-size partial permutation sequences are taken from randomly selected positions of parental individuals and stored in an external memory called the partial permutation memory. Partial permutation sequences are associated with lifetimes together with their parent solutions’ fitness values that are used in retrieving and updating the contents of the memory. When a solution is to be constructed, a partial permutation sequence is retrieved from the memory based on its age and associated fitness value, and the remaining components of the partial solution is completed with an ant colony optimization algorithm. Resulting solutions are also used to update some elements within the memory. The implemented algorithm is used for the solution of a difficult combinatorial optimization problem, namely the quadratic assignment problem, for which significant performance achievements are provided in terms of convergence speed and solution quality.