A tabu search algorithm for static routing and wavelength assignment problem

Static routing and wavelength assignment (RWA) is usually formulated as an optimization problem with the objective of minimizing wavelength usage (MWU). Existing solution methodologies for the MWU problem are usually based on a two-step app...

Full description

Saved in:
Bibliographic Details
Main Authors: Wang, Ying, Cheng, Tee Hiang, Lim, Meng-Hiot
Other Authors: School of Electrical and Electronic Engineering
Format: Article
Language:English
Published: 2010
Subjects:
Online Access:https://hdl.handle.net/10356/90761
http://hdl.handle.net/10220/6312
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-90761
record_format dspace
spelling sg-ntu-dr.10356-907612020-03-07T14:02:39Z A tabu search algorithm for static routing and wavelength assignment problem Wang, Ying Cheng, Tee Hiang Lim, Meng-Hiot School of Electrical and Electronic Engineering DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems Static routing and wavelength assignment (RWA) is usually formulated as an optimization problem with the objective of minimizing wavelength usage (MWU). Existing solution methodologies for the MWU problem are usually based on a two-step approach, where routing and wavelength assignment are done independently. Though this approach can reduce computational cost, the optimality of the solution is compromised. We propose a novel tabu search (TS) algorithm, which considers routing and wavelength assignment jointly without increasing the computational complexity. The performance of the proposed TS algorithm is compared with the Integer Linear Programming (ILP) method, which is known to solve the MWU to optimality. The results for both small and large networks show that our proposed TS algorithm works almost as well as the ILP solution and is much more computationally efficient. Published version 2010-08-17T07:34:55Z 2019-12-06T17:53:31Z 2010-08-17T07:34:55Z 2019-12-06T17:53:31Z 2005 2005 Journal Article Wang, Y., Cheng, T. H., & Lim, M. H. (2005). A tabu search algorithm for static routing and wavelength assignment problem. IEEE Communications Letters. 9(9), 841-843. 1089-7798 https://hdl.handle.net/10356/90761 http://hdl.handle.net/10220/6312 10.1109/LCOMM.2005.1506721 en IEEE communications letters © 2005 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. http://www.ieee.org/portal/site This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. 3 p. application/pdf
institution Nanyang Technological University
building NTU Library
country Singapore
collection DR-NTU
language English
topic DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems
spellingShingle DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems
Wang, Ying
Cheng, Tee Hiang
Lim, Meng-Hiot
A tabu search algorithm for static routing and wavelength assignment problem
description Static routing and wavelength assignment (RWA) is usually formulated as an optimization problem with the objective of minimizing wavelength usage (MWU). Existing solution methodologies for the MWU problem are usually based on a two-step approach, where routing and wavelength assignment are done independently. Though this approach can reduce computational cost, the optimality of the solution is compromised. We propose a novel tabu search (TS) algorithm, which considers routing and wavelength assignment jointly without increasing the computational complexity. The performance of the proposed TS algorithm is compared with the Integer Linear Programming (ILP) method, which is known to solve the MWU to optimality. The results for both small and large networks show that our proposed TS algorithm works almost as well as the ILP solution and is much more computationally efficient.
author2 School of Electrical and Electronic Engineering
author_facet School of Electrical and Electronic Engineering
Wang, Ying
Cheng, Tee Hiang
Lim, Meng-Hiot
format Article
author Wang, Ying
Cheng, Tee Hiang
Lim, Meng-Hiot
author_sort Wang, Ying
title A tabu search algorithm for static routing and wavelength assignment problem
title_short A tabu search algorithm for static routing and wavelength assignment problem
title_full A tabu search algorithm for static routing and wavelength assignment problem
title_fullStr A tabu search algorithm for static routing and wavelength assignment problem
title_full_unstemmed A tabu search algorithm for static routing and wavelength assignment problem
title_sort tabu search algorithm for static routing and wavelength assignment problem
publishDate 2010
url https://hdl.handle.net/10356/90761
http://hdl.handle.net/10220/6312
_version_ 1681039213324140544