Solving unit commitment problem using modified subgradient method combined with simulated annealing algorithm

DOI10.1155/2010/295645zbMath1198.90179OpenAlexW2067886362WikidataQ58652993 ScholiaQ58652993MaRDI QIDQ1958814

Mehmet Kurban, Ümmühan Başaran Filik

Publication date: 30 September 2010

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/225338

zbMATH Keywords

Lagrangian relaxationsimulated annealingpenalty function methodpower systemmodified subgradient methodUC schedule

Mathematics Subject Classification ID

Derivative-free methods and methods using generalized derivatives (90C56) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Stochastic optimization for network-constrained power system scheduling problem

Uses Software

• GAMS

Cites Work

• Unnamed Item
• Unnamed Item
• A comparative study of three different mathematical methods for solving the unit commitment problem
• On augmented Lagrangians for optimization problems with a single constraint
• Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
• Multiperiod hydrothermal economic dispatch by an interior point method
• Variational Analysis
• Strictly Increasing Positively Homogeneous Functions with Application to Exact Penalization
• Nonlinear Programming

This page was built for publication: Solving unit commitment problem using modified subgradient method combined with simulated annealing algorithm