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
- Shanshan Lu (ORCID: https://orcid.org/0000-0001-7021-044X)
- Ping Zhang (ORCID: https://orcid.org/0000-0002-1485-5849)
- Haibo Sun
- Li Li (ORCID: https://orcid.org/0000-0002-7654-7374)
- Hui Jia (ORCID: https://orcid.org/0000-0002-6444-5426)
Institutions
- North China Electric Power University (CN)
- Economic Research Institute (BG)
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