A mixed integer approach for time-dependent gas network optimization

被引:35
|
作者
Mahlke, D. [1 ]
Martin, A. [1 ]
Moritz, S. [1 ]
机构
[1] Tech Univ Darmstadt, FG Optimizat, D-64289 Darmstadt, Germany
来源
OPTIMIZATION METHODS & SOFTWARE | 2010年 / 25卷 / 04期
关键词
mixed integer programming; transient gas optimization; piece-wise linear approximation; SOS condition; branch-and-cut; SIMULATED ANNEALING ALGORITHM; SPECIAL ORDERED SETS; GLOBAL OPTIMIZATION; UNIT COMMITMENT; VARIABLES; MODELS;
D O I
10.1080/10556780903270886
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
A gas network consists of pipes to transport the gas from the suppliers to the consumers. Due to friction with the pipe walls, gas pressure gets lost. Compressors compensate this pressure loss at the cost of consuming fuel gas. The aim of gas network optimization is to minimize the fuel gas consumption of the compressors in such a way that the contracts with consumers and suppliers are fulfilled. This problem leads to a very complex mixed integer nonlinear optimization problem. We present a linear approach which concentrates on time-dependent and discrete aspects. The nonlinearities are approximated by piece-wise linear functions using the concept of SOS constraints. We develop a branch-and-cut algorithm which has the potential to guarantee global optimality of the linearized problem where the nonlinearities are approximated within a given accuracy. We include an adequate handling of the SOS conditions and a separation algorithm for switching processes of compressors. A simulated annealing algorithm is included yielding feasible solutions. Our computational results show the success of our approach in this challenging field of gas network optimization.
引用
收藏
页码:625 / 644
页数:20
相关论文
共 50 条
  • [1] Mixed integer models for the stationary case of gas network optimization
    Martin, A
    Möller, M
    Moritz, S
    MATHEMATICAL PROGRAMMING, 2006, 105 (2-3) : 563 - 582
  • [2] Mixed Integer Models for the Stationary Case of Gas Network Optimization
    Alexander Martin
    Markus Möller
    Susanne Moritz
    Mathematical Programming, 2006, 105 : 563 - 582
  • [3] An integer programming approach for the Chinese postman problem with time-dependent travel time
    Sun, Jinghao
    Meng, Yakun
    Tan, Guozhen
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2015, 29 (03) : 565 - 588
  • [4] An integer programming approach for the Chinese postman problem with time-dependent travel time
    Jinghao Sun
    Yakun Meng
    Guozhen Tan
    Journal of Combinatorial Optimization, 2015, 29 : 565 - 588
  • [5] An integer programming approach for the time-dependent traveling salesman problem with time windows
    Montero, Agustin
    Mendez-Diaz, Isabel
    Jose Miranda-Bront, Juan
    COMPUTERS & OPERATIONS RESEARCH, 2017, 88 : 280 - 289
  • [6] Mixed-Integer Programming for a New Time-Dependent Lane Reservation Problem
    Xu, Xiaoxuan
    Wu, Peng
    Fang, Yunfei
    2022 IEEE 7TH INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION ENGINEERING, ICITE, 2022, : 609 - 613
  • [7] OPTIMIZATION ALGORITHM FOR THE TIME-DEPENDENT VEHICLE ROUTING PROBLEM WITH SOFTTIME WINDOWS: A RESEARCH BASED ON MIXED INTEGER MODEL AND MIXED TABU SEARCH
    Liao, Xiongxiong
    Shao, Yongyun
    MATHEMATICAL FOUNDATIONS OF COMPUTING, 2024,
  • [8] Bus Network Optimization with a Time-Dependent Hybrid Algorithm
    Olivera, Ana C.
    Frutos, Mariano
    Carballido, Jessica A.
    Brignole, Nelida B.
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2008, 14 (15) : 2512 - 2531
  • [9] Time-dependent combined network design and routing optimization
    Papadimitriou, Dimitri
    Fortz, Bernard
    2014 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2014, : 1124 - 1130
  • [10] Probabilistic maximization of time-dependent capacities in a gas network
    Heitsch, Holger
    Henrion, Rene
    Tischendorf, Caren
    OPTIMIZATION AND ENGINEERING, 2024, : 365 - 400