@inproceedings{AltherrEdererVergeetal.2015,
  author    = {Altherr, Lena and Ederer, Thorsten and Verg{\´e}, Angela and Pelz, Peter F.},
  title     = {Algorithmische Struktursynthese eines hydrostatischen Getriebes},
  series = {Antriebssysteme 2015 : Elektrik, Mechanik, Fluidtechnik in der Anwendung},
  booktitle = {Antriebssysteme 2015 : Elektrik, Mechanik, Fluidtechnik in der Anwendung},
  publisher = {VDI-Verlag},
  address   = {D{\"u}sseldorf},
  isbn      = {978-3-18-092268-3},
  pages     = {145 -- 155},
  year      = {2015},
  language  = {de}
}
@inproceedings{AltherrEdererSchaenzleetal.2017,
  author    = {Altherr, Lena and Ederer, Thorsten and Sch{\"a}nzle, Christian and Lorenz, Ulf and Pelz, Peter F.},
  title     = {Algorithmic system design using scaling and affinity laws},
  series = {Operations Research Proceedings 2015},
  booktitle = {Operations Research Proceedings 2015},
  publisher = {Springer},
  address   = {Cham},
  isbn      = {978-3-319-42901-4},
  doi       = {10.1007/978-3-319-42902-1},
  pages     = {605 -- 611},
  year      = {2017},
  abstract  = {Energy-efficient components do not automatically lead to energy-efficient systems. Technical Operations Research (TOR) shifts the focus from the single component to the system as a whole and finds its optimal topology and operating strategy simultaneously. In previous works, we provided a preselected construction kit of suitable components for the algorithm. This approach may give rise to a combinatorial explosion if the preselection cannot be cut down to a reasonable number by human intuition. To reduce the number of discrete decisions, we integrate laws derived from similarity theory into the optimization model. Since the physical characteristics of a production series are similar, it can be described by affinity and scaling laws. Making use of these laws, our construction kit can be modeled more efficiently: Instead of a preselection of components, it now encompasses whole model ranges. This allows us to significantly increase the number of possible set-ups in our model. In this paper, we present how to embed this new formulation into a mixed-integer program and assess the run time via benchmarks. We present our approach on the example of a ventilation system design problem.},
  language  = {en}
}
@inproceedings{RauschLeiseEdereretal.2016,
  author    = {Rausch, Lea and Leise, Philipp and Ederer, Thorsten and Altherr, Lena and Pelz, Peter F.},
  title     = {A comparison of MILP and MINLP solver performance on the example of a drinking water supply system design problem},
  series = {ECCOMAS Congress 2016 VII European Congress on Computational Methods in Applied Sciences and Engineering},
  booktitle = {ECCOMAS Congress 2016 VII European Congress on Computational Methods in Applied Sciences and Engineering},
  editor    = {Papadrakakis, M. and Ppadopoulos, V. and Stefanou, G. and Plevris, V.},
  isbn      = {978-618-82844-0-1},
  pages     = {8509 -- 8527},
  year      = {2016},
  abstract  = {Finding a good system topology with more than a handful of components is a highly non-trivial task. The system needs to be able to fulfil all expected load cases, but at the same time the components should interact in an energy-efficient way. An example for a system design problem is the layout of the drinking water supply of a residential building. It may be reasonable to choose a design of spatially distributed pumps which are connected by pipes in at least two dimensions. This leads to a large variety of possible system topologies. To solve such problems in a reasonable time frame, the nonlinear technical characteristics must be modelled as simple as possible, while still achieving a sufficiently good representation of reality. The aim of this paper is to compare the speed and reliability of a selection of leading mathematical programming solvers on a set of varying model formulations. This gives us empirical evidence on what combinations of model formulations and solver packages are the means of choice with the current state of the art.},
  language  = {en}
}