WDM 환형 망에서 경의 실정 및 파장 할당 문제의 새로운 모형

A New Model of a Routing and Wavelength Assignment Problem on WDM Ring Networks

We consider a routing and wavelength assignment (RWA) problem on wavelength division multiplexing (WDM) ring networks, which is to maximize the established connections between nodes, given a set of usable wavelengths. We propose two new mathematical formulations of it and efficient algorithms based on branch-and-price method. Computational experiments on random instances show that cue of the proposed formulations yields optimal solutions in much shorter time on the average than the previous formulation due to Lee (1998).