A Combinatorial Optimization Approach to Solve the Synchronous Optical Network (SONET) Problem

Synchronous Optical Network (SONET) is a network with a fast service capability. Most of businesses that deal with finance are will-ing to pay high rates of money just to get reliable continuous connections. The problem is one of assigning each customer to a ring without violating the capacity constraints. The goal is to minimize the size of each ring without sacrificing each customer demands. This paper is to introduce a new effective mathematical approach to optimize the SONET network. The main idea is to transform SONET problem formulation to the capacitated vehicle routing problem.