Show simple item record

dc.contributor.authorBerger, Daviden_US
dc.contributor.authorGendron, Bernarden_US
dc.contributor.authorPotvin, Jean-Yvesen_US
dc.contributor.authorRaghavan, S.en_US
dc.contributor.authorSoriano, Patricken_US
dc.date.accessioned2007-05-23T10:07:13Z
dc.date.available2007-05-23T10:07:13Z
dc.date.issued1999en_US
dc.identifier.urihttp://hdl.handle.net/1903/6021
dc.description.abstractThis paper examines a network design problem that arises in the telecommunications industry. In this problem, communication between a gateway vertex and a number of demand vertices is achieved through a network of fiber optic cables. <p>Since each cable has an associated capacity (bandwidth), enough capacity must be installed on the links of the network to satisfy the demand, using possibly different types of cables. Starting with a network with no capacity or some capacity already installed, a tabu search heuristic is designed to find a solution that minimizes the cost of installing any additional capacity on the network. This tabu search applies a k-shortest path algorithm to find alternative paths from the gateway to the demand vertices. Numerical results are presented on different types of networks with up to 200vertices and 100 demand vertices.en_US
dc.format.extent364178 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1999-32en_US
dc.subjectartificial intelligenceen_US
dc.subjectnetwork managementen_US
dc.subjectalgorithmsen_US
dc.subjectgraph theoryen_US
dc.subjecttabu searchen_US
dc.subjectnetwork designen_US
dc.subjectdiscrete optimizationen_US
dc.subjectSystems Integration Methodologyen_US
dc.titleTabu Search for a Network Loading Problemen_US
dc.typeTechnical Reporten_US
dc.contributor.departmentISRen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record