A simulated annealing algorithm for transient optimization in gas networks

DOI10.1007/s00186-006-0142-9zbMath1126.90053OpenAlexW2117823573MaRDI QIDQ2466789

Debora Mahlke, Alexander Martin, Susanne Moritz

Publication date: 16 January 2008

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-006-0142-9

zbMATH Keywords

HeuristicsSimulated annealingRelaxationMixed integer nonlinear programmingTransient gas optimization

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

High detail stationary optimization models for gas networks, Validation of nominations in gas network optimization: models, methods, and solutions, Power minimization of gas transmission network in fully transient state using metaheuristic methods, MIP-based instantaneous control of mixed-integer PDE-constrained gas transport problems, Computational optimization of gas compressor stations: MINLP models versus continuous reformulations, Optimization and analysis of the profitability of tariff structures with two-part tariffs, Transient-State Natural Gas Transmission in Gunbarrel Pipeline Networks, Maximizing the storage capacity of gas networks: a global MINLP approach

Uses Software

• SINTEF
• simannf90
• SIMONE

Cites Work

• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Global optimization and simulated annealing
• Mixed integer models for the stationary case of gas network optimization
• A Note on the Finite Time Behavior of Simulated Annealing
• The Gas Transmission Problem Solved by an Extension of the Simplex Algorithm
• Generalized Simulated Annealing for Function Optimization
• Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item