A hybrid biased random key genetic algorithm approach for the unit commitment problem

DOI10.1007/S10878-014-9710-8MaRDI QIDQ405676zbMATH OpenOpenAlexFDO

Authors L. A. C. Roque, Dalila B. M. M. Fontes, Fernando Fontes

Publication date 5 September 2014

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL http://repositorio.inesctec.pt/handle/123456789/3719

zbMATH Keywords

genetic algorithmshybrid metaheuristicsunit commitmentelectrical power generation

Mathematics Subject Classification ID

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

Recommendations

• Unit commitment by a genetic algorithm
• A new heuristic approach for unit commitment problem using particle swarm optimization
• Solving unit commitment problem using hybrid particle swarm optimization
• Unit commitment and economic dispatch using genetic algorithm
• A modified differential evolution algorithm for the solution of a large-scale unit commitment problem

Cites work

• scientific article; zbMATH DE number 1488569 (Why is no real title available?)
• A floating-point genetic algorithm for solving the unit commitment problem
• A genetic algorithm for a single product network design model with lead time and safety stock considerations
• A genetic algorithm for the resource constrained multi-project scheduling problem
• A genetic algorithm for the weight setting problem in OSPF routing
• A variant of the dynamic programming algorithm for unit commitment of combined heat and power systems
• An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems
• Competent genetic algorithms for weighing matrices
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Handbook of Power Systems I
• Handbook of power systems. II
• Heuristic solutions for general concave minimum cost network flow problems
• Optimal scheduling of thermal generating units
• Optimization in the Energy Industry
• Short-Term Scheduling of Thermal-Electric Generators Using Lagrangian Relaxation
• Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints

Cited in

(9)

• A modified differential evolution algorithm for the solution of a large-scale unit commitment problem
• A Genetic Algorithm for Scheduling Alternative Tasks Subject to Technical Failure
• A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
• Optimizing job shop scheduling with speed-adjustable machines and peak power constraints: a mathematical model and heuristic solutions
• A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation
• Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
• Optimal configuration of power distribution networks with variable renewable energy resources
• Unit commitment by a genetic algorithm
• An application of genetic and evolutive algorithms to unit commitment problem

This page was built for publication: A hybrid biased random key genetic algorithm approach for the unit commitment problem

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