Ant-based crossover for permutation problems

DOI10.1007/3-540-45105-6_90MaRDI QIDQ4436899zbMATH OpenFDO

Authors Jürgen Branke, Christiane Barz, Ivesa Behrens

Publication date 4 December 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2723/27230754.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99)

Recommendations

• A Parallel Ant Colony Optimization Algorithm Based on Crossover Operation
• On solving permutation scheduling problems with ant colony optimization
• Ant algorithms and simulated annealing for multicriteria dynamic programming
• scientific article; zbMATH DE number 2079505
• Ant colony programming for approximation problems
• An experimental comparison of algebraic crossover operators for permutation problems
• Ant colony pattern search algorithms and their convergence
• An ant colony system for permutation flow-shop sequencing

Cited in

(3)

• A Parallel Ant Colony Optimization Algorithm Based on Crossover Operation
• Crossover can provably be useful in evolutionary computation
• An experimental comparison of algebraic crossover operators for permutation problems

This page was built for publication: Ant-based crossover for permutation problems

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