Routing and wavelength assignment by partition colouring |
| |
| Institution: | 1. College of Business, Embry-Riddle Aeronautical University, 600 S. Clyde Morris Blvd., Daytona Beach, FL 32114, USA;2. Department of Industrial and Systems Engineering, Wayne State University, 4815 Fourth Street, Detroit, MI 48202, USA;1. Federal University of São Carlos, Rodovia João Leme dos Santos (SP-264), Km 110 Bairro do Itinga, Sorocaba, Brazil;2. INESC TEC, Faculdade de Engenharia, Universidade do Porto, Rua Dr. Roberto Frias, 4200-465, Porto, Portugal;1. Department of Supply Chain Management, Rennes School of Business, F-35065 Rennes, France;2. Department of Manufacturing Sciences and Logistics, CMP, Ecole des Mines de Saint-Etienne, CNRS UMR 6158 LIMOS, F-13541 Gardanne, France;3. Department of Accounting, Auditing and Business Analytics, BI Norwegian Business School, 0484 Oslo, Norway;1. University of Ottawa, Ottawa, Ontario, Canada;2. Federal University of Minas Gerais, Belo Horizonte, MG, Brazil;3. Federal University of Para, Belem, PA, Brazil;1. Department of Business Administration and Economics, Bielefeld University, Universitaetsstrasse 25, Bielefeld 33501, Germany;2. College of Business Administration, The University of Alabama in Huntsville, Huntsville, Al 35899, USA;3. 40476 Duesseldorf, Germany |
| |
| Abstract: | The problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, followed by the solution of a partition colouring problem in a conflict graph. A new tabu search heuristic is also proposed for the partition colouring problem, which may be viewed as an extension of the graph colouring problem. Computational experiments are reported, showing that the tabu search heuristic outperforms the best heuristic for partition colouring by approximately 20% in the average and illustrating that the new approach for the problem of routing and wavelength assignment is more robust than a well established heuristic for this problem. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
