Models and algorithms for the phone network cabling problem

Author(s)

Daniel Felix Ferber

• Document type: Master's Dissertation
• Press: Campinas, SP.
• Institution: Universidade Estadual de Campinas (UNICAMP). Instituto de Computação
• Defense date: 2007-09-08

Examining board members

Arnaldo Vieira Moura; Nizam Omar; João Meidanis

• Advisor: Arnaldo Vieira Moura

Abstract

The main goal of these studies is the design of heuristics to support the planning of wire cabling on a phone network. The cabling will be handled from the central distribution point to terminal boxes. The assistance of a computational tool specialized in the design of phone networks raises new opportunities for cost reduction and decreases considerably the time spent designing the network. The problem is first studied in order to achieve a detailed specification with a mathematical model. Based on this information, several different strategies are laid out based on a heuristic called GRASP and the experimental results are compared. (AU)