A Comparison of Decoding Strategies for the 0/1 Multi-objective Unit Commitment Problem

In the single objective Unit Commitment Problem (UCP) the problem is usually separated in two sub-problems : the commitment problem which aims to fix the on/off scheduling of each unit and the dispatching problem which goal is to schedule the production of each turned on unit. The dispatching problem is a continuous convex problem that can easily…

Lire...