Modern energy system are evolving due to the opportunities and challenges that new technologies pose in the energy sector. These changes create the requirements of decision tools able to effectively sustain the processes of design and retrofit of energy systems. In this paper a multi-energy system management problem is taken into account and a mixed integer linear programming (MILP) formulation is proposed to model both the design and the resource scheduling of energy districts. However, since the size of the formulation restricts its applicability to small cases far from the application of interest, a matheuristic based on constraint relaxations and variable fixing has been designed. Preliminary computational results show that the proposed solution strategy is able to achieve good solutions (i.e., solutions with small optimality gaps) on restricted random instances, and to solve in reasonable times instances derived from a real case study.
A Matheuristic Approach for Resource Scheduling and Design of a Multi-energy System / Bartolini, Andrea; Comodi, Gabriele; Marinelli, Fabrizio; Pizzuti, Andrea; Rosetti, Roberto. - ELETTRONICO. - (2019), pp. 451-458. (Intervento presentato al convegno ICORES - 8th International Conference on Operations Research and Enterprise Systems tenutosi a Prague, CZECH REPUBLIC nel 19 - 21 February 2019) [10.5220/0007574104510458].
A Matheuristic Approach for Resource Scheduling and Design of a Multi-energy System
Andrea Bartolini;Gabriele Comodi;Fabrizio Marinelli;Andrea Pizzuti;Roberto Rosetti
2019-01-01
Abstract
Modern energy system are evolving due to the opportunities and challenges that new technologies pose in the energy sector. These changes create the requirements of decision tools able to effectively sustain the processes of design and retrofit of energy systems. In this paper a multi-energy system management problem is taken into account and a mixed integer linear programming (MILP) formulation is proposed to model both the design and the resource scheduling of energy districts. However, since the size of the formulation restricts its applicability to small cases far from the application of interest, a matheuristic based on constraint relaxations and variable fixing has been designed. Preliminary computational results show that the proposed solution strategy is able to achieve good solutions (i.e., solutions with small optimality gaps) on restricted random instances, and to solve in reasonable times instances derived from a real case study.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.