A Mixed-Integer Linear Optimization Model for Local Energy System Planning Based on Simplex and Branch-and-Bound Algorithms

被引:6
|
作者
Ren, Hongbo [1 ]
Zhou, Weisheng [2 ]
Gao, Weijun [3 ]
Wu, Qiong [3 ]
机构
[1] Ritsumeikan Univ, Ritsumeikan Global Innovat Res Org, Kyoto 6038577, Japan
[2] Ritsumeikan Univ, Coll Policy Sci, Kyoto 6038577, Japan
[3] Univ Kitakyushu, Fac Environm Engn, Kitakyushu, Fukuoka 8080135, Japan
关键词
Mixed-integer linear optimization; local energy system; low-carbon society; simplex algorithm; branch-and-bound algorithm;
D O I
10.1007/978-3-642-15621-2_40
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A Mixed-integer linear optimization model is developed to support the decision making for the sustainable use of energy in the local area. It details exploitation of primary energy sources, electrical and thermal generation, end-use sectors and emissions. The model covers both the energy demand and energy supply sides, and can provide valuable information both on the technical options, and on the possible policy measures. By aiming to realize a low-carbon energy system, the proposed optimization process provides feasible generation settlements between utility grid and distributed generations, as well as optimal diffusion of energy efficiency technologies. Moreover, the mathematical methods for solving the developed model are discussed. The focus is paid on the general solution method for mixed-integer linear optimization model including simplex algorithm and branch-and-bound algorithm. By using the suggested solution methods, the local energy system optimization problem is expected to be resolved in a reasonable time with enough precision.
引用
收藏
页码:361 / +
页数:2
相关论文
共 50 条
  • [1] Mitigating Anomalies in Parallel Branch-and-Bound Based Algorithms for Mixed-Integer Nonlinear Optimization
    Palkar, Prashant
    Mahajan, Ashutosh
    COMBINATORIAL OPTIMIZATION (ISCO 2022), 2022, 13526 : 143 - 156
  • [2] Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
    Adelgren, Nathan
    Gupte, Akshay
    INFORMS JOURNAL ON COMPUTING, 2022, 34 (02) : 909 - 933
  • [3] Exact Complexity Certification of Suboptimal Branch-and-Bound Algorithms for Mixed-Integer Linear Programming
    Shoja, Shamisa
    Axehill, Daniel
    IFAC PAPERSONLINE, 2023, 56 (02): : 7428 - 7435
  • [4] Complexity of branch-and-bound and cutting planes in mixed-integer optimization
    Amitabh Basu
    Michele Conforti
    Marco Di Summa
    Hongyi Jiang
    Mathematical Programming, 2023, 198 : 787 - 810
  • [5] Complexity of branch-and-bound and cutting planes in mixed-integer optimization
    Basu, Amitabh
    Conforti, Michele
    Di Summa, Marco
    Jiang, Hongyi
    MATHEMATICAL PROGRAMMING, 2023, 198 (01) : 787 - 810
  • [6] Predicting the Solution Time of Branch-and-Bound Algorithms for Mixed-Integer Programs
    Oezaltin, Osman Y.
    Hunsaker, Brady
    Schaefer, Andrew J.
    INFORMS JOURNAL ON COMPUTING, 2011, 23 (03) : 392 - 403
  • [7] MIXED-INTEGER LINEAR PROGRAMMING - VALIDITY CONDITIONS IN BRANCH-AND-BOUND METHODS
    TERGNY, J
    REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1971, 5 (NV1): : 11 - 21
  • [8] Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization — II
    Amitabh Basu
    Michele Conforti
    Marco Di Summa
    Hongyi Jiang
    Combinatorica, 2022, 42 : 971 - 996
  • [9] Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II
    Basu, Amitabh
    Conforti, Michele
    Di Summa, Marco
    Jiang, Hongyi
    COMBINATORICA, 2022, 42 (SUPPL 1) : 971 - 996
  • [10] Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II
    Basu, Amitabh
    Conforti, Michele
    Di Summa, Marco
    Jiang, Hongyi
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2021, 2021, 12707 : 383 - 398