Unit Commitment Optimization Based on Hybrid Crisscross Optimization Algorithm

Ma Liu-yang; Meng An-bo; Yin Hao

doi:10.12052/gdutxb.160161

English Version Journal Login

您当前的位置：

首页 >

文章列表页 >

Unit Commitment Optimization Based on Hybrid Crisscross Optimization Algorithm

更新时间：2026-05-27

- Unit Commitment Optimization Based on Hybrid Crisscross Optimization Algorithm
- Vol. 34, Issue 6, Pages: 68-72(2017)
- 作者机构：
  
  广东工业大学　自动化学院,广东,广州,510006
- 作者简介：
- 基金信息：
- DOI：10.12052/gdutxb.160161
  CLC： TM734
- Published：2017
- 稿件说明：
移动端阅览
马留洋, 孟安波, 殷豪. 基于混合纵横交叉算法的机组组合优化[J]. 广东工业大学学报, 2017, 34(6): 68-72.

Ma Liu-yang, Meng An-bo, Yin Hao. Unit Commitment Optimization Based on Hybrid Crisscross Optimization Algorithm[J]. 2017, 34(6): 68-72.
马留洋, 孟安波, 殷豪. 基于混合纵横交叉算法的机组组合优化[J]. 广东工业大学学报, 2017, 34(6): 68-72. DOI： 10.12052/gdutxb.160161.

Ma Liu-yang, Meng An-bo, Yin Hao. Unit Commitment Optimization Based on Hybrid Crisscross Optimization Algorithm[J]. 2017, 34(6): 68-72. DOI： 10.12052/gdutxb.160161.

摘要

针对机组组合问题的特点

提出一种混合纵横交叉算法(crisscross optimization

CSO)

分别用离散CSO和连续CSO优化机组的启停状态和机组的功率分配. 进化过程中

通过横向交叉在不同粒子的相同维进行交叉保证算法的全局收敛能力

纵向交叉在相同粒子的不同维进行交叉克服局部最优问题

两者通过一个竞争算子完美地结合

既加快了收敛速度

又能保证全局收敛能力. 引入启发式策略修正最小开停机时间、功率平衡等约束条件

有效地提高了求解的精度. 通过2个算例的仿真以及与其他算法的比较

验证了该算法的可行性和优越性.

Abstract

With regard to the characteristics of the unit commitment problem

a hybrid crisscross optimization algorithm (CSO) is proposed

discrete CSO and continuous CSO are used for the unit status scheduling and power economic dispatch

respectively. In the process of evolution

horizontal crossover performs crossover on the same dimension of different particles to guarantee the global convergence ability

and vertical crossover performs crossover on different dimensions of the same particle to overcome the local optimal convergence

and the perfect combination of the two crossovers by a competitive algorithm not only speeds up the convergence rate but also ensures the ability of the global constraints. The heuristic strategy is introduced to modify the constraint conditions

such as the minimum up and down time and the power balance

which can effectively improve the accuracy of the solution. The feasibility and superiority of the proposed algorithm are verified by the simulation of two examples and the comparison with other algorithms.

关键词

Keywords

references

SENJYU T, SHIMABUKURO K, UEZATO K, et al . A fast technique for unit commitment problem by extended priority list [J ] . IEEE Transactions on Power Systems, 2003, 18(2): 882-888.

BAI X M, YU E K. Optimization for unit commitment of electric power system by dynamic programming [J]. Proceedings of the CSEE, 1984, 4(1): 13-21.

HAN X S, LIU Z. Optimal unit commitment considering unit's ramp-rate limits [J]. Power System Technology, 1994, 18(06): 11-16.

DATTA D. Unit commitment problem with ramp rate constraint using a binary-real-coded genetic algorithm [J]. Applied Soft Computing, 2013, 13(9): 3873-3883.

CAI C H, CAI Y Y. Optimization of units commitment by genetic algorithm [J]. Power System Technology, 1997, 21(1): 44-47.

周俊. 机会约束规划下含风电场的机组组合优化[D]. 广州: 广东工业大学自动化学院, 2014.

DATTA D, DUTTA S. A binary-real-coded differential evolution for unit commitment problem [J]. International Journal of Electrical Power Energy Systems, 2012, 42(1): 517-524.

ZHANG J, LIU Q T, SHU P, et al . Unit commitment optimization based on genetic algorithm and particle swarm optimization hybrid algorithm [J ] . Power System Protection and Control, 2009, 37(9): 25-29.

TRIVEDI A, SRINIVASAN D, BISWAS S, et al . A genetic algorithm-differential evolution based hybrid framework: Case study on unit commitment scheduling problem [J ] . Information Sciences, 2016, 354: 275-300.

CHEN J H, LIANG L L, DING L J, et al . Unit commitment optimization based on chance-constrained programming in wind power integrated system [J ] . Journal of Guangdong University of Technology, 2017, 34(1): 50-54.

YUAN X, JI B, ZHANG S, et al . A new approach for unit commitment problem via binary gravitational search algorithm [J ] . Applied Soft Computing, 2014, 22(5): 249-260.

MORADI S, KHANMOHAMMA S, HAGH M T, et al . A semi-analytical non-iterative primary approach based on priority list to solve unit commitment problem [J ] . Energy, 2015, 88: 244-259.

LI Z, TAN W, QIN J L. An improved dual particle swarm optimization algorithm for unit commitment problem [J]. Proceedings of the CSEE, 2012, 32(25): 189-195.

CHEN H L, GUO R P. Unit commitment based on improved discrete particle swarm optimization [J]. Power System Technology, 2011, 35(12): 94-99.

MENG A, CHEN Y, YIN H, et al . Crisscross optimization algorithm and its application [J ] . Knowledge-based Systems, 2014, 67(4): 218-229.

WU J H, WU Y W, XIONG X Y. Optimization of unit commitment by improved Hopfield neural network algorithm [J]. Automation of Electric Power Systems, 2003, 27(7): 41-44.

YUAN X, NIE H, SU A, et al . An improved binary particle swarm optimization for unit commitment problem [J ] . Expert Systems with Applications, 2009, 36(4): 8049-8055.

JEONG Y, PARK J, SHIN J, et al . A thermal unit commitment approach using an improved quantum evolutionary algorithm [J ] . Electric Power Components Systems, 2009, 37(7): 770-786.

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Unit Commitment Considering Large-scale Integration of Electric Vehicles

An Optimal Operation Strategy for Community Microgrid Alliances Considering Power Exchange under Multi-package Shared Energy Storage Model

The Cross-twin Physics-informed Neural Network for Wave Equations with Conserved Quantities

SCA-YOLO: Real-time Target Detection Based on Deformable Convolution and Context-aware Attention

Research and Implementation of a Pulsed Laser Ranging Method Based on Digital Mixing

Related Author

Chen Jing-hua

Ding Lin-jun

Guo Zhuang-zhi

Liang Li-li

Li Jin-bei

Related Institution

No data

AI问答

⁰