A memory simulated annealing method to the unit commitment problem with ramp constraints

DOI10.1007/S13369-012-0217-2zbMATH Open1296.90140OpenAlexW2083561835MaRDI QIDQ458440FDOQ458440

Authors: S. Arif, R. D. Mohammedi, A. Hellal, A. Choucha 

Publication date: 7 October 2014

Published in: Arabian Journal for Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13369-012-0217-2

Recommendations

• Evolutionary Computation in Combinatorial Optimization
• Solving unit commitment problem using modified subgradient method combined with simulated annealing algorithm
• Using GRASP to solve the unit commitment problem
• A modified differential evolution algorithm for the solution of a large-scale unit commitment problem
• VNS based heuristic for solving the unit commitment problem

zbMATH Keywords

simulated annealingmetaheuristicstabu Listunit commitment problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Short-Term Scheduling of Thermal-Electric Generators Using Lagrangian Relaxation
• A floating-point genetic algorithm for solving the unit commitment problem
• Using GRASP to solve the unit commitment problem

Cited In (5)

• A modified differential evolution algorithm for the solution of a large-scale unit commitment problem
• A model predictive control approach to combined heat and power dynamic economic dispatch problem
• Using GRASP to solve the unit commitment problem
• Solving unit commitment problem using modified subgradient method combined with simulated annealing algorithm
• Evolutionary Computation in Combinatorial Optimization

This page was built for publication: A memory simulated annealing method to the unit commitment problem with ramp constraints

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