Solving network synthesis problems using ant colony optimisation

DOI10.1007/3-540-45517-5_1MaRDI QIDQ2772483zbMATH OpenFDO

Authors Marcus Randall, Elliot Tonkes

Publication date 19 February 2002

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/2070/20700001

zbMATH Keywords

Ant colony optimisation, autonomous agents, heuristic search and telecommunications

Mathematics Subject Classification ID

Searching and sorting (68P10) Computing methodologies and applications (68U99)

Recommendations

• An improved ant colony optimization for the communication network routing problem
• A simulated annealing approach to communication network design
• Ant colony optimization: An overview
• scientific article; zbMATH DE number 2159380
• Ant colony optimization for the cell assignment problem in PCS networks

Cited in

(5)

• Coloured Ant System and local search to design local telecommunication networks
• Optimization algorithm of BP networks based on ant colony algorithm
• A dynamic optimisation approach for ant colony optimisation using the multidimensional knapsack problem
• ROUTING IN OPTICAL MULTISTAGE NETWORKS WITH LIMITED CROSSTALK USING ANT COLONY OPTIMIZATION
• A simulated annealing approach to communication network design

This page was built for publication: Solving network synthesis problems using ant colony optimisation

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