A simulated annealing approach to communication network design

Journal of Combinatorial Optimization

Volumn 6, Issue 1, 2002, Pages 55-65

  Randall, Marcus ^a   McMahon, Graham ^a   Sugden, Stephen ^a  

^a BOND UNIVERSITY   (Australia)

Author keywords

Communication network design; Local search; Simulated annealing

Indexed keywords

CONSTRAINT THEORY; GENETIC ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING; SET THEORY; TELECOMMUNICATION NETWORKS;

COMMUNICATION NETWORK DESIGN; LOCAL SEARCH; META-HEURISTIC SEARCH ALGORITHM;

SIMULATED ANNEALING;

EID: 0036498081     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1013337324030     Document Type: Article

References (21)

1. A simulated annealing code for general integer linear programs
2. Models for planning capacity expansion in local access telecommunication networks
3. Application of a genetic-based algorithm for optimal design of tree-structured communications networks
4. An integrated GA-LP approach to communication network design
5. Simulated annealing: An annotated bibliography
6. An improved annealing for the QAP
7. Simulated annealing: A tool for operational research
8. Augmented Lagrangian based algorithms for centralised network design
9. Neighbor finding algorithms for CMST customer calculations
10. Optimization by simulated annealing
11. A survey of simulated annealing to operations research problems
12. Strong formulations for network design problems with connectivity requirements
13. Fast network design for telecommunications
14. Network synthesis and the optimum network design problem: Models, solution methods and applications
15. An approach to a problem in network design using genetic algorithms
16. Computational experience of the balas algorithm applied to a selection of R&D projects
17. A general purpose meta-heuristic based solver for combinatorial optimisation problems
18. Applications of efficient search techniques for optimal design of computer communication networks