An external partial permutations memory for ant colony optimization

DOI10.1007/978-3-540-31996-2_1MaRDI QIDQ5706000zbMATH OpenOpenAlexFDO

Authors Adnan Acan

Publication date 10 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b107115

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Recommendations

• Parallel Ant Colonies for the quadratic assignment problem
• On solving permutation scheduling problems with ant colony optimization
• Optimization of the quadratic assignment problem using an ant colony algorithm
• Ant colonies for the quadratic assignment problem
• A new approach to solve permutation scheduling problems with ant colony optimization

Cited in

(3)

• Eidetic wolf search algorithm with a global memory structure
• Experimental analysis of crossover and mutation operators on the quadratic assignment problem
• A survey for the quadratic assignment problem

This page was built for publication: An external partial permutations memory for ant colony optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5706000)