@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} } @article{PfetschFuegenschuhGeissleretal., author = {Pfetsch, Marc 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 and Vigerske, Stefan and Willert, Bernhard}, 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 and Willert, Bernhard}, 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{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}, volume = {50}, journal = {Transportation Science}, number = {2}, doi = {10.1287/trsc.2015.0656}, pages = {408 -- 423}, 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} } @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{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} } @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} } @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} } @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} }