Optimization Online


A biased random-key genetic algorithm for routing and wavelength assignment

Thiago F. Noronha(tfn***at***dcc.ufmg.br)
Mauricio G. C. Resende(mgcr***at***research.att.com)
Celso C. Ribeiro(celso***at***ic.uff.br)

Abstract: The problem of routing and wavelength assignment (RWA) in wavelength division multiplexing (WDM) optical networks consists in routing a set of lightpaths and assigning a wavelength to each of them, such that lightpaths whose routes share a common fiber are assigned different wavelengths. This problem was shown to be NP-hard when the objective is to minimize the total number of wavelengths used. We propose a genetic algorithm with random keys for routing and wavelength assignment with the goal of minimizing the number of different wavelengths used in the assignment. This algorithm extends the best heuristic in the literature by embedding it into an evolutionary framework. Computational results show that the new heuristic improves the state-of-the-art algorithms in the literature.

Keywords: Genetic algorithm, routing, wavelength assignment, optical networks, random keys.

Category 1: Network Optimization

Category 2: Applications -- OR and Management Sciences (Telecommunications )

Category 3: Combinatorial Optimization (Meta Heuristics )

Citation: AT&T Labs Research Technical Report, Florham Park, New Jersey, April 2010.

Download: [PDF]

Entry Submitted: 04/04/2010
Entry Accepted: 04/05/2010
Entry Last Modified: 04/04/2010

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society