Cable laying path planning based on optimized ant colony algorithm
DOI:
Author:
Affiliation:

1.Economic and Technological Research Institute of State Grid Henan Electric Power Company,Henan Province,Zhengzhou City;2.Shanghai Electric Power University of electrical engineering,Shanghai,Yangpu District

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Aiming at the problems of large error and low efficiency in cable laying based on traditional manual design, the computer-aided design optimized by ant colony algorithm is applied to cable laying path planning. The ant colony algorithm (ACA) is used to solve the shortest path problem of cable laying by taking advantage of the advantages of multi terminal line calculation in complex lines. At the same time, this paper planarizes the cable laying path, and further optimizes it by using Gompertz function from two aspects: pheromone restriction and self-adaptive adjustment of volatilization factor, which improves the convergence speed and global performance of ant colony algorithm. The simulation results show that the optimized ant colony algorithm can quickly get the shortest cable laying path in the process of substation digital three-dimensional cable laying, save the cost of manpower and materials, and improve the design accuracy.

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:January 04,2022
  • Revised:June 01,2022
  • Adopted:June 06,2022
  • Online:
  • Published:

Address:No. 219, Ningliu Road, Nanjing, Jiangsu Province

Postcode:210044

Phone:025-58731025