A floating-point genetic algorithm for solving the unit commitment problem

DOI10.1016/J.EJOR.2005.10.071MaRDI QIDQ877631zbMATH OpenOpenAlexFDO

Authors Chuangyin Dang, Minqiang Li

Publication date 3 May 2007

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2005.10.071

zbMATH Keywords

unit commitmentelectrical power generationdynamic genetic strategyfloating-point genetic algorithmgenerators scheduling and economic dispatch

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Unit commitment by a genetic algorithm
• An intelligent computing technique based on a dynamic-size subpopulations for unit commitment problem
• Unit commitment and economic dispatch using genetic algorithm
• An application of genetic and evolutive algorithms to unit commitment problem
• A solution to the optimal power flow using genetic algorithm

Cites work

• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 867338 (Why is no real title available?)
• scientific article; zbMATH DE number 960162 (Why is no real title available?)
• A hybrid neural network and simulated annealing approach to the unit commitment problem
• Short-Term Scheduling of Thermal-Electric Generators Using Lagrangian Relaxation
• Unit commitment in power generation -- a basic model and some extensions

Cited in

(11)

• An intelligent computing technique based on a dynamic-size subpopulations for unit commitment problem
• Unit commitment scheduling using binary differential evolution algorithm
• Unit commitment and economic dispatch using genetic algorithm
• A modified differential evolution algorithm for the solution of a large-scale unit commitment problem
• A hybrid biased random key genetic algorithm approach for the unit commitment problem
• A memory simulated annealing method to the unit commitment problem with ramp constraints
• A polynomial-time algorithm with tight error bounds for single-period unit commitment problem
• Unit commitment by a genetic algorithm
• An application of genetic and evolutive algorithms to unit commitment problem
• Two-stage network constrained robust unit commitment problem
• A strengthened mixed-integer linear programming formulation for combined-cycle units

Describes a project that uses

Uses Software

• Genocop

This page was built for publication: A floating-point genetic algorithm for solving the unit commitment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877631)