@article{FuegenschuhFuegenschuh2008,
author = {F{\"u}genschuh, Armin and F{\"u}genschuh, Marzena},
title = {Integer Linear Programming Models for Topology Optimization in Sheet Metal Design},
series = {Mathematical Methods of Operations Research},
volume = {68},
journal = {Mathematical Methods of Operations Research},
number = {2},
pages = {313 -- 331},
year = {2008},
language = {en}
}
@misc{FrankFuegenschuhHertyetal.,
author = {Frank, Martin and F{\"u}genschuh, Armin and Herty, Michael and Schewe, Lars},
title = {The Coolest Path Problem},
issn = {1438-0064},
url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-11571},
number = {09-37},
abstract = {We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial optimization. The other is the heat conduction problem from the field of partial differential equations. Together, they make up a control problem, where some geometrical object traverses a digraph in an optimal way, with constraints on intermediate or the final state. We discuss some properties of the problem and present numerical solution techniques. We demonstrate that the problem can be formulated as a linear mixed-integer program. Numerical solutions can thus be achieved within one hour for instances with up to 70 nodes in the graph.},
language = {en}
}
@misc{FuegenschuhHillerHumpolaetal.,
author = {F{\"u}genschuh, Armin and Hiller, Benjamin and Humpola, Jesco and Koch, Thorsten and Lehmann, Thomas and Schwarz, Robert and Schweiger, Jonas and Szab{\´o}, J{\´a}cint},
title = {Gas Network Topology Optimization for Upcoming Market Requirements},
doi = {10.1109/EEM.2011.5953035},
url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-12348},
number = {11-09},
abstract = {Gas distribution networks are complex structures that consist of passive pipes, and active, controllable elements such as valves and compressors. Controlling such network means to find a suitable setting for all active components such that a nominated amount of gas can be transmitted from entries to exits through the network, without violating physical or operational constraints. The control of a large-scale gas network is a challenging task from a practical point of view. In most companies the actual controlling process is supported by means of computer software that is able to simulate the flow of the gas. However, the active settings have to be set manually within such simulation software. The solution quality thus depends on the experience of a human planner. When the gas network is insufficient for the transport then topology extensions come into play. Here a set of new pipes or active elements is determined such that the extended network admits a feasible control again. The question again is how to select these extensions and where to place them such that the total extension costs are minimal. Industrial practice is again to use the same simulation software, determine extensions by experience, add them to the virtual network, and then try to find a feasible control of the active elements. The validity of this approach now depends even more on the human planner. Another weakness of this manual simulation-based approach is that it cannot establish infeasibility of a certain gas nomination, unless all settings of the active elements are tried. Moreover, it is impossible to find a cost-optimal network extension in this way. In order to overcome these shortcomings of the manual planning approach we present a new approach, rigorously based on mathematical optimization. Hereto we describe a model for finding feasible controls and then extend this model such that topology extensions can additionally and simultaneously be covered. Numerical results for real-world instances are presented and discussed.},
language = {en}
}
@misc{DittelFuegenschuhMartin,
author = {Dittel, Agnes and F{\"u}genschuh, Armin and Martin, Alexander},
title = {Polyhedral Aspects of Self-Avoiding Walks},
url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-12576},
number = {11-11},
abstract = {In this paper, we study self-avoiding walks of a given length on a graph. We consider a formulation of this problem as a binary linear program. We analyze the polyhedral structure of the underlying polytope and describe valid inequalities. Proofs for their facial properties for certain special cases are given. In a variation of this problem one is interested in optimal configurations, where an energy function measures the benefit if certain path elements are placed on adjacent vertices of the graph. The most prominent application of this problem is the protein folding problem in biochemistry. On a set of selected instances, we demonstrate the computational merits of our approach.},
language = {en}
}
@misc{EisenblaetterFuegenschuhKochetal.,
author = {Eisenbl{\"a}tter, Andreas and F{\"u}genschuh, Armin and Koch, Thorsten and Koster, Arie and Martin, Alexander and Pfender, Tobias and Wegel, Oliver and Wess{\"a}ly, Roland},
title = {Modelling Feasible Network Configurations for UMTS},
url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-6837},
number = {02-16},
abstract = {A model for the optimisation of the location and configuration of base stations in a UMTS network is described. The focus is primarily on modelling the configuration problem sufficiently accurate using mixed-integer variables and (essentially) linear constraints. These constraints reflect the limited downlink code capacity in each cell, the interference limitations for successful up- and downlink transmissions, the need for sufficiently strong (cell) pilot signals, and the potential gain for mobiles from being in soft(er) hand-over. It is also explained how to use the model as a basis for rating network configurations.},
language = {en}
}
@misc{EisenblaetterFuegenschuhGeerdesetal.,
author = {Eisenbl{\"a}tter, Andreas and F{\"u}genschuh, Armin and Geerdes, Hans-Florian and Junglas, Daniel and Koch, Thorsten and Martin, Alexander},
title = {Optimization Methods for UMTS Radio Network Planning},
url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-7637},
number = {03-41},
abstract = {The UMTS radio network planning problem poses the challenge of designing a cost-effective network that provides users with sufficient coverage and capacity. We describe an optimization model for this problem that is based on comprehensive planning data of the EU project MOMENTUM. We present heuristic mathematical methods for this realistic model, including computational results.},
language = {en}
}
@article{FuegenschuhHertyKlaretal.2006,
author = {F{\"u}genschuh, Armin and Herty, Michael and Klar, Axel and Martin, Alexander},
title = {Combinatorial and Continuous Models and Optimization for Traffic Flow on Networks},
series = {SIAM Journal on Optimization},
volume = {16},
journal = {SIAM Journal on Optimization},
number = {4},
pages = {1155 -- 1176},
year = {2006},
language = {en}
}
@article{FuegenschuhStoeveken2005,
author = {F{\"u}genschuh, Armin and St{\"o}veken, Peter},
title = {Integrierte Optimierung des {\"O}PNV-Angebots und der Schulanfangszeiten},
series = {Straß enverkehrstechnik},
volume = {49},
journal = {Straß enverkehrstechnik},
number = {6},
pages = {281 -- 287},
year = {2005},
language = {en}
}
@inproceedings{FuegenschuhHomfeldSchuelldorfetal.2010,
author = {F{\"u}genschuh, Armin and Homfeld, Henning and Sch{\"u}lldorf, Hanno and Vigerske, Stefan},
title = {Mixed-Integer Nonlinear Problems in Transportation Applications},
series = {Proceedings of the 2nd International Conference on Engineering Optimization (+CD-rom)},
booktitle = {Proceedings of the 2nd International Conference on Engineering Optimization (+CD-rom)},
editor = {Rodrigues, H.},
year = {2010},
language = {en}
}
@inproceedings{FuegenschuhGausemeierSeligeretal.2010,
author = {F{\"u}genschuh, Armin and Gausemeier, Pia and Seliger, G{\"u}nther and Severengiz, Semih},
title = {Scenario Technique with Integer Programming for Sustainability in Manufacturing},
series = {8th International Heinz Nixdorf Symposium, Changing Paradigms},
booktitle = {8th International Heinz Nixdorf Symposium, Changing Paradigms},
editor = {Dangelmaier, W.},
pages = {320 -- 331},
year = {2010},
language = {en}
}
@inproceedings{FuegenschuhDefterliWeber2010,
author = {F{\"u}genschuh, Armin and Defterli, {\"O}zlem and Weber, Gehard-Wilhelm},
title = {New Discretization and Optimization Techniques with Results in the Dynamics of Gene-Environment Networks},
series = {3rd Global Conference on Power Control and Optimization (PCO 2010)},
booktitle = {3rd Global Conference on Power Control and Optimization (PCO 2010)},
year = {2010},
language = {en}
}
@inproceedings{FuegenschuhHomfeldSchuelldorf2009,
author = {F{\"u}genschuh, Armin and Homfeld, Henning and Sch{\"u}lldorf, Hanno},
title = {Single Car Routing in Rail Freight Transport},
series = {Dagstuhl Seminar Proceedings 09261, Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik, Deutschland},
booktitle = {Dagstuhl Seminar Proceedings 09261, Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik, Deutschland},
editor = {Barnhart, C. and Clausen, U. and Lauther, U. and M{\"o}hring, R.},
year = {2009},
language = {en}
}
@inproceedings{FuegenschuhlerMartinetal.2009,
author = {F{\"u}genschuh, Armin and ler, Bj{\"o}rn and Martin, Alexander and Morsi, Antonio},
title = {The Transport PDE and Mixed-Integer Linear Programming},
series = {Dagstuhl Seminar Proceedings 09261, Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik, Deutschland},
booktitle = {Dagstuhl Seminar Proceedings 09261, Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik, Deutschland},
editor = {Barnhart, C. and Clausen, U. and Lauther, U. and M{\"o}hring, R.},
year = {2009},
language = {en}
}
@inproceedings{DsokiFuegenschuhHanselkaetal.2008,
author = {Dsoki, Chalid and F{\"u}genschuh, Armin and Hanselka, Holger and Hochbaum, Dorit and Hernandez-Magallanes, Irma and Moreno-Centeno, Erick and Peter, Andrea},
title = {Das ANSLC-Programm und das SDM im Vergleich},
series = {Sonderforschungsbereich 666},
booktitle = {Sonderforschungsbereich 666},
editor = {Groche, P.},
pages = {97 -- 106},
year = {2008},
language = {en}
}
@inproceedings{FuegenschuhHessScheweetal.2008,
author = {F{\"u}genschuh, Armin and Hess, Wolfgang and Schewe, Lars and Martin, Alexander and Ulbrich, Stefan},
title = {Verfeinerte Modelle zur Topologie- und Geometrie-Optimierung von Blechprofilen mit Kammern},
series = {Sonderforschungsbereich 666},
booktitle = {Sonderforschungsbereich 666},
editor = {Groche, P.},
pages = {17 -- 28},
year = {2008},
language = {en}
}
@inproceedings{BalaprakashFuegenschuhHomfeldetal.2008,
author = {Balaprakash, Prasanna and F{\"u}genschuh, Armin and Homfeld, Henning and Schoch, Michael and St{\"u}tzle, Thomas and Yuan, Zhi},
title = {Iterated Greedy Algorithms for a Real-World Cyclic Train Scheduling Problem},
series = {Hybrid Metaheuristics, 4th International Workshop, HM 2008, Malaga, Spain, October 8-9, 2008},
booktitle = {Hybrid Metaheuristics, 4th International Workshop, HM 2008, Malaga, Spain, October 8-9, 2008},
editor = {Aguilera, M.J.},
pages = {21 -- 31},
year = {2008},
language = {en}
}
@inproceedings{FuegenschuhMartin2007,
author = {F{\"u}genschuh, Armin and Martin, Alexander},
title = {Mixed-integer models for topology optimization in sheet metal design},
series = {Sixth International Congress on Industrial Applied Mathematics (ICIAM07) and GAMM Annual Meeting, Z{\"u}rich 2007},
booktitle = {Sixth International Congress on Industrial Applied Mathematics (ICIAM07) and GAMM Annual Meeting, Z{\"u}rich 2007},
pages = {2060049 -- 2060050},
year = {2007},
language = {en}
}
@inproceedings{FuegenschuhPrickStoeveken2007,
author = {F{\"u}genschuh, Armin and Prick, Matthias and St{\"o}veken, Peter},
title = {Ausschreibung von Linienb{\"u}ndeln versus Schulzeitkoordinierung?},
series = {VWT Conference e-Proceedings},
booktitle = {VWT Conference e-Proceedings},
year = {2007},
language = {en}
}
@inproceedings{BirkhoferFuegenschuhMartinetal.2007,
author = {Birkhofer, Herbert and F{\"u}genschuh, Armin and Martin, Alexander and W{\"a}ldele, Martin},
title = {Algorithmenbasierte Produktentwicklung f{\"u}r integrale Blechbauweisen h{\"o}herer Verzweigungsordnung},
series = {Optimierung in der Produktentwicklung, 5. Geimeinsames Kolloquium Konstruktionstechnik},
booktitle = {Optimierung in der Produktentwicklung, 5. Geimeinsames Kolloquium Konstruktionstechnik},
year = {2007},
language = {en}
}
@inproceedings{FuegenschuhGoettlichHerty2007,
author = {F{\"u}genschuh, Armin and G{\"o}ttlich, Simone and Herty, Michael},
title = {A new modeling approach for an integrated simulation and optimization of production networks},
series = {Management logistischer Netzwerke},
booktitle = {Management logistischer Netzwerke},
editor = {G{\"u}nther, H.-O. and Mattfeld, D. and Suhl, L.},
pages = {45 -- 60},
year = {2007},
language = {en}
}
@inproceedings{FuegenschuhGoettlichHerty2007,
author = {F{\"u}genschuh, Armin and G{\"o}ttlich, Simone and Herty, Michael},
title = {Water Contamination Detection},
series = {eOrganisation},
booktitle = {eOrganisation},
editor = {Oberweis, A. and Weinhardt, C. and Gimpel, H. and Koschmider, A. and Pankratius, V. and Schnizler, B.},
pages = {501 -- 518},
year = {2007},
language = {en}
}
@inproceedings{FuegenschuhHessMartinetal.2007,
author = {F{\"u}genschuh, Armin and Hess, Wolfgang and Martin, Alexander and Ulbrich, Stefan},
title = {Diskrete und kontinuierliche Modelle zur Topologie- und Geometrie-Optimierung von Blechprofilen},
series = {Sonderforschungsbereich 666},
booktitle = {Sonderforschungsbereich 666},
editor = {Groche, P.},
pages = {37 -- 47},
year = {2007},
language = {en}
}
@inproceedings{Fuegenschuh2007,
author = {F{\"u}genschuh, Armin},
title = {Scheduling Buses and School Starting Times},
series = {Operations Research Proceedings},
booktitle = {Operations Research Proceedings},
editor = {Waldmann, K.-H. and Stocker, U.},
pages = {17 -- 22},
year = {2007},
language = {en}
}
@inproceedings{BirkhoferFuegenschuhGuentheretal.2006,
author = {Birkhofer, Herbert and F{\"u}genschuh, Armin and G{\"u}nther, Ute and Junglas, Daniel and Martin, Alexander and Sauer, Thorsten and Ulbrich, Stefan and W{\"a}ldele, Martin and Walter, Stephan},
title = {Topology- and shape-optimization of branched sheet metal products},
series = {Operations Research Proceedings},
booktitle = {Operations Research Proceedings},
editor = {Haasis, H. and Kopfer, H. and Sch{\"o}nberger, J.},
pages = {327 -- 336},
year = {2006},
language = {en}
}
@inproceedings{FuegenschuhHoefler2006,
author = {F{\"u}genschuh, Armin and H{\"o}fler, Benjamin},
title = {Parametrized GRASP Heuristics for Three-Index Assignment},
series = {Evolutionary Computation in Combinatorial Optimization},
booktitle = {Evolutionary Computation in Combinatorial Optimization},
editor = {Gottlieb, J. and Raidl, G.},
pages = {61 -- 72},
year = {2006},
language = {en}
}
@inproceedings{FuegenschuhHomfeldHucketal.2006,
author = {F{\"u}genschuh, Armin and Homfeld, Henning and Huck, Andreas and Martin, Alexander},
title = {Locomotive and Wagon Scheduling in Freight Transport},
series = {Proceedings of the ATMOS06},
booktitle = {Proceedings of the ATMOS06},
editor = {Jacob, R. and M{\"u}ller-Hannemann, M.},
year = {2006},
language = {en}
}
@inproceedings{FuegenschuhMartinStoeveken2005,
author = {F{\"u}genschuh, Armin and Martin, Alexander and St{\"o}veken, Peter},
title = {Integrated Optimization of School Starting Times and Public Bus Services},
series = {Operations Research Proceedings},
booktitle = {Operations Research Proceedings},
editor = {Fleuren, H. and den Hertog, D. and Kort, P.},
pages = {150 -- 157},
year = {2005},
language = {en}
}
@inproceedings{FuegenschuhMartinMehlertetal.2005,
author = {F{\"u}genschuh, Armin and Martin, Alexander and Mehlert, Christian and St{\"o}veken, Peter},
title = {Ein Planungstool zur Schulzeitstaffelung},
series = {Supply Chain Management und Logistik},
booktitle = {Supply Chain Management und Logistik},
editor = {G{\"u}nther, H.-O. and Mattfeld, D. and Suhl, L.},
pages = {419 -- 436},
year = {2005},
language = {en}
}
@inproceedings{FuegenschuhStoeveken2005,
author = {F{\"u}genschuh, Armin and St{\"o}veken, Peter},
title = {Integrierte Optimierung der Schulanfangszeit und des Nahverkehrs-Angebots},
series = {Tagungsband der Heureka'05 - Optimierung in Verkehr und Transport},
booktitle = {Tagungsband der Heureka'05 - Optimierung in Verkehr und Transport},
pages = {265 -- 278},
year = {2005},
language = {en}
}
@inproceedings{Fuegenschuh2005,
author = {F{\"u}genschuh, Armin},
title = {Parametrized Greedy Heuristics in Theory and Practice},
series = {Hybrid Metaheuristics, Second International Workshop, HM 2005, Barcelona},
booktitle = {Hybrid Metaheuristics, Second International Workshop, HM 2005, Barcelona},
editor = {Aguilera, M.J. and Blum, C. and Roli, A. and Sampels, M.},
pages = {21 -- 31},
year = {2005},
language = {en}
}
@inproceedings{Fuegenschuh2005,
author = {F{\"u}genschuh, Armin},
title = {Scheduling Buses in Rural Areas},
series = {Advanced OR and AI Methods in Transportation, 10th EWGT / 16th Mini-Euro Conference Proceedings, Poznan},
booktitle = {Advanced OR and AI Methods in Transportation, 10th EWGT / 16th Mini-Euro Conference Proceedings, Poznan},
editor = {Jaszkiewicz, A. and Kaczmarek, M. and Zak, J. and Kubiak, M.},
pages = {706 -- 711},
year = {2005},
language = {en}
}
@inproceedings{EisenblaetterFuegenschuhGeerdesetal.2004,
author = {Eisenbl{\"a}tter, Andreas and F{\"u}genschuh, Armin and Geerdes, Hans-Florian and Junglas, Daniel and Koch, Thorsten and Martin, Alexander},
title = {Integer Programming Methods for UMTS Radio Network Planning},
series = {Proceedings of the WiOpt'04, Cambridge, UK},
booktitle = {Proceedings of the WiOpt'04, Cambridge, UK},
year = {2004},
language = {en}
}
@inproceedings{FuegenschuhMartinStoeveken2004,
author = {F{\"u}genschuh, Armin and Martin, Alexander and St{\"o}veken, Peter},
title = {Integrated Optimization of School Starting Times and Public Bus Services},
series = {Mathematics in the Supply Chain},
booktitle = {Mathematics in the Supply Chain},
editor = {Bixby, R. and Simchi-Levi, D. and Martin, A. and Zimmermann, U.},
year = {2004},
language = {en}
}
@incollection{FuegenschuhMartin2005,
author = {F{\"u}genschuh, Armin and Martin, Alexander},
title = {Computational Integer Programming and Cutting Planes},
series = {Handbooks in Operations Research and Management Science, Vol. 12},
booktitle = {Handbooks in Operations Research and Management Science, Vol. 12},
editor = {Aardal, K. and Nemhauser, G. and Weismantel, R.},
publisher = {North-Holland},
pages = {69 -- 122},
year = {2005},
language = {en}
}
@incollection{Fuegenschuh2003,
author = {F{\"u}genschuh, Armin},
title = {Von Mikrochips, Proteinen und Schulbussen - Projektproseminare im Mathematikstudium},
series = {Projektveranstaltungen in Mathematik, Informatik und Ingenieurwissenschaften},
booktitle = {Projektveranstaltungen in Mathematik, Informatik und Ingenieurwissenschaften},
editor = {G{\"o}rts, W.},
publisher = {UVW Universit{\"a}tsVerlagWebler, Bielefeld},
pages = {21 -- 43},
year = {2003},
language = {en}
}
@incollection{EisenblaetterFuegenschuhKochetal.2002,
author = {Eisenbl{\"a}tter, Andreas and F{\"u}genschuh, Armin and Koch, Thorsten and Koster, Ari and Martin, Alexander and Pfender, Tobias and Wegel, Oliver and Wess{\"a}ly, Roland},
title = {Mathematical Model of Feasible Network Configurations for UMTS},
series = {Telecommunications network design and management},
booktitle = {Telecommunications network design and management},
editor = {G. Anandalingam, S.},
publisher = {Kluwer},
pages = {1 -- 24},
year = {2002},
language = {en}
}
@inproceedings{FuegenschuhHomfeldMartin2007,
author = {F{\"u}genschuh, Armin and Homfeld, Henning and Martin, Alexander},
title = {Leitwegeplanung},
series = {Mathematik f{\"u}r Innovationen in Industrie und Dienstleistungen},
booktitle = {Mathematik f{\"u}r Innovationen in Industrie und Dienstleistungen},
year = {2007},
language = {en}
}
@article{DuerFuegenschuhMartinetal.2010,
author = {D{\"u}r, Mirjam and F{\"u}genschuh, Armin and Martin, Alexander and Schabel, Samuel and Sch{\"o}nberger, Christine and Villforth, Klaus},
title = {Steuerung einer Sortieranlage, z.B. f{\"u}r Altpapier},
series = {Europ{\"a}ische Patentanmeldung},
volume = {EP 09 718 564.9},
journal = {Europ{\"a}ische Patentanmeldung},
year = {2010},
language = {en}
}
@article{DuerFuegenschuhMartinetal.2008,
author = {D{\"u}r, Mirjam and F{\"u}genschuh, Armin and Martin, Alexander and Schabel, Samuel and Sch{\"o}nberger, Christine and Villforth, Klaus},
title = {Verfahren zum Einstellen und/oder Optimieren einer einen Gutstoff von einem Schlechtstoff trennenden Sortieranlage und Sortieranlage},
series = {Deutsches Patent},
volume = {DE 10 2008 013 034},
journal = {Deutsches Patent},
year = {2008},
language = {en}
}
@article{DuerFuegenschuhMartinetal.2006,
author = {D{\"u}r, Mirjam and F{\"u}genschuh, Armin and Martin, Alexander and Ulbrich, Stefan},
title = {Verfahren und Vorrichtung zum Auswuchten von wellenelastischen Rotoren},
series = {Deutsche Patentanmeldung},
volume = {DE 10 2006 060 583.7},
journal = {Deutsche Patentanmeldung},
year = {2006},
language = {en}
}
@article{FuegenschuhMartin2004,
author = {F{\"u}genschuh, Armin and Martin, Alexander},
title = {Verfahren und Vorrichtung zur automatischen Optimierung von Schulanfangszeiten und des {\"o}ffentlichen Personenverkehrs und entsprechendes Computerprogramm},
series = {Deutsche Patentanmeldung},
volume = {DE 10 2004 020 786.0},
journal = {Deutsche Patentanmeldung},
year = {2004},
language = {en}
}
@misc{EisenblaetterFuegenschuhGeerdesetal.2003,
author = {Eisenbl{\"a}tter, Andreas and F{\"u}genschuh, Armin and Geerdes, Hans-Florian and Koch, Thorsten and T{\"u}rke, Ulrich and Meijerink, Ellen},
title = {XML Data Specification and Documentation},
publisher = {IST-2000-28088 MOMENTUM Technical Report},
year = {2003},
language = {en}
}
@article{Fuegenschuh2009,
author = {F{\"u}genschuh, Armin},
title = {Scheduling School Starting Times and Public Buses},
series = {SIAG/OPT Views-and-News},
volume = {20},
journal = {SIAG/OPT Views-and-News},
number = {1},
pages = {1 -- 6},
year = {2009},
language = {en}
}
@article{Fuegenschuh2007,
author = {F{\"u}genschuh, Armin},
title = {Spalten am St{\"u}ck - Maschinenbauer, Materialwissenschaftler und Mathematiker erfinden die Blechbearbeitung neu},
series = {hoch\$^3\$},
volume = {2},
journal = {hoch\$^3\$},
pages = {19},
year = {2007},
language = {en}
}
@article{Fuegenschuh2007,
author = {F{\"u}genschuh, Armin},
title = {Bestes Blech - Der hochkomplexe unsichtbare Weg zum pr{\"a}zisen und belastbaren Bauteil},
series = {hoch\$^3\$},
volume = {2},
journal = {hoch\$^3\$},
pages = {20},
year = {2007},
language = {en}
}
@article{Fuegenschuh2006,
author = {F{\"u}genschuh, Armin},
title = {Optimierte Schulanfangszeiten},
series = {OR News},
volume = {28},
journal = {OR News},
pages = {25 -- 27},
year = {2006},
language = {en}
}
@article{DuerFuegenschuhHuhnetal.2006,
author = {D{\"u}r, Mirjam and F{\"u}genschuh, Armin and Huhn, Petra and Klamroth, Kathrin and Saliba, Sleman and Tammer, Christiane},
title = {EURO Summer Institute 2006 in Wittenberg},
series = {OR News},
volume = {28},
journal = {OR News},
pages = {71 -- 72},
year = {2006},
language = {en}
}
@article{FrankFuegenschuhHertyetal.2010,
author = {Frank, Martin and F{\"u}genschuh, Armin and Herty, Michael and Schewe, Lars},
title = {The Coolest Path Problem},
series = {Networks and Heterogeneous Media},
volume = {5},
journal = {Networks and Heterogeneous Media},
number = {1},
pages = {143 -- 162},
year = {2010},
language = {en}
}
@article{FuegenschuhGoettlichKirchneretal.2009,
author = {F{\"u}genschuh, Armin and G{\"o}ttlich, Simone and Kirchner, Claus and Herty, Michael and Martin, Alexander},
title = {Efficient Reformulation and Solution of a Nonlinear PDE-Controlled Flow Network Model},
series = {Computing},
volume = {85},
journal = {Computing},
number = {3},
pages = {245 -- 265},
year = {2009},
language = {en}
}
@article{DittelFuegenschuhGoettlichetal.2009,
author = {Dittel, Agnes and F{\"u}genschuh, Armin and G{\"o}ttlich, Simone and Herty, Michael},
title = {MIP Presolve Techniques for a PDE-based Supply Chain Model},
series = {Optimization Methods \& Software},
volume = {24},
journal = {Optimization Methods \& Software},
number = {3},
pages = {427 -- 445},
year = {2009},
language = {en}
}
@article{Fuegenschuh2009,
author = {F{\"u}genschuh, Armin},
title = {Solving a School Bus Scheduling Problem with Integer Programming},
series = {European Journal of Operational Research},
volume = {193},
journal = {European Journal of Operational Research},
number = {3},
pages = {867 -- 884},
year = {2009},
language = {en}
}
@article{FuegenschuhHomfeldHucketal.2008,
author = {F{\"u}genschuh, Armin and Homfeld, Henning and Huck, Andreas and Martin, Alexander and Yuan, Zhi},
title = {Scheduling Locomotives and Car Transfers in Freight Transport},
series = {Transportation Science},
volume = {42},
journal = {Transportation Science},
number = {4},
pages = {1 -- 14},
year = {2008},
language = {en}
}
@article{FuegenschuhGoettlichHertyetal.2008,
author = {F{\"u}genschuh, Armin and G{\"o}ttlich, Simone and Herty, Michael and Klar, Alexander and Martin, Alexander},
title = {A Discrete Optimization Approach to Large Scale Supply Networks Based on Partial Differential Equations},
series = {SIAM Journal on Scientific Computing},
volume = {30},
journal = {SIAM Journal on Scientific Computing},
number = {3},
pages = {1490 -- 1507},
year = {2008},
language = {en}
}
@article{FuegenschuhMartin2006,
author = {F{\"u}genschuh, Armin and Martin, Alexander},
title = {A Multicriterial Approach for Optimizing Bus Schedules and School Starting Times},
series = {Annals of Operations Research},
volume = {147},
journal = {Annals of Operations Research},
number = {1},
pages = {199 -- 216},
year = {2006},
language = {en}
}
@article{Fuegenschuh2006,
author = {F{\"u}genschuh, Armin},
title = {The Vehicle Routing Problem with Coupled Time Windows},
series = {Central European Journal of Operations Research},
volume = {14},
journal = {Central European Journal of Operations Research},
number = {2},
pages = {157 -- 176},
year = {2006},
language = {en}
}
@article{FuegenschuhMartin2006,
author = {F{\"u}genschuh, Armin and Martin, Alexander},
title = {Welche Gemeinsamkeiten haben Jugendliche und Groß banken?},
series = {mathematiklehren},
volume = {129},
journal = {mathematiklehren},
pages = {50 -- 54},
year = {2006},
language = {en}
}
@book{Fuegenschuh2005,
author = {F{\"u}genschuh, Armin},
title = {The Integrated Optimization of School Starting Times and Public Bus Services},
publisher = {Logos Verlag Berlin},
year = {2005},
language = {en}
}
@misc{Fuegenschuh2000,
type = {Master Thesis},
author = {F{\"u}genschuh, Armin},
title = {Zur Bergman-Vollst{\"a}ndigkeit hyperkonvexer Gebiete},
year = {2000},
language = {en}
}
@misc{Fuegenschuh2006,
author = {F{\"u}genschuh, Armin},
title = {Optimale Schulanfangszeiten},
publisher = {Bild der Wissenschaft 11/2006, Sonderbeilage zum Klaus-Tschira-Preis},
year = {2006},
language = {en}
}
@article{Fuegenschuh2006,
author = {F{\"u}genschuh, Armin},
title = {Optimal verkn{\"u}pft - Schulanfangszeiten und {\"o}ffentlicher Personennahverkehr},
series = {thema forschung},
volume = {1},
journal = {thema forschung},
pages = {82 -- 85},
year = {2006},
language = {en}
}
@article{Fuegenschuh2006,
author = {F{\"u}genschuh, Armin},
title = {Mathematische Modelle zur betrieblichen Optimierung},
series = {Z! - das Zukunftsmagazin},
volume = {1},
journal = {Z! - das Zukunftsmagazin},
pages = {3},
year = {2006},
language = {en}
}
@misc{Fuegenschuh2002,
author = {F{\"u}genschuh, Armin},
title = {Einsatzplanung von {\"O}PNV-Bussen},
publisher = {Mathematische Modellierung mit Sch{\"u}lern - Die Modellierungswoche im Kloster H{\"o}chst. M. Kiehl, A. Schich, S. Purpus (Hrsg.). Zentrum f{\"u}r Mathematik, Bensheim},
year = {2002},
language = {en}
}
@misc{Fuegenschuh2001,
author = {F{\"u}genschuh, Armin},
title = {Proteinfaltung},
publisher = {Mathematische Modellierung mit Sch{\"u}lern - Die Modellierungswoche im Kloster H{\"o}chst. M. Kiehl, A. Schich, S. Purpus (Hrsg.). Zentrum f{\"u}r Mathematik, Bensheim},
year = {2001},
language = {en}
}
@inproceedings{EisenblaetterKochMartinetal.2003,
author = {Eisenbl{\"a}tter, Andreas and Koch, Thorsten and Martin, Alexander and Achterberg, Tobias and F{\"u}genschuh, Armin and Koster, Arie and Wegel, Oliver and Wess{\"a}ly, Roland},
title = {Modelling Feasible Network Configurations for UMTS},
series = {Telecommunications Network Design and Management},
booktitle = {Telecommunications Network Design and Management},
editor = {Anandalingam, G. and Raghavan, S.},
publisher = {Kluver},
year = {2003},
language = {en}
}
@inproceedings{EisenblaetterFuegenschuhGeerdesetal.2003,
author = {Eisenbl{\"a}tter, Andreas and F{\"u}genschuh, Armin and Geerdes, Hans-Florian and Junglas, Daniel and Koch, Thorsten and Martin, Alexander},
title = {Optimisation Methods for UMTS Radio Network Planning},
series = {Operation Research Proceedings 2003},
booktitle = {Operation Research Proceedings 2003},
editor = {Ahr, D. and Fahrion, R. and Oswald, M. and Reinelt, G.},
publisher = {Springer},
doi = {10.1007/978-3-642-17022-5_5},
pages = {31 -- 38},
year = {2003},
language = {en}
}
@inproceedings{KlugJunoszaSzaniawskiKwasiborskietal.,
author = {Klug, Torsten and Junosza-Szaniawski, Konstanty and Kwasiborski, Slawomir and F{\"u}genschuh, Armin and Schlechte, Thomas},
title = {Fastest, Average and Quantile Schedule},
series = {SOFSEM 2015: Theory and Practice of Computer Science},
booktitle = {SOFSEM 2015: Theory and Practice of Computer Science},
publisher = {Springer Berlin Heidelberg},
doi = {10.1007/978-3-662-46078-8_17},
pages = {201 -- 216},
abstract = {We consider problems concerning the scheduling of a set of trains on a single track. For every pair of trains there is a minimum headway, which every train must wait before it enters the track after another train. The speed of each train is also given. Hence for every schedule - a sequence of trains - we may compute the time that is at least needed for all trains to travel along the track in the given order. We give the solution to three problems: the fastest schedule, the average schedule, and the problem of quantile schedules. The last problem is a question about the smallest upper bound on the time of a given fraction of all possible schedules. We show how these problems are related to the travelling salesman problem. We prove NP-completeness of the fastest schedule problem, NP-hardness of quantile of schedules problem, and polynomiality of the average schedule problem. We also describe some algorithms for all three problems. In the solution of the quantile problem we give an algorithm, based on a reverse search method, generating with polynomial delay all Eulerian multigraphs with the given degree sequence and a bound on the number of such multigraphs. A better bound is left as an open question.},
language = {en}
}
@phdthesis{Fuegenschuh,
author = {F{\"u}genschuh, Armin},
title = {Computational aspects of time in scheduling and dynamic flow problems},
language = {en}
}
@inproceedings{BroseFuegenschuhGausemeieretal.,
author = {Brose, Achim and F{\"u}genschuh, Armin and Gausemeier, Pia and Vierhaus, Ingmar and Seliger, G{\"u}nther},
title = {A System Dynamic Enhancement for the Scenario Technique},
series = {Proc. 11th Global Conference on Sustainable Manufacturing},
booktitle = {Proc. 11th Global Conference on Sustainable Manufacturing},
publisher = {Universit{\"a}tsverlag der TU Berlin},
address = {Berlin},
pages = {561 -- 566},
abstract = {The Scenario Technique is a strategic planning method that aims to describe and analyze potential developments of a considered system in the future. Its application consists of several steps, from an initial problem analysis over an influence analysis to projections of key factors and a definition of the scenarios to a final interpretation of the results. The technique itself combines qualitative and quantitative methods and is an enhancement of the standard Scenario Technique. We use the numerical values gathered during the influence analysis, and embed them in a System Dynamics framework. This yields a mathematically rigorous way to achieve predictions of the system's future behavior from an initial impulse and the feedback structure of the factors. The outcome of our new method is a further way of projecting the present into the future, which enables the user of the Scenario Technique to obtain a validation of the results achieved by the standard method.},
language = {en}
}
@inproceedings{ScheumannVierhausChangetal.,
author = {Scheumann, Ren{\´e} and Vierhaus, Ingmar and Chang, Ya-Ju and F{\"u}genschuh, Armin and Finkbeiner, Matthias},
title = {Identification of trade-offs for sustainable manufacturing of a Bamboo Bike by System Dynamics},
series = {Proceedings of the 27. Conference on Environmental Informatics - Informatics for Environmental Protection, Sustainable Development and Risk Management},
booktitle = {Proceedings of the 27. Conference on Environmental Informatics - Informatics for Environmental Protection, Sustainable Development and Risk Management},
pages = {523 -- 531},
abstract = {We develop a generic System Dynamic model to simulate the production, machines, employees, waste, and capital flows of a manufacturing company. In a second step, this model is specialised by defining suit-able input data to represent a bicycle manufacturing company in a developing country. We monitor a set of sustainability indicators to understand the social, environmental and economic impact of the company, and to estimate managerial decisions to be taken in order to improve on these criteria. We show that the social and environmental situation can be improved over time without sacrificing the economic success of the company's business.},
language = {en}
}
@inproceedings{FuegenschuhvanVeldhuizenVierhaus,
author = {F{\"u}genschuh, Armin and van Veldhuizen, Roel and Vierhaus, Ingmar},
title = {Production Planning for Non-Cooperating Companies with Nonlinear Optimization},
series = {11th Global Conference on Sustainable Manufacturing : Proceedings},
booktitle = {11th Global Conference on Sustainable Manufacturing : Proceedings},
publisher = {Universit{\"a}tsverlag der TU Berlin},
address = {Berlin},
pages = {536 -- 541},
abstract = {We consider a production planning problem where two competing companies are selling their items on a common market. Moreover, the raw material used in the production is a limited non-renewable resource. The revenue per item sold depends on the total amount of items produced by both players. If they collaborate they could apply a production strategy that leads to the highest combined revenue. Usually the formation of such syndicates is prohibited by law; hence we assume that one company does not know how much the other company will produce. We formulate the problem for company A to find an optimal production plan without information on the strategy of company B as a nonlinear mathematical optimization problem. In its naive formulation the model is too large, making its solution practically impossible. After a reformulation we find a much smaller model, which we solve by spatial branch-and-cut methods and linear programming. We discuss the practical implications of our solutions.},
language = {en}
}
@inproceedings{FuegenschuhVierhaus,
author = {F{\"u}genschuh, Armin and Vierhaus, Ingmar},
title = {System Dynamic Optimization in the Sustainability Assessment of a World-Model},
series = {11th Global Conference on Sustainable Manufacturing : Proceedings},
booktitle = {11th Global Conference on Sustainable Manufacturing : Proceedings},
publisher = {Universit{\"a}tsverlag der TU Berlin},
address = {Berlin},
pages = {530 -- 535},
abstract = {The System Dynamics (SD) methodology is a framework for modeling and simulating the dynamic behavior of socioeconomic systems. Characteristic for the description of such systems is the occurrence of feedback loops together with stocks and flows. The mathematical equations that describe the system are usually nonlinear. Therefore seemingly simple systems can show a nonintuitive, nonpredictable behavior over time. Controlling a dynamical system means to define a desired final state in which the system should be, and to specify potential interventions from outside that should keep the system on the right track. The central question is how to compute such globally optimal control for a given SD model. We propose a branch-and-bound approach that is based on a bound propagation method, primal heuristics, and spatial branching. We apply our new SD-control method to a small System Dynamics model, that describes the evolution of a social-economic system over time. We examine the problem of steering this system on a sustainable consumption path.},
language = {en}
}
@inproceedings{FuegenschuhHillerHumpolaetal.,
author = {F{\"u}genschuh, Armin and Hiller, Benjamin and Humpola, Jesco and Koch, Thorsten and Lehmann, Thomas and Schwarz, Robert and Schweiger, Jonas and Szabo, Jacint},
title = {Gas Network Topology Optimization for Upcoming Market Requirements},
series = {International Conference on the European Energy Market (EEM)},
booktitle = {International Conference on the European Energy Market (EEM)},
doi = {10.1109/EEM.2011.5953035},
pages = {346 -- 351},
abstract = {Gas distribution networks are complex structures that consist of passive pipes, and active, controllable elements such as valves and compressors. Controlling such network means to find a suitable setting for all active components such that a nominated amount of gas can be transmitted from entries to exits through the network, without violating physical or operational constraints. The control of a large-scale gas network is a challenging task from a practical point of view. In most companies the actual controlling process is supported by means of computer software that is able to simulate the flow of the gas. However, the active settings have to be set manually within such simulation software. The solution quality thus depends on the experience of a human planner. When the gas network is insufficient for the transport then topology extensions come into play. Here a set of new pipes or active elements is determined such that the extended network admits a feasible control again. The question again is how to select these extensions and where to place them such that the total extension costs are minimal. Industrial practice is again to use the same simulation software, determine extensions by experience, add them to the virtual network, and then try to find a feasible control of the active elements. The validity of this approach now depends even more on the human planner. Another weakness of this manual simulation-based approach is that it cannot establish infeasibility of a certain gas nomination, unless all settings of the active elements are tried. Moreover, it is impossible to find a cost-optimal network extension in this way. In order to overcome these shortcomings of the manual planning approach we present a new approach, rigorously based on mathematical optimization. Hereto we describe a model for finding feasible controls and then extend this model such that topology extensions can additionally and simultaneously be covered. Numerical results for real-world instances are presented and discussed.},
language = {en}
}
@article{PfetschFuegenschuhGeissleretal.,
author = {Pfetsch, Marc. E and F{\"u}genschuh, Armin and Geißler, Bj{\"o}rn and Geißler, Nina and Gollmer, Ralf and Hiller, Benjamin and Humpola, Jesco and Koch, Thorsten and Lehmann, Thomas and Martin, Alexander and Morsi, Antonio and R{\"o}vekamp, Jessica and Schewe, Lars and Schmidt, Martin and Schultz, R{\"u}diger and Schwarz, Robert and Schweiger, Jonas and Stangl, Claudia and Steinbach, Marc C. and Vigerske, Stefan and Willert, Bernhard M.},
title = {Validation of Nominations in Gas Network Optimization: Models, Methods, and Solutions},
series = {Optimization Methods and Software},
journal = {Optimization Methods and Software},
publisher = {Taylor \& Francis},
doi = {10.1080/10556788.2014.888426},
abstract = {In this article we investigate methods to solve a fundamental task in gas transportation, namely the validation of nomination problem: Given a gas transmission network consisting of passive pipelines and active, controllable elements and given an amount of gas at every entry and exit point of the network, find operational settings for all active elements such that there exists a network state meeting all physical, technical, and legal constraints. We describe a two-stage approach to solve the resulting complex and numerically difficult feasibility problem. The first phase consists of four distinct algorithms applying linear, and methods for complementarity constraints to compute possible settings for the discrete decisions. The second phase employs a precise continuous programming model of the gas network. Using this setup, we are able to compute high quality solutions to real-world industrial instances that are significantly larger than networks that have appeared in the mathematical programming literature before.},
language = {en}
}
@article{FuegenschuhGeisslerGollmeretal.,
author = {F{\"u}genschuh, Armin and Geißler, Bj{\"o}rn and Gollmer, Ralf and Hayn, Christine and Henrion, Ren{\´e} and Hiller, Benjamin and Humpola, Jesco and Koch, Thorsten and Lehmann, Thomas and Martin, Alexander and Mirkov, Radoslava and Morsi, Antonio and R{\"o}misch, Werner and R{\"o}vekamp, Jessica and Schewe, Lars and Schmidt, Martin and Schultz, R{\"u}diger and Schwarz, Robert and Schweiger, Jonas and Stangl, Claudia and Steinbach, Marc C. and Willert, Bernhard M.},
title = {Mathematical optimization for challenging network planning problems in unbundled liberalized gas markets},
series = {Energy Systems},
volume = {5},
journal = {Energy Systems},
number = {3},
publisher = {Springer Berlin Heidelberg},
address = {Berlin},
doi = {10.1007/s12667-013-0099-8},
pages = {449 -- 473},
abstract = {The recently imposed new gas market liberalization rules in Germany lead to a change of business of gas network operators. While previously network operator and gas vendor were united, they were forced to split up into independent companies. The network has to be open to any other gas trader at the same conditions, and free network capacities have to be identified and publicly offered in a non-discriminatory way. We discuss how these changing paradigms lead to new and challenging mathematical optimization problems. This includes the validation of nominations, that asks for the decision if the network's capacity is sufficient to transport a specific amount of flow, the verification of booked capacities and the detection of available freely allocable capacities, and the topological extension of the network with new pipelines or compressors in order to increase its capacity. In order to solve each of these problems and to provide meaningful results for the practice, a mixture of different mathematical aspects have to be addressed, such as combinatorics, stochasticity, uncertainty, and nonlinearity. Currently, no numerical solver is available that can deal with such blended problems out-of-the-box. The main goal of our research is to develop such a solver, that moreover is able to solve instances of realistic size. In this article, we describe the main ingredients of our prototypical software implementations.},
language = {en}
}
@article{HumpolaFuegenschuhKoch,
author = {Humpola, Jesco and F{\"u}genschuh, Armin and Koch, Thorsten},
title = {Valid inequalities for the topology optimization problem in gas network design},
series = {OR Spectrum},
journal = {OR Spectrum},
publisher = {Springer},
address = {Berlin Heidelberg},
doi = {10.1007/s00291-015-0390-2},
abstract = {One quarter of Europe's energy demand is provided by natural gas distributed through a vast pipeline network covering the whole of Europe. At a cost of 1 million Euro per km extending the European pipeline network is already a multi-billion Euro business. Therefore, automatic planning tools that support the decision process are desired. Unfortunately, current mathematical methods are not capable of solving the arising network design problems due to their size and complexity. In this article, we will show how to apply optimization methods that can converge to a proven global optimal solution. By introducing a new class of valid inequalities that improve the relaxation of our mixed-integer nonlinear programming model, we are able to speed up the necessary computations substantially.},
language = {en}
}
@incollection{HumpolaFuegenschuhHilleretal.,
author = {Humpola, Jesco and F{\"u}genschuh, Armin and Hiller, Benjamin and Koch, Thorsten and Lehmann, Thomas and Lenz, Ralf and Schwarz, Robert and Schweiger, Jonas},
title = {The Specialized MINLP Approach},
series = {Evaluating Gas Network Capacities},
booktitle = {Evaluating Gas Network Capacities},
publisher = {SIAM},
isbn = {9781611973686},
abstract = {We propose an approach to solve the validation of nominations problem using mixed-integer nonlinear programming (MINLP) methods. Our approach handles both the discrete settings and the nonlinear aspects of gas physics. Our main contribution is an innovative coupling of mixed-integer (linear) programming (MILP) methods with nonlinear programming (NLP) that exploits the special structure of a suitable approximation of gas physics, resulting in a global optimization method for this type of problem.},
language = {en}
}
@article{HumpolaFuegenschuh,
author = {Humpola, Jesco and F{\"u}genschuh, Armin},
title = {Convex reformulations for solving a nonlinear network design problem},
series = {Computational Optimization and Applications},
journal = {Computational Optimization and Applications},
publisher = {Springer US},
doi = {10.1007/s10589-015-9756-2},
abstract = {We consider a nonlinear nonconvex network design problem that arises, for example, in natural gas or water transmission networks. Given is such a network with active and passive components, that is, valves, compressors, control valves (active) and pipelines (passive), and a desired amount of flow at certain specified entry and exit nodes in the network. The active elements are associated with costs when used. Besides flow conservation constraints in the nodes, the flow must fulfill nonlinear nonconvex pressure loss constraints on the arcs subject to potential values (i.e., pressure levels) in both end nodes of each arc. The problem is to compute a cost minimal setting of the active components and numerical values for the flow and node potentials. We examine different (convex) relaxations for a subproblem of the design problem and benefit from them within a branch-and-bound approach. We compare different approaches based on nonlinear optimization numerically on a set of test instances.},
language = {en}
}
@misc{PfetschFuegenschuhGeissleretal.,
author = {Pfetsch, Marc E. and F{\"u}genschuh, Armin and Geißler, Bj{\"o}rn and Geißler, Nina and Gollmer, Ralf and Hiller, Benjamin and Humpola, Jesco and Koch, Thorsten and Lehmann, Thomas and Martin, Alexander and Morsi, Antonio and R{\"o}vekamp, Jessica and Schewe, Lars and Schmidt, Martin and Schultz, R{\"u}diger and Schwarz, Robert and Schweiger, Jonas and Stangl, Claudia and Steinbach, Marc C. and Vigerske, Stefan and Willert, Bernhard M.},
title = {Validation of Nominations in Gas Network Optimization: Models, Methods, and Solutions},
issn = {1438-0064},
doi = {10.1080/10556788.2014.888426},
url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-16531},
abstract = {In this article we investigate methods to solve a fundamental task in gas transportation, namely the validation of nomination problem: Given a gas transmission network consisting of passive pipelines and active, controllable elements and given an amount of gas at every entry and exit point of the network, find operational settings for all active elements such that there exists a network state meeting all physical, technical, and legal constraints. We describe a two-stage approach to solve the resulting complex and numerically difficult mixed-integer non-convex nonlinear feasibility problem. The first phase consists of four distinct algorithms facilitating mixed-integer linear, mixed-integer nonlinear, reduced nonlinear, and complementarity constrained methods to compute possible settings for the discrete decisions. The second phase employs a precise continuous nonlinear programming model of the gas network. Using this setup, we are able to compute high quality solutions to real-world industrial instances whose size is significantly larger than networks that have appeared in the literature previously.},
language = {en}
}
@misc{FuegenschuhGeisslerGollmeretal.,
author = {F{\"u}genschuh, Armin and Geißler, Bj{\"o}rn and Gollmer, Ralf and Hayn, Christine and Henrion, Rene and Hiller, Benjamin and Humpola, Jesco and Koch, Thorsten and Lehmann, Thomas and Martin, Alexander and Mirkov, Radoslava and Morsi, Antonio and R{\"o}misch, Werner and R{\"o}vekamp, Jessica and Schewe, Lars and Schmidt, Martin and Schultz, R{\"u}diger and Schwarz, Robert and Schweiger, Jonas and Stangl, Claudia and Steinbach, Marc C. and Willert, Bernhard M.},
title = {Mathematical Optimization for Challenging Network Planning Problems in Unbundled Liberalized Gas Markets},
issn = {1438-0064},
doi = {10.1007/s12667-013-0099-8},
url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-17821},
abstract = {The recently imposed new gas market liberalization rules in Germany lead to a change of business of gas network operators. While previously network operator and gas vendor where united, they were forced to split up into independent companies. The network has to be open to any other gas trader at the same conditions, and free network capacities have to be identified and publicly offered in a non-discriminatory way. We show that these new paradigms lead to new and challenging mathematical optimization problems. In order to solve them and to provide meaningful results for practice, all aspects of the underlying problems, such as combinatorics, stochasticity, uncertainty, and nonlinearity, have to be addressed. With such special-tailored solvers, free network capacities and topological network extensions can, for instance, be determined.},
language = {en}
}
@inproceedings{VierhausFuegenschuh,
author = {Vierhaus, Ingmar and F{\"u}genschuh, Armin},
title = {Global and Local Optimal Control of a Resource Utilization Problem},
series = {Proceedings of the 33rd International Conference of the System Dynamics Society},
booktitle = {Proceedings of the 33rd International Conference of the System Dynamics Society},
abstract = {System Dynamic models describe physical, technical, economical, or social systems using differential and algebraic equations. In their purest form, these models are intended to describe the evolution of a system from a given initial state. In many applications, it is possible to intervene with the system in order to obtain a desired dynamic or a certain outcome in the end. On the mathematical side, this leads to control problems, where aside from the simulation one has to find optimal intervention functions over time that maximize a specific objective function. Using a dynamical model for the utilization of a natural nonrenewable resource of Behrens as a demonstrator example, we present two main mathematical solution strategies. They are distinguished by the quality certificate on their respective solution: one leads to proven local optimal solution, and the other technique yields proven global optimal solutions. We present implementational and numerical issues, and a comparison of both methods.},
language = {en}
}
@inproceedings{VierhausFuegenschuh,
author = {Vierhaus, Ingmar and F{\"u}genschuh, Armin},
title = {A Global Approach to the Optimal Control of System Dynamics Models},
series = {Proceedings of the 31st International Conference of the System Dynamics Society},
booktitle = {Proceedings of the 31st International Conference of the System Dynamics Society},
abstract = {The System Dynamics (SD) methodology is a framework for modeling and simulating the dynamic behavior of socioeconomic systems. Characteristic for the description of such systems is the occurrence of feedback loops together with stocks and flows. The mathematical equations that describe the system are usually ordinary differential equations and nonlinear algebraic constraints. Seemingly simple systems can show a nonintuitive, unpredictable behavior over time. Controlling a dynamical system means to specify potential interventions from outside that should keep the system on the desired track, and to define an evaluation schema to compare different controls among each other, so that a ``best'' control can be defined in a meaningful way. The central question is how to compute such globally optimal control for a given SD model, that allows the transition of the system into a desired state with minimum effort. We propose a mixed-integer nonlinear programming (MINLP) reformulation of the System Dynamics Optimization (SDO) problem. MINLP problems can be solved by linear programming based branch-and-bound approach. We demonstrate that standard MINLP solvers are not able to solve SDO problem. To overcome this obstacle, we introduce a special-tailored bound propagation method. Numerical results for these test cases are presented.},
language = {en}
}
@inproceedings{VierhausFuegenschuhGottwaldetal.,
author = {Vierhaus, Ingmar and F{\"u}genschuh, Armin and Gottwald, Robert and Gr{\"o}sser, Stefan},
title = {Modern Nonlinear Optimization Techniques for an Optimal Control of System Dynamics Models},
series = {Proceedings of the 32nd International Conference of the System Dynamics Society},
booktitle = {Proceedings of the 32nd International Conference of the System Dynamics Society},
abstract = {We study System Dynamics models with several free parameters that can be altered by the user. We assume that the user's goal is to achieve a certain dynamic behavior of the model by varying these parameters. In order to find best possible combination of parameter settings, several automatic parameter tuning methods are described in the literature and readily available within existing System Dynamic software packages. We give a survey on the available techniques in the market and describe their theoretical background. Some of these methods are already six decades old, and meanwhile newer and more powerful optimization methods have emerged in the mathematical literature. One major obstacle for their direct use are tabled data in System Dynamics models, which are usually interpreted as piecewise linear functions. However, modern optimization methods usually require smooth functions which are twice continuously differentiable. We overcome this problem by a smooth spline interpolation of the tabled data. We use a test set of three complex System Dynamic models from the literature, describe their individual transition into optimization problems, and demonstrate the applicability of modern optimization algorithms to these System Dynamics Optimization problems.},
language = {en}
}
@article{HumpolaLehmannFuegenschuh,
author = {Humpola, Jesco and Lehmann, Thomas and F{\"u}genschuh, Armin},
title = {A primal heuristic for optimizing the topology of gas networks based on dual information},
series = {EURO Journal on Computational Optimization},
journal = {EURO Journal on Computational Optimization},
doi = {10.1007/s13675-014-0029-0},
abstract = {We present a novel heuristic to identify feasible solutions of a mixed-integer nonlinear programming problem arising in natural gas transportation: the selection of new pipelines to enhance the network's capacity to a desired level in a cost-efficient way. We solve this problem in a linear programming based branch-and-cut approach, where we deal with the nonlinearities by linear outer approximation and spatial branching. At certain nodes of the branching tree, we compute a KKT point of a nonlinear relaxation. Based on the information from the KKT point we alter some of the binary variables in a locally promising way exploiting our problem-specific structure. On a test set of real-world instances, we are able to increase the chance of identifying feasible solutions by some order of magnitude compared to standard MINLP heuristics that are already built in the general-purpose MINLP solver SCIP.},
language = {en}
}
@article{BorndoerferFuegenschuhKlugetal.,
author = {Bornd{\"o}rfer, Ralf and F{\"u}genschuh, Armin and Klug, Torsten and Schang, Thilo and Schlechte, Thomas and Sch{\"u}lldorf, Hanno},
title = {The Freight Train Routing Problem for Congested Railway Networks with Mixed Traffic},
series = {Transportation Science},
journal = {Transportation Science},
doi = {10.1287/trsc.2015.0656},
abstract = {We consider the following freight train routing problem (FTRP). Given is a transportation network with fixed routes for passenger trains and a set of freight trains (requests), each defined by an origin and destination station pair. The objective is to calculate a feasible route for each freight train such that the sum of all expected delays and all running times is minimal. Previous research concentrated on microscopic train routings for junctions or inside major stations. Only recently approaches were developed to tackle larger corridors or even networks. We investigate the routing problem from a strategic perspective, calculating the routes in a macroscopic transportation network of Deutsche Bahn AG. In this context, macroscopic refers to an aggregation of complex and large real-world structures into fewer network elements. Moreover, the departure and arrival times of freight trains are approximated. The problem has a strategic character since it asks only for a coarse routing through the network without the precise timings. We provide a mixed-integer nonlinear programming (MINLP) formulation for the FTRP, which is a multicommodity flow model on a time-expanded graph with additional routing constraints. The model's nonlinearities originate from an algebraic approximation of the delays of the trains on the arcs of the network by capacity restraint functions. The MINLP is reduced to a mixed-integer linear model (MILP) by piecewise linear approximation. The latter is solved by a state-of-the art MILP solver for various real-world test instances.},
language = {en}
}
@misc{BorndoerferFuegenschuhKlugetal.,
author = {Bornd{\"o}rfer, Ralf and F{\"u}genschuh, Armin and Klug, Torsten and Schang, Thilo and Schlechte, Thomas and Sch{\"u}lldorf, Hanno},
title = {The Freight Train Routing Problem},
url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-18991},
abstract = {We consider the following freight train routing problem (FTRP). Given is a transportation network with fixed routes for passenger trains and a set of freight trains (requests), each defined by an origin and destination station pair. The objective is to calculate a feasible route for each freight train such that a sum of all expected delays and all running times is minimal. Previous research concentrated on microscopic train routings for junctions or inside major stations. Only recently approaches were developed to tackle larger corridors or even networks. We investigate the routing problem from a strategic perspective, calculating the routes in a macroscopic transportation network of Deutsche Bahn AG. Here macroscopic refers to an aggregation of complex real-world structures are into fewer network elements. Moreover, the departure and arrival times of freight trains are approximated. The problem has a strategic character since it asks only for a coarse routing through the network without the precise timings. We give a mixed-integer nonlinear programming~(MINLP) formulation for FTRP, which is a multi-commodity flow model on a time-expanded graph with additional routing constraints. The model's nonlinearities are due to an algebraic approximation of the delays of the trains on the arcs of the network by capacity restraint functions. The MINLP is reduced to a mixed-integer linear model~(MILP) by piecewise linear approximation. The latter is solved by a state of the art MILP solver for various real-world test instances.},
language = {en}
}
@misc{FuegenschuhJunoszaSzaniawskiKlugetal.,
author = {F{\"u}genschuh, Armin and Junosza-Szaniawski, Konstanty and Klug, Torsten and Kwasiborski, Slawomir and Schlechte, Thomas},
title = {Fastest, average and quantile schedule},
issn = {1438-0064},
url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-53592},
abstract = {We consider problems concerning the scheduling of a set of trains on a single track. For every pair of trains there is a minimum headway, which every train must wait before it enters the track after another train. The speed of each train is also given. Hence for every schedule - a sequence of trains - we may compute the time that is at least needed for all trains to travel along the track in the given order. We give the solution to three problems: the fastest schedule, the average schedule, and the problem of quantile schedules. The last problem is a question about the smallest upper bound on the time of a given fraction of all possible schedules. We show how these problems are related to the travelling salesman problem. We prove NP-completeness of the fastest schedule problem, NP-hardness of quantile of schedules problem, and polynomiality of the average schedule problem. We also describe some algorithms for all three problems. In the solution of the quantile problem we give an algorithm, based on a reverse search method, generating with polynomial delay all Eulerian multigraphs with the given degree sequence and a bound on the number of such multigraphs. A better bound is left as an open question.},
language = {en}
}
@misc{HumpolaFuegenschuh,
author = {Humpola, Jesco and F{\"u}genschuh, Armin},
title = {A New Class of Valid Inequalities for Nonlinear Network Design Problems},
issn = {1438-0064},
doi = {10.1007/s00291-015-0390-2},
url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-17771},
abstract = {We consider a nonlinear nonconvex network design problem that arises in the extension of natural gas transmission networks. Given is such network with active and passive components, that is, valves, compressors, pressure regulators (active) and pipelines (passive), and a desired amount of flow at certain specified entry and exit nodes of the network. Besides flow conservation constraints in the nodes the flow must fulfill nonlinear nonconvex pressure loss constraints on the arcs subject to potential values (i.e., pressure levels) in both end nodes of each arc. Assume that there does not exist a feasible flow that fulfills all physical constraints and meets the desired entry and exit amounts. Then a natural question is where to extend the network by adding pipes in the most economic way such that this flow becomes feasible. Answering this question is computationally demanding because of the difficult problem structure. We use mixed-integer nonlinear programming techniques that rely on an outer approximation of the overall problem, and a branching on decision variables. We formulate a new class of valid inequalities (or cutting planes) which reduce the overall solution time when added to the formulation. We demonstrate the computational merits of our approach on test instances.},
language = {en}
}
@misc{FuegenschuhHaynMichaels,
author = {F{\"u}genschuh, Armin and Hayn, Christine and Michaels, Dennis},
title = {Mixed-Integer Linear Methods for Layout-Optimization of Screening Systems in Recovered Paper Production},
issn = {1438-0064},
url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-16862},
abstract = {The industrial treatment of waste paper in order to regain valuable fibers from which recovered paper can be produced, involves several steps of preparation. One important step is the separation of stickies that are normally attached to the paper. If not properly separated, remaining stickies reduce the quality of the recovered paper or even disrupt the production process. For the mechanical separation process of fibers from stickies a separator screen is used. This machine has one input feed and two output streams, called the accept and the reject. In the accept the fibers are concentrated, whereas the reject has a higher concentration of stickies. The machine can be controlled by setting its reject rate. But even when the reject rate is set properly, after just a single screening step, the accept still has too many stickies, or the reject too many fibers. To get a proper separation, several separators have to be assembled into a network. From a mathematical point of view this problem can be seen as a multi-commodity network flow design problem with a nonlinear, controllable distribution function at each node. We present a nonlinear mixed-integer programming model for the simultaneous selection of a subset of separators, the network's topology, and the optimal setting of each separator. Numerical results are obtained via different types of linearization of the nonlinearities and the use of mixed-integer linear solvers, and compared with state-of-the-art global optimization software.},
language = {en}
}
@misc{FuegenschuhVierhaus,
author = {F{\"u}genschuh, Armin and Vierhaus, Ingmar},
title = {System Dynamic Optimization in the Sustainability Assessment of a World-Model},
issn = {1438-0064},
url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-18148},
abstract = {The System Dynamics (SD) methodology is a framework for modeling and simulating the dynamic behavior of socioeconomic systems. Characteristic for the description of such systems is the occurrence of feedback loops together with stocks and flows. The mathematical equations that describe the system are usually nonlinear. Therefore seemingly simple systems can show a nonintuitive, nonpredictable behavior over time. Controlling a dynamical system means to define a desired final state in which the system should be, and to specify potential interventions from outside that should keep the system on the right track. The central question is how to compute such globally optimal control for a given SD model. We propose a branch-and-bound approach that is based on a bound propagation method, primal heuristics, and spatial branching. We apply our new SD-control method to a small System Dynamics model, that describes the evolution of a social-economic system over time. We examine the problem of steering this system on a sustainable consumption path.},
language = {en}
}
@misc{FuegenschuhGroesserVierhaus,
author = {F{\"u}genschuh, Armin and Gr{\"o}sser, Stefan N. and Vierhaus, Ingmar},
title = {A Global Approach to the Control of an Industry Structure System Dynamics Model},
issn = {1438-0064},
url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-42932},
abstract = {We consider a system dynamics model that describes the effect of human activity on natural resources. The central stocks are the accumulated profit, the industry structures, and the water resources. The model can be controlled through two time-dependent parameters. The goal in this paper is to find a parameter setting that leads to a maximization of a performance index, which reflects both environmental and economic aspects. Thus, the goal is to identify the most sustainable stock of industry structures within the model's constraints and assumptions. In order to find a proven global optimal parameter set, we formulate the System Dynamics Optimization model as a mixed-integer nonlinear problem that is accessible for numerical solvers. Due to the dynamic structure of the model, certain steps of the solution process must be handled with greater care, compared to standard non-dynamic problems. We describe our approach of solving the industry structure model and present computational results. In addition, we discuss the limitations of the approach and next steps.},
language = {en}
}
@misc{HumpolaFuegenschuhLehmann,
author = {Humpola, Jesco and F{\"u}genschuh, Armin and Lehmann, Thomas},
title = {A Primal Heuristic for MINLP based on Dual Information},
issn = {1438-0064},
doi = {10.1007/s13675-014-0029-0},
url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-43110},
abstract = {We present a novel heuristic algorithm to identify feasible solutions of a mixed-integer nonlinear programming problem arising in natural gas transportation: the selection of new pipelines to enhance the network's capacity to a desired level in a cost-efficient way. We solve this problem in a linear programming based branch-and-cut approach, where we deal with the nonlinearities by linear outer approximation and spatial branching. At certain nodes of the branching tree, we compute a KKT point for a nonlinear relaxation. Based on the information from the KKT point we alter some of the integer variables in a locally promising way. We describe this heuristic for general MINLPs and then show how to tailor the heuristic to exploit our problem-specific structure. On a test set of real-world instances, we are able to increase the chance of identifying feasible solutions by some order of magnitude compared to standard MINLP heuristics that are already built in the general-purpose MINLP solver SCIP.},
language = {en}
}
@misc{FuegenschuhHumpola,
author = {F{\"u}genschuh, Armin and Humpola, Jesco},
title = {A Unified View on Relaxations for a Nonlinear Network Flow Problem},
url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-18857},
abstract = {We consider a nonlinear nonconvex network flow problem that arises, for example, in natural gas or water transmission networks. Given is such network with active and passive components, that is, valves, compressors, pressure regulators (active) and pipelines (passive), and a desired amount of flow at certain specified entry and exit nodes of the network. Besides flow conservation constraints in the nodes the flow must fulfill nonlinear nonconvex pressure loss constraints on the arcs subject to potential values (i.e., pressure levels) in both end nodes of each arc. The problem is how to numerically compute this flow and pressures. We review an existing approach of Maugis (1977) and extend it to the case of networks with active elements (for example, compressors). We further examine different ways of relaxations for the nonlinear network flow model. We compare different approaches based on nonlinear optimization numerically on a set of test instances.},
language = {en}
}
@misc{FuegenschuhVierhaus,
author = {F{\"u}genschuh, Armin and Vierhaus, Ingmar},
title = {A Global Approach to the Optimal Control of System Dynamics Models},
issn = {1438-0064},
url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-18600},
abstract = {The System Dynamics (SD) methodology is a framework for modeling and simulating the dynamic behavior of socioeconomic systems. Characteristic for the description of such systems is the occurrence of feedback loops together with stocks and flows. The mathematical equations that describe the system are usually ordinary differential equations and nonlinear algebraic constraints. Therefore seemingly simple systems can show a nonintuitive, unpredictable behavior over time. Controlling a dynamical system means to specify potential interventions from outside that should keep the system on the desired track, and to define an evaluation schema to compare different controls among each other, so that a "best" control can be defined in a meaningful way. The central question is how to compute such globally optimal control for a given SD model, that allows the transition of the system into a desired state with minimum effort. We propose a mixed-integer nonlinear programming (MINLP) reformulation of the System Dynamics Optimization (SDO) problem. MINLP problems can be solved by linear programming based branch-and-bound approach. We demonstrate that standard MINLP solvers are not able to solve SDO problem. To overcome this obstacle, we introduce a special-tailored bound propagation method. We apply our new method to a predator-prey model with additional hunting activity as control, and to a mini-world model with the consumption level as control. Numerical results for these test cases are presented.},
language = {en}
}
@misc{BroseFuegenschuhGausemeieretal.,
author = {Brose, Achim and F{\"u}genschuh, Armin and Gausemeier, Pia and Vierhaus, Ingmar and Seliger, G{\"u}nther},
title = {A System Dynamic Enhancement for the Scenario Technique},
issn = {1438-0064},
url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-18150},
abstract = {The Scenario Technique is a strategic planning method that aims to describe and analyze potential developments of a considered system in the future. Its application consists of several steps, from an initial problem analysis over an influence analysis to projections of key factors and a definition of the scenarios to a final interpretation of the results. The technique itself combines qualitative and quantitative methods and is an enhancement of the standard Scenario Technique. We use the numerical values gathered during the influence analysis, and embed them in a System Dynamics framework. This yields a mathematically rigorous way to achieve predictions of the system's future behavior from an initial impulse and the feedback structure of the factors. The outcome of our new method is a further way of projecting the present into the future, which enables the user of the Scenario Technique to obtain a validation of the results achieved by the standard method.},
language = {en}
}
@misc{FuegenschuhvanVeldhuizenVierhaus,
author = {F{\"u}genschuh, Armin and van Veldhuizen, Roel and Vierhaus, Ingmar},
title = {Production Planning for Non-Cooperating Companies with Nonlinear Optimization},
issn = {1438-0064},
url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-18163},
abstract = {We consider a production planning problem where two competing companies are selling their items on a common market. Moreover, the raw material used in the production is a limited non-renewable resource. The revenue per item sold depends on the total amount of items produced by both players. If they collaborate they could apply a production strategy that leads to the highest combined revenue. Usually the formation of such syndicates is prohibited by law; hence we assume that one company does not know how much the other company will produce. We formulate the problem for company A to find an optimal production plan without information on the strategy of company B as a nonlinear mathematical optimization problem. In its naive formulation the model is too large, making its solution practically impossible. After a reformulation we find a much smaller model, which we solve by spatial branch-and-cut methods and linear programming. We discuss the practical implications of our solutions.},
language = {en}
}
@misc{VierhausFuegenschuhGottwaldetal.,
author = {Vierhaus, Ingmar and F{\"u}genschuh, Armin and Gottwald, Robert Lion and Gr{\"o}sser, Stefan N.},
title = {Modern Nonlinear Optimization Techniques for an Optimal Control of System Dynamics Models},
issn = {1438-0064},
url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-48159},
abstract = {We study System Dynamics models with several free parameters that can be altered by the user. We assume that the user's goal is to achieve a certain dynamic behavior of the model by varying these parameters. In order to the find best possible combination of parameter settings, several automatic parameter tuning methods are described in the literature and readily available within existing System Dynamic software packages. We give a survey on the available techniques in the market and describe their theoretical background. Some of these methods are already six decades old, and meanwhile newer and more powerful optimization methods have emerged in the mathematical literature. One major obstacle for their direct use are tabled data in System Dynamics models, which are usually interpreted as piecewise linear functions. However, modern optimization methods usually require smooth functions which are twice continuously differentiable. We overcome this problem by a smooth spline interpolation of the tabled data. We use a test set of three complex System Dynamic models from the literature, describe their individual transition into optimization problems, and demonstrate the applicability of modern optimization algorithms to these System Dynamics Optimization problems.},
language = {en}
}
@misc{ScheumannVierhausChangetal.,
author = {Scheumann, Ren{\´e} and Vierhaus, Ingmar and Chang, Ya-Ju and F{\"u}genschuh, Armin and Finkbeiner, Matthias},
title = {Identification of trade-offs for sustainable manufacturing of a Bamboo Bike by System Dynamics},
url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-18895},
abstract = {We develop a generic System Dynamic model to simulate the production, machines, employees, waste, and capital flows of a manufacturing company. In a second step, this model is specialised by defining suit-able input data to represent a bicycle manufacturing company in a developing country. We monitor a set of sustainability indicators to understand the social, environmental and economic impact of the company, and to estimate managerial decisions to be taken in order to improve on these criteria. We show that the social and environmental situation can be improved over time without sacrificing the economic success of the company's business.},
language = {en}
}
@article{VierhausFuegenschuhGottwaldetal.,
author = {Vierhaus, Ingmar and F{\"u}genschuh, Armin and Gottwald, Robert Lion and Gr{\"o}sser, Stefan},
title = {Using white-box nonlinear optimization methods in system dynamics policy improvement},
series = {System Dynamics Review},
volume = {33},
journal = {System Dynamics Review},
number = {2},
doi = {10.1002/sdr.1583},
pages = {138 -- 168},
abstract = {We present a new strategy for the direct optimization of the values of policy functions. This approach is particularly well suited to model actors with a global perspective on the system and relies heavily on modern mathematical white-box optimization methods. We demonstrate our strategy on two classical models: market growth and World2. Each model is first transformed into an optimization problem by defining how the actor can influence the models' dynamics and by choosing objective functions to measure improvements. To improve comparability between different runs, we also introduce a comparison measure for possible interventions. We solve the optimization problems, discuss the resulting policies and compare them to the existing results from the literature. In particular, we present a run of the World2 model which significantly improves the published "towards a global equilibrium" run with equal cost of intervention.},
language = {en}
}
@inproceedings{ScheumannFuegenschuhSchenkeretal.,
author = {Scheumann, Ren{\´e} and F{\"u}genschuh, Armin and Schenker, Sebastian and Vierhaus, Ingmar and Bornd{\"o}rfer, Ralf and Finkbeiner, Matthias},
title = {Global Manufacturing: How to Use Mathematical Optimisation Methods to Transform to Sustainable Value Creation},
series = {Proceedings of the 10th Global Conference on Sustainable Manufacturing},
booktitle = {Proceedings of the 10th Global Conference on Sustainable Manufacturing},
editor = {Seliger, G{\"u}nther},
isbn = {978-605-63463-1-6},
pages = {538 -- 545},
language = {en}
}
@incollection{SchenkerVierhausBorndoerferetal.,
author = {Schenker, Sebastian and Vierhaus, Ingmar and Bornd{\"o}rfer, Ralf and F{\"u}genschuh, Armin and Skutella, Martin},
title = {Optimisation Methods in Sustainable Manufacturing},
series = {Sustainable Manufacturing},
booktitle = {Sustainable Manufacturing},
editor = {Stark, Rainer and Seliger, G{\"u}nther and Bonvoisin, J{\´e}r{\´e}my},
publisher = {Springer International Publishing},
isbn = {978-3-319-48514-0},
doi = {10.1007/978-3-319-48514-0_15},
pages = {239 -- 253},
abstract = {Sustainable manufacturing is driven by the insight that the focus on the economic dimension in current businesses and lifestyles has to be broadened to cover all three pillars of sustainability: economic development, social development, and environmental protection.},
language = {en}
}
@misc{ScheumannFuegenschuhSchenkeretal.,
author = {Scheumann, Rene and F{\"u}genschuh, Armin and Schenker, Sebastian and Vierhaus, Ingmar and Bornd{\"o}rfer, Ralf and Finkbeiner, Matthias},
title = {Global Manufacturing: How to Use Mathematical Optimisation Methods to Transform to Sustainable Value Creation},
issn = {1438-0064},
url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-15703},
abstract = {It is clear that a transformation to sustainable value creation is needed, because business as usual is not an option for preserving competitive advantages of leading industries. What does that mean? This contribution proposes possible approaches for a shift in existing manufacturing paradigms. In a first step, sustainability aspects from the German Sustainability Strategy and from the tools of life cycle sustainability assessment are chosen to match areas of a value creation process. Within these aspects are indicators, which can be measured within a manufacturing process. Once these data are obtained they can be used to set up a mathematical linear pulse model of manufacturing in order to analyse the evolution of the system over time, that is the transition process, by using a system dynamics approach. An increase of technology development by a factor of 2 leads to an increase of manufacturing but also to an increase of climate change. Compensation measures need to be taken. This can be done by e.g. taking money from the GDP (as an indicator of the aspect ``macroeconomic performance''). The value of the arc from that building block towards climate change must then be increased by a factor of 10. The choice of independent and representative indicators or aspects shall be validated and double-checked for their significance with the help of multi-criteria mixed-integer programming optimisation methods.},
language = {en}
}
@book{AbbinkBaermannBesinovicetal.,
author = {Abbink, Erwin and B{\"a}rmann, Andreas and Besinovic, Nikola and Bohlin, Markus and Cacchiani, Valentina and Caimi, Gabrio and Dollevot, Twan and de Fabris, Stefano and Fischer, Frank and F{\"u}genschuh, Armin and Galli, Laura and Goverde, Rob M.P. and Hansmann, Ronny and Homfeld, Henning and Huisman, Dennis and Johann, Marc and Klug, Torsten and Kroon, Leo and Lamorgese, Leonardo and Liers, Frauke and Mannino, Carlo and Medeossi, Giorgio and Pacciarelli, Dario and Reuther, Markus and Schlechte, Thomas and Schmidt, Marie and Sch{\"o}bel, Anita and Sch{\"u}lldorf, Hanno and Stieber, Anke and Stiller, Sebastian and T{\"o}rnquist Krasemann, Johanna and Toth, Paolo and Zimmermann, Uwe T.},
title = {Handbook of Optimization in the Railway Industry},
volume = {268},
editor = {Bornd{\"o}rfer, Ralf and Klug, Torsten and Lamorgese, Leonardo and Mannino, Carlo and Reuther, Markus and Schlechte, Thomas},
edition = {1},
publisher = {Springer International Publishing},
isbn = {978-3-319-72152-1},
doi = {10.1007/978-3-319-72153-8},
pages = {338},
abstract = {This book promotes the use of mathematical optimization and operations research methods in rail transportation. The editors assembled thirteen contributions from leading scholars to present a unified voice, standardize terminology, and assess the state-of-the-art. There are three main clusters of articles, corresponding to the classical stages of the planning process: strategic, tactical, and operational. These three clusters are further subdivided into five parts which correspond to the main phases of the railway network planning process: network assessment, capacity planning, timetabling, resource planning, and operational planning. Individual chapters cover: Simulation Capacity Assessment Network Design Train Routing Robust Timetabling Event Scheduling Track Allocation Blocking Shunting Rolling Stock Crew Scheduling Dispatching Delay Propagation},
language = {en}
}