• DocumentCode
    3253721
  • Title

    Improved PSO Algorithm to Solve Restoration Capacity Problem on ASON

  • Author

    Jun, Xu ; Chang Huiyou

  • Author_Institution
    Sch. of Inf. Sci. & Technol., Sun Yat-Sen Univ., Guangzhou, China
  • fYear
    2009
  • fDate
    14-16 Aug. 2009
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    In order to solve the NP-completely nonlinear programming of ASON (Automatic Switch Optical Network) restoration capacity planning, the corresponding mathematical model is established and a new optimization method based on improved particle swarm optimization algorithm (IPSO) is proposed in this paper. The major advantages of the new approach are a polynomial time complexity and the capability of incorporating nonlinear variables such as nonlinear cost functions into the solution algorithm, which facilitates the application of algorithm on projects. Numerical results illustrating the form of the improved particle swarm optimization algorithm solution and comparing the proposed methodology to existing techniques from the literature are presented. At last, analysis results show that the algorithm is highly practical.
  • Keywords
    nonlinear programming; optical communication; particle swarm optimisation; telecommunication network planning; NP-completely nonlinear programming; automatic switch optical network; particle swarm optimization; restoration capacity planning; Automatic programming; Capacity planning; Cost function; Mathematical model; Mathematical programming; Optical fiber networks; Optical switches; Optimization methods; Particle swarm optimization; Polynomials;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Photonics and Optoelectronics, 2009. SOPO 2009. Symposium on
  • Conference_Location
    Wuhan
  • Print_ISBN
    978-1-4244-4412-0
  • Type

    conf

  • DOI
    10.1109/SOPO.2009.5230242
  • Filename
    5230242