Benchmark of mixed-integer linear programming formulations for district heating network design

被引:0
|
作者
Lambert, Jerry [1 ]
Ceruti, Amedeo [1 ]
Spliethoff, Hartmut [1 ]
机构
[1] Tech Univ Munich, Chair Energy Syst, TUM Sch Engn & Design, Boltzmannstr 15, D-85747 Garching, Germany
关键词
Energy system optimization; District heating; Mixed integer linear programming; Benchmark; Computational scaling; DISTRIBUTION COSTS; OPTIMIZATION; OPERATION; MODEL;
D O I
10.1016/j.energy.2024.132885
中图分类号
O414.1 [热力学];
学科分类号
摘要
Optimal routing and investment decisions are key design criteria to reduce the high investment costs of district heating systems. However, these optimization problems have prohibitively high computational costs for large districts. Four different mixed-integer linear optimization frameworks are benchmarked in this study in order to compare their computational scaling. The frameworks exhibit significant differences in solving times for synthetic benchmarks and real-world urban districts of up to 9587 potential edges. The new open-source framework topotherm, developed for this work, exhibits the best computational performance when only one time step is optimized. The comparison between the models R & eacute;simont, DHmin, DHNx, and topotherm shows two main trends. First, fewer integer variables do not necessarily translate to lower solving times, and second, using redundant binary variables, which introduce symmetries into the constraints, leads to higher solving times. None of the considered optimization frameworks is able to solve the largest benchmark problems for five time steps within the allowed time limit and tolerance. These findings highlight the challenges of and pressing need to develop efficient models for simultaneous optimization of district heating network topology, pipe sizing, and operation.
引用
收藏
页数:14
相关论文
共 50 条
  • [31] Strong mixed-integer programming formulations for trained neural networks
    Anderson, Ross
    Huchette, Joey
    Ma, Will
    Tjandraatmadja, Christian
    Vielma, Juan Pablo
    MATHEMATICAL PROGRAMMING, 2020, 183 (1-2) : 3 - 39
  • [32] Δ-MILP: Deep Space Network Scheduling via Mixed-Integer Linear Programming
    Claudet, Thomas
    Alimo, Ryan
    Goh, Edwin
    Johnston, Mark D.
    Madani, Ramtin
    Wilson, Brian
    IEEE ACCESS, 2022, 10 : 41330 - 41340
  • [33] A Mixed-Integer Linear Programming Framework for Optimization of Water Network Operations Problems
    Thomas, Meghna
    Sela, Lina
    WATER RESOURCES RESEARCH, 2024, 60 (02)
  • [34] Irrigation scheduling using mixed-integer linear programming
    Anwar, AA
    Clarke, D
    JOURNAL OF IRRIGATION AND DRAINAGE ENGINEERING, 2001, 127 (02) : 63 - 69
  • [35] Testing cut generators for mixed-integer linear programming
    Margot F.
    Mathematical Programming Computation, 2009, 1 (01) : 69 - 95
  • [36] A Mixed-Integer Linear Programming Model for the Optimal Operation and Design of Residential Neighbourhoods
    Dorneanu, Bogdan
    Sidnell, Tim
    Clarke, Fiona
    Mechleri, Evgenia
    Arellano-Garcia, Harvey
    IFAC PAPERSONLINE, 2019, 52 (01): : 934 - 939
  • [37] A Mixed-Integer Linear Programming Model for the Design of Shale Gas Industrial Parks
    Diaz-Gomez, Julio C.
    Caballero, Jose A.
    Jimenez-Gutierrez, Arturo
    ACS SUSTAINABLE CHEMISTRY & ENGINEERING, 2021, 9 (26) : 8783 - 8796
  • [38] DUAL FORMULATIONS AND SUBGRADIENT OPTIMIZATION STRATEGIES FOR LINEAR-PROGRAMMING RELAXATIONS OF MIXED-INTEGER PROGRAMS
    SHERALI, HD
    MYERS, DC
    DISCRETE APPLIED MATHEMATICS, 1988, 20 (01) : 51 - 68
  • [39] Testing copositivity via mixed-integer linear programming
    Anstreicher, Kurt M.
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2021, 609 : 218 - 230
  • [40] A DC Programming Approach for Mixed-Integer Linear Programs
    Niu, Yi-Shuai
    Dinh, Tao Pham
    MODELLING, COMPUTATION AND OPTIMIZATION IN INFORMATION SYSTEMS AND MANAGEMENT SCIENCES, PROCEEDINGS, 2008, 14 : 244 - 253