Dual-mode Routing Scheduling Strategy Based on Plant Growth Bionic Algorithm for Power System Communication Networks

With the rapid development of the new power system, users tend to diversify the form of service demand, and at the same time, the voice communication system for power dispatching puts forward the requirements of more diverse services and richer scenarios, while the existing circuit-switching-based programmed scheduling mechanism is difficult to meet the above requirements. Therefore, this paper proposes a bimodal routing scheduling strategy based on subgradient hyperplane mapping. Considering the service mapping cost and mapping revenue of electric power voice services in the programmed switching network and packet switching network respectively, we construct the bimodal scheduling problem to maximise the service mapping return. The subgradient algorithm and the simulated plant growth algorithm are used to solve the bimodal scheduling problem. The experimental results show that the method has a more obvious effect on the scheduling of power voice services.

Authors

Institutions

Publication Details

Published
2024-12-06
DOI
https://doi.org/10.1109/icips64173.2024.10900253
Primary Topic
Power Systems and Technologies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dual-mode Routing Scheduling Strategy Based on Plant Growth Bionic Algorithm for Power System Communication Networks

Shanshan Lu, Ping Zhang, Haibo Sun, Li Li et al.
Power Systems and Technologies
article

Dual-mode Routing Scheduling Strategy Based on Plant Growth Bionic Algorithm for Power System Communication Networks

Shanshan Lu, Ping Zhang, Haibo Sun, Li Li, Hui Jia
article en

Abstract

With the rapid development of the new power system, users tend to diversify the form of service demand, and at the same time, the voice communication system for power dispatching puts forward the requirements of more diverse services and richer scenarios, while the existing circuit-switching-based programmed scheduling mechanism is difficult to meet the above requirements. Therefore, this paper proposes a bimodal routing scheduling strategy based on subgradient hyperplane mapping. Considering the service mapping cost and mapping revenue of electric power voice services in the programmed switching network and packet switching network respectively, we construct the bimodal scheduling problem to maximise the service mapping return. The subgradient algorithm and the simulated plant growth algorithm are used to solve the bimodal scheduling problem. The experimental results show that the method has a more obvious effect on the scheduling of power voice services.

North China Electric Power University (CN), Economic Research Institute (BG)
Openalex Percentile: Top 74%
Power Systems and Technologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.