VNS based heuristic for solving the Unit Commitment problem

DOI10.1016/j.endm.2012.10.021zbMath1268.90163OpenAlexW1967071803MaRDI QIDQ2840767

Igor Crévits, Saïd Hanafi, Marko Mladenović, Raca Todosijević

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2012.10.021

zbMATH Keywords

VNSunit commitment problemlambda iteration method

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items (2)

Variable neighborhood search: basics and variants ⋮ An Application of Binary Grey Wolf Optimizer (BGWO) Variants for Unit Commitment Problem

Cites Work

• Variable neighbourhood search: methods and applications
• Variable neighborhood search

This page was built for publication: VNS based heuristic for solving the Unit Commitment problem