Operation cost reduction in unit commitment problem using improved quantum binary PSO algorithm
TL;DR: The results show the improvement in an operation cost reduction after using the proposed algorithm compared with the ordinary Quantum Binary Particle Swarm Optimization (QBPSO) algorithm.
read more
Abstract: Unit Commitment (UC) is a nonlinear mixed integer-programming problem. UC is used to minimize the operational cost of the generation units in a power system by scheduling some of generators in ON state and the other generators in OFF state according to the total power outputs of generation units, load demand and the constraints of power system. This paper proposes an Improved Quantum Binary Particle Swarm Optimization (IQBPSO) algorithm. The tests have been made on a 10-units simulation system and the results show the improvement in an operation cost reduction after using the proposed algorithm compared with the ordinary Quantum Binary Particle Swarm Optimization (QBPSO) algorithm.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A new "doctor and patient" optimization algorithm: An application to energy commitment problem
Mohammad Javad Dehghani,Mohammad Mardaneh,Josep M. Guerrero,Om P. Malik,Ricardo A. Ramirez-Mendoza,Jose Matas,Juan C. Vasquez,Lizeth Parra-Arroyo +7 more
TL;DR: The authors present a new optimization algorithm named doctor and patient optimization (DPO), designed by simulating the process of treating patients by a physician, which is successfully applied to solve the energy commitment problem for a power system supplied by a multiple energy carriers system.
56
Different Transfer Functions for Binary Particle Swarm Optimization with a New Encoding Scheme for Discounted {0-1} Knapsack Problem
TL;DR: The experience results show that the proposed algorithms outperform the previous algorithms named FirEGA and SecEGA and represent a potential approach for solving the discounted {0-1} knapsack problem.
An optimal allocation of UPFC and transient stability improvement of an electrical power system: IEEE-30 buses
TL;DR: This study has focused on the functions of the UPFC electrical system with corresponding effects on transient stability and showed the effectiveness of UPFC with fast response and autonomous command on the flow of power components.
Neuro-swarm computational heuristic for solving a nonlinear second-order coupled Emden–Fowler model
TL;DR: In this paper , the authors presented the numerical solutions of a nonlinear second-order coupled Emden-Fowler equation by developing a neuro-swarming-based computing intelligent solver.
Novel sustainable urban management framework based on solar energy and digital twin
J. L. Xu,Jian Gong +1 more
TL;DR: A novel sustainable urban management framework based on solar energy and digital twin optimizes energy management for microgrids in the urban area by integrating renewable energy and energy storage systems. The framework uses a pigeon-inspired optimization algorithm to manage power costs effectively and compares the outcomes with other methods.
6
References
Quantum-inspired evolutionary algorithm for a class of combinatorial optimization
Kuk-Hyun Han,Jong-Hwan Kim +1 more
TL;DR: The results show that QEA performs well, even with a small population, without premature convergence as compared to the conventional genetic algorithm, and a Q-gate is introduced as a variation operator to drive the individuals toward better solutions.
1.5K
Dynamic Programming Approach to Unit Commitment
TL;DR: In this paper, a dynamic programming formulation of the unit commitment problem is presented, which features the classification of generating units into related groups so as to minimize the number of unit combinations which must be tested without precluding the optimal path.
528
Towards a more rigorous and practical unit commitment by Lagrangian relaxation
F. Zhuang,Francisco D. Galiana +1 more
TL;DR: A mathematically based, systematic and generally applicable procedure to search for a reserve-feasible dual solution for power system generator unit commitment, giving reliable performance and low execution times.
499
Unit Commitment by an Enhanced Simulated Annealing Algorithm
D.N. Simopoulos,S.D. Kavatza,Costas Vournas +2 more
- 01 Oct 2006
TL;DR: In this paper, a new simulated annealing (SA) algorithm combined with a dynamic economic dispatch method is developed for solving the short-term unit commitment (UC) problem.
286
A New Quantum-Inspired Binary PSO: Application to Unit Commitment Problems for Power Systems
TL;DR: The proposed QBPSO combines the conventional BPSO with the concept and principles of quantum computing such as a quantum bit and superposition of states and is applied to unit commitment (UC) problems for power systems which are composed of up to 100-units with 24-h demand horizon.