Supplies transportation planning in power grid urgent repair based on hierarchical genetic algorithm
J Zhou1,2 , W Q Ma3 and J Y Miao4
COMPUTER MODELLING & NEW TECHNOLOGIES 2014 18(1) 25-30
1 School of Control and Computer Engineering, North China Electric Power University, Beijing 102206, China
2 School of Economics and Management, North China Electric Power University, Beijing 102206, China
3 Department of Information Technology, Shanxi Yangquan Electric Power Corporation, Yangquan 045000, China
4 Huada Tianyuan (Beijing) Electric Power Technology CO., LTD, Beijing 102206, China,
To optimize supplies transportation solutions of power grid, a hierarchical genetic algorithm is put forward. Double hierarchical objective function is set by weighting, that is, when the precondition of inequality constraint is met, objective solution is to find out the shortest supply time and if the solution is also within the time constraint, the final solution would be the least supply cost, otherwise, it would still be the shortest supply time. The solution for optimal supplies transportation scheme at the least cost would be worked out by iteration of genetic algorithm. Compared with single objective genetic algorithm in simulation, hierarchical genetic algorithm is proved more effective and superior to decrease economic loss of accidents.