This paper presents a mathematical model of coordination and optimization of generator and transmission maintenance in power market. In this model, security and economical efficiency of power system and fairness of power market are taken into account. A hybrid algorithm that takes full advantages of genetic algorithm (GA) and particle swarm optimization (PSO) is applied to solving this model. Population of the hybrid algorithm is divided into two parts that evolve separately using GA and PSO. The optimization information resulted from two algorithms will be exchanged fully to form a new and tight coupled genetic particle swarm optimization (GPSO). The test case verifies that this algorithm has favorable equilibrium on both global and local search in solving large-scale complicated optimization problem such as global generator and transmission maintenance scheduling.
With the rapid expansion of variable renewable energy, coal-fired units are increasingly operated at low load, where non-convex cost characteristics pose challenges for spot market clearing. This study reviews and improves existing low-load generation cost models, introducing three key enhancements: (1) integrating piecewise linearization with the marginal cost approach to reduce computational burden; (2) removing redundant binary variables and incorporating previously omitted cost components to improve clearing efficiency; and (3) developing a fuel cost model that combines quasi-fixed and marginal costs for low-load generation with firing and combustion support (FCS), enabling the joint optimization of low-load and normal operations. Applied to 6-bus and provincial systems, the proposed approach achieves speed-ups of 11.3× and 6.3× over the benchmark model (Model I) while maintaining accuracy, demonstrating both its efficiency and practical applicability.
Distribution maintenance time scheduling is a multi-objects and multi-constrains optimizing problem. To solve this complicated problem, this paper presents an improved genetic algorithm that developed "direct compare algorithm" in constructing fitness function and mutation operator of simple genetic algorithm. By introducing "infeasible area", the improved algorithm allows individuals among the infeasible area compete with their target values. So a part of infeasible individuals with good gene can be reserved and the performance of the optimizing algorithm has been improved. At the same time, the improved algorithm designs a new mutation operator which mutates by tabu searching when the population is multiplex enough and changes its mutates way to uniform automatically when the average population multiplex lower down to a fix degree. The tabu searching mutation operator can speed up constringency of the algorithm and the uniform mutation operator can bring new gene to avoid "premature" of genetic algorithm. The proposed method is applied to a practical system, and numerical results verify the correctness and validity of it.