摘要
传统配网应急发电车协同调度方法直接对路径编码,未计算应急发电车调度最短路径,调度效率低。本文基于改进遗传算法,研究配网应急发电车协同调度。计算应急发电车调度最短路径,以缩短区域内分配距离,根据得出的最短路径进行函数编码,结合当天的分配距离计算其适应度,实现配网应急发电车协同调度。
The traditional collaborative scheduling method for emergency head end power car in distribution networks directly encodes the path without calculating the shortest path for emergency head end power car scheduling,resulting in low scheduling efficiency.This papper is based on an improved genetic algorithm to study the collaborative scheduling of emergency head end power car in distribution networks.Calculate the shortest path for emergency head end power car scheduling to shorten the distribution distance within the region.Based on the obtained shortest path,encode the function,and combined with the distribution distance of the day to calculate its fitness,achieving collaborative scheduling of emergency head end power car in the distribution network.
作者
苏鹏
秦学占
SU Peng;QIN Xuezhan(Jizhou Power Supply Branch,State Grid Tianjin Electric Power Company,Tianjin 301900,China)
出处
《自动化应用》
2023年第24期53-55,共3页
Automation Application
关键词
改进遗传算法
应急发电车
协同调度
improved genetic algorithm
emergency head end power car
coordinated dispatching
