Metaheuristic solutions to some combinatorial optimization problems arising in telecommunications

In this talk, we first give a review of biased random-key genetic algorithms. This is followed by several applications of the technique to combinatorial optimization problems that arise in telecommunications. We describe heuristics for routing in IP networks that use the OSPF and DEFT protocols, survivable network design in composite link IP networks where routing is done with OSPF, location of network monitors that are used to estimate packet loss between two edge nodes in an IP network, and routing and wavelength assignment in wavelength division multiplexing optical networks.