An efficient heuristic to dimension large-scale hybrid optoelectronic networks

Authors:
François Cartier;Brunilde Sansò;André Girard
Affiliations:
ícole Polytechnique de Montréal, GERAD and LORLAB, C.P. 6079, succ. centre-ville Montréal, Canada H3C 3A7;ícole Polytechnique de Montréal, GERAD and LORLAB, C.P. 6079, succ. centre-ville Montréal, Canada H3C 3A7;INRS-EMT and GERAD, Place Bonaventure, 800 de la Gauchetiére O Suite 6900, Montréal, QC Canada H5A 1K6
Venue:
Computers and Operations Research
Year:
2006

Citing 3
Cited 0

Routing and capacity assignment in backbone communication networks

Computers and Operations Research
Optical networks with hybrid routing

IEEE Journal on Selected Areas in Communications
Traffic grooming in WDM networks: past and future

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents a new heuristic to solve efficiently the problem of dimensioning large-size hybrid optoelectronic networks with grooming. It is modeled as a large mixed integer program which cannot be solved to optimality in a reasonable amount of time for networks larger than 10 nodes. The heuristic is based on concepts borrowed from genetic algorithm, tabu search and simulated annealing. The definition of the populations and neighborhoods are discussed in depth along with the intensification and diversification procedures. An application of this heuristic to networks of up to 50 nodes has shown excellent results: The computational time is low and the average optimality gap is generally under 7%.