Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/94373
Title: | A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem | Authors: | Soares, Ines Alves, Maria João Henggeler Antunes, Carlos |
Keywords: | Global optimization; Bi-level optimization; Mixed-integer linear programming mode; Pricing problem; Dynamic tariffs; Electricity retail market; Demand response | Issue Date: | 2021 | Publisher: | Elsevier | Project: | UIDB/05037/2020 POCI-01-0145-FEDER-016434 CENTRO-01-0145-FEDER-000006 POCI-01-0145-FEDER-028040 info:eu-repo/grantAgreement/FCT/6817 - DCRRNI ID/UIDB/00308/2020 |
Serial title, monograph or event: | European Journal of Operational Research | Volume: | 291 | Issue: | 1 | Abstract: | In this paper, a deterministic bounding procedure for the global optimization of a mixed-integer bi-level programming problem is proposed. The aim has been to develop an efficient algorithm to deal with a case study in the electricity retail market. In this problem, an electricity retailer wants to define a timeof-use tariff structure to maximize profits, but he has to take into account the consumers’ reaction by means of re-scheduling appliance operation to minimize costs. The problem has been formulated as a bi-level mixed-integer programming model. The algorithm we propose uses optimal-value-function reformulations based on similar principles as the ones that have been used by other authors, which are adapted to the characteristics of this type of (pricing optimization) problems where no upper (lower) level variables appear in the lower (upper) level constraints. The overall strategy consists of generating a series of convergent upper bounds and lower bounds for the upper-level objective function until the difference between these bounds is below a given threshold. Computational results are presented as well as a comparison with a hybrid approach combining a particle swarm optimization algorithm to deal with the upper-level problem and an exact solver to tackle the lower-level problem, which we have previously developed to address a similar case study. When the lower-level model is difficult, a significant relative MIP gap is unavoidable when solving the algorithm’s subproblems. Novel reformulations of those subproblems using “elastic” variables are proposed trying to obtain meaningful lower/upper bounds within an acceptable computational time. | URI: | https://hdl.handle.net/10316/94373 | ISSN: | 03772217 | DOI: | 10.1016/j.ejor.2020.09.015 | Rights: | openAccess |
Appears in Collections: | I&D CeBER - Artigos em Revistas Internacionais |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
SoaresAlvesAntunes_EJOR2021_AcceptedVersion.pdf | 761.96 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
12
checked on Apr 22, 2024
WEB OF SCIENCETM
Citations
8
checked on May 2, 2024
Page view(s)
179
checked on Oct 9, 2024
Download(s)
117
checked on Oct 9, 2024
Google ScholarTM
Check
Altmetric
Altmetric
This item is licensed under a Creative Commons License