Ant colony optimisation applied to a dynamically changing problem

DOI10.1007/3-540-48035-8_60MaRDI QIDQ3047803zbMATH OpenFDO

Authors Daniel Angus, Tim Hendtlass

Publication date 12 August 2004

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/2358/23580618.htm

zbMATH Keywords

Ant Colony OptimisationMeta-heuristicsOptimisation

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Dynamic ant colony optimisation
• A dynamic optimisation approach for ant colony optimisation using the multidimensional knapsack problem
• A computational study on ant colony optimization for the traveling salesman problem with dynamic demands
• An ant colony algorithm aimed at dynamic continuous optimization
• A new charged ant colony algorithm for continuous dynamic optimization

Cited in

(6)

• A new charged ant colony algorithm for continuous dynamic optimization
• Dynamic ant colony optimisation
• A computational study on ant colony optimization for the traveling salesman problem with dynamic demands
• scientific article; zbMATH DE number 5846258 (Why is no real title available?)
• A dynamic optimisation approach for ant colony optimisation using the multidimensional knapsack problem
• scientific article; zbMATH DE number 5205440 (Why is no real title available?)

This page was built for publication: Ant colony optimisation applied to a dynamically changing problem

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