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

  • Mamoon Alameen Department of Mathematics, The Australian College of Kuwait;
  • Sadeq Damrah Department of Mathematics, The Australian College of Kuwait;
  • Mohammad Abdul-Niby 2Department of Electronic Engineering, The Australian College of Kuwait;
  • Sadeq Damrah 2Department of Electronic Engineering, The Australian College of Kuwait;
Keywords: Branch and Cut, Capacitated Vehicle Routing Problem, Clarke and Wright, SONET

Abstract

Synchronous Optical Network (SONET) is a network with a fast service capability. Most of businesses that deal with finance are willing
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.

Published
2020-07-11
How to Cite
Mamoon Alameen, Sadeq Damrah, Mohammad Abdul-Niby, & Sadeq Damrah. (2020). A Combinatorial Optimization Approach to Solve the Synchronous Optical Network (SONET) Problem. Global Journal of Enterprise Information System, 6(2), 9-11. Retrieved from https://gjeis.com/index.php/GJEIS/article/view/456
Issue
Vol. 6 No. 2 (2014): Information System bringing Demographic Change through Optimization
Section
Empirical Research Papers

Share |