The full text of this article
A multi-objective dynamic programming-based metaheuristic to solve a bi-objective unit commitment problem using a multi-objective decoder
by Sophie Jacquin; Laetitia Jourdan; El-Ghazali Talbi
International Journal of Metaheuristics (IJMHEUR), Vol. 5, No. 1, 2016
Abstract: The unit commitment problem (UCP) is a heavily constrained scheduling problem, where the on/off scheduling and production amounts of heterogeneous power production units have to be determined for a discrete time horizon. Due to environmental concerns, the traditional UCP to solely minimise the production cost is no longer adequate, and a second objective, to minimise the gas emissions has to be added to properly model reality. In this paper, we propose an efficient metaheuristic to solve this multi-objective version of the UCP. The proposed method, MO-DYNAMOP, is a generalisation of DYNAMOP (DYNAmic programming-based Metaheuristic for Optimisation Problems), a state-of-the-art hybrid optimiser which was successfully applied to the single-objective unit commitment problem. The main difficulty in extending DYNAMOP to the multi-objective UCP is that it uses an indirect representation of solution that gives the on/off scheduling of each unit. The real production amounts are computed by an exact sub-optimiser which minimises the production cost assuming that the on/off scheduling is fixed. Since the sub-optimiser now has to solve a multi-objective problem, each on/off scheduling induces an entire Pareto optimal set of solutions. We handle this complication by assigning an approximation of the corresponding set to each on/off scheduling solution. A comparison study with methods previously proposed in the literature indicates that MO-DYNAMOP performs considerably better on many benchmark instances.
Online publication date: Mon, 12-Sep-2016
is only available to individual subscribers or to users at subscribing institutions.
Go to Inderscience Online Journals to access the Full Text of this article.
Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.
Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Metaheuristics (IJMHEUR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable).
See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org