Evaluation performance of genetic algorithm and tabu search algorithm for solving the Max-RWA problem in all-optical networks

Fouad Kharroubi (), Jing He (), Jin Tang, Ming Chen and Lin Chen ()
Additional contact information
Fouad Kharroubi: Hunan University
Jing He: Hunan University
Jin Tang: Hunan University
Ming Chen: Hunan University
Lin Chen: Hunan University

Journal of Combinatorial Optimization, 2015, vol. 30, issue 4, No 15, 1042-1061

Abstract: Abstract In this paper, we deal with the static Routing and Wavelength Assignment (RWA) problem in networks with no wavelength converters, and where a given static set of connection demands is prearranged. Our objective is to maximize the number of optical connection-requests that can be established for a given number of wavelengths. A mathematical formulation for Max-RWA was presented. In this article, we implement and compare the performance of two random search algorithms namely: the genetic algorithm and the tabu search algorithm. Using these metaheuristics we solved approximately the wavelength assignment problem for Max-RWA while we computed its routing by a deterministic method which is the backtracking. Therefore we conducted many extensive experiments under different circumstances. Diagrams and representative numerical examples indicate the accuracy of our algorithms.

Keywords: Routing and wavelength assignment; Tabu search algorithm; Genetic algorithm; Backtracking; Metaheuristics; Static lightpath demands; Random search algorithms (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-013-9676-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:30:y:2015:i:4:d:10.1007_s10878-013-9676-y

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-013-9676-y

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().