Ant colony programming for approximation problems

DOI10.1007/3-540-45105-6_14MaRDI QIDQ4436782zbMATH OpenFDO

Authors Mariusz Boryczka, Wojciech Wieczorek, Zbigniew J. Czech

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/27230142.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 2079505
• Eliminating introns in ant colony programming
• scientific article; zbMATH DE number 2159380
• Answer set programming by ant colony optimization
• Ant algorithms: theory and applications

Cited in

(10)

• Coupling ant colony systems with strong local searches
• Solving differential equations with ant colony programming
• Boosting ant colony optimization via solution prediction and machine learning
• Finding numerical solutions of Diophantine equations using ant colony optimization
• Model Checking the Ant Colony Optimisation
• Ant colony system solving capacitated location-allocation problems on a line
• Ant-based crossover for permutation problems
• scientific article; zbMATH DE number 2079505 (Why is no real title available?)
• Refraction law and Fermat principle: a project using the ant colony optimization algorithm for undergraduate students in physics
• Eliminating introns in ant colony programming

This page was built for publication: Ant colony programming for approximation problems

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