engleski

Application of Heuristic Search Techniques in Solving Wavelength Assignment Problem

Optimal traffic routing in all-optical transport network with wavelength multiplexing transforms to wavelength assignment problem: whilst trying to utilize as few network resources as possible, wavelengths have to be assigned to input set of traffic requirements, presented as a number of required wavelength channels of standard bit rate. Even when applying number of simplifications, it can be shown that the problem is NP-complete. In order to solve the problem, heuristic search techniques have to be applied. The paper presents application and comparison of three modern heuristic techniques, genetic algorithm, simulated annealing and tabu search.

-

nije evidentirano