TY - CHAP A1 - Eisenblätter, Andreas A1 - Koch, Thorsten A1 - Martin, Alexander A1 - Achterberg, Tobias A1 - Fügenschuh, Armin A1 - Koster, Arie M.C.A. A1 - Wegel, Oliver A1 - Wessäly, Roland ED - Anandalingam, G. ED - Raghavan, S. T1 - Modelling Feasible Network Configurations for UMTS T2 - Telecommunications Network Design and Management Y1 - 2003 UR - http://opus.kobv.de/zib/volltexte/2002/684/ PB - Kluver ER - TY - CHAP A1 - Eisenblätter, Andreas A1 - Fügenschuh, Armin A1 - Geerdes, Hans-Florian A1 - Junglas, Daniel A1 - Koch, Thorsten A1 - Martin, Alexander ED - Ahr, Dino ED - Fahrion, Roland ED - Oswald, Marcus ED - Reinelt, Gerhard T1 - Optimisation Methods for UMTS Radio Network Planning T2 - Operation Research Proceedings 2003 Y1 - 2003 U6 - https://doi.org/10.1007/978-3-642-17022-5_5 SP - 31 EP - 38 PB - Springer ER - TY - JOUR A1 - Dür, Mirjam A1 - Fügenschuh, Armin A1 - Huhn, Petra A1 - Klamroth, Kathrin A1 - Saliba, Sleman A1 - Tammer, Christiane T1 - EURO Summer Institute 2006 in Wittenberg JF - OR News Y1 - 2006 VL - 28 SP - 71 EP - 72 ER - TY - GEN A1 - Eisenblätter, Andreas A1 - Fügenschuh, Armin A1 - Koch, Thorsten A1 - Koster, Arie M.C.A. A1 - Martin, Alexander A1 - Pfender, Tobias A1 - Wegel, Oliver A1 - Wessäly, Roland T1 - Modelling Feasible Network Configurations for UMTS N2 - 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. T3 - ZIB-Report - 02-16 KW - UMTS KW - radio interface KW - network planning KW - configuration KW - perfect power control KW - mathematical model KW - mixed integer programming KW - MOMENTUM KW - IST-20 Y1 - 2002 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-6837 ER - TY - GEN A1 - Eisenblätter, Andreas A1 - Fügenschuh, Armin A1 - Geerdes, Hans-Florian A1 - Junglas, Daniel A1 - Koch, Thorsten A1 - Martin, Alexander T1 - Optimization Methods for UMTS Radio Network Planning N2 - 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. T3 - ZIB-Report - 03-41 Y1 - 2003 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-7637 ER - TY - GEN A1 - Fügenschuh, Armin A1 - Hiller, Benjamin A1 - Humpola, Jesco A1 - Koch, Thorsten A1 - Lehmann, Thomas A1 - Schwarz, Robert A1 - Schweiger, Jonas A1 - Szabó, Jácint T1 - Gas Network Topology Optimization for Upcoming Market Requirements N2 - 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. T3 - ZIB-Report - 11-09 KW - Mathematical Optimization KW - Gas Distribution Networks KW - Topology Planning Y1 - 2011 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-12348 ER - TY - CHAP A1 - Birkhofer, Herbert A1 - Fügenschuh, Armin A1 - Günther, Ute A1 - Junglas, Daniel A1 - Martin, Alexander A1 - Sauer, Thorsten A1 - Ulbrich, Stefan A1 - Wäldele, Martin A1 - Walter, Stephan ED - Haasis, Hans-Dietrich ED - Kopfer, Herbert ED - Schönberger, Jörn T1 - Topology- and shape-optimization of branched sheet metal products T2 - Operations Research Proceedings Y1 - 2006 SP - 327 EP - 336 ER - TY - CHAP A1 - Fügenschuh, Armin A1 - Hess, Wolfgang A1 - Martin, Alexander A1 - Ulbrich, Stefan ED - Groche, P. T1 - Diskrete und kontinuierliche Modelle zur Topologie- und Geometrie-Optimierung von Blechprofilen T2 - Sonderforschungsbereich 666 Y1 - 2007 SP - 37 EP - 47 ER - TY - CHAP A1 - Fügenschuh, Armin A1 - Göttlich, Simone A1 - Herty, Michael ED - Oberweis, A. ED - Weinhardt, C. ED - Gimpel, H. ED - Koschmider, A. ED - Pankratius, V. ED - Schnizler, B. T1 - Water Contamination Detection T2 - eOrganisation Y1 - 2007 SP - 501 EP - 518 ER - TY - CHAP A1 - Fügenschuh, Armin A1 - Höfler, Benjamin ED - Gottlieb, J. ED - Raidl, G. T1 - Parametrized GRASP Heuristics for Three-Index Assignment T2 - Evolutionary Computation in Combinatorial Optimization Y1 - 2006 SP - 61 EP - 72 ER - TY - CHAP A1 - Fügenschuh, Armin ED - Waldmann, Karl-Heinz ED - Stocker, Ulrike T1 - Scheduling Buses and School Starting Times T2 - Operations Research Proceedings Y1 - 2007 SP - 17 EP - 22 ER - TY - GEN A1 - Borndörfer, Ralf A1 - Fügenschuh, Armin A1 - Klug, Torsten A1 - Schang, Thilo A1 - Schlechte, Thomas A1 - Schülldorf, Hanno T1 - The Freight Train Routing Problem N2 - 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. T3 - ZIB-Report - 13-36 KW - Mixed-Integer Nonlinear Programming KW - multi-commodity flows KW - freight train routing Y1 - 2013 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-18991 ER - TY - CHAP A1 - Eisenblätter, Andreas A1 - Fügenschuh, Armin A1 - Koch, Thorsten A1 - Koster, Arie M.C.A. A1 - Martin, Alexander A1 - Pfender, Tobias A1 - Wegel, Oliver A1 - Wessäly, Roland ED - G. Anandalingam, S. T1 - Mathematical Model of Feasible Network Configurations for UMTS T2 - Telecommunications network design and management Y1 - 2002 SP - 1 EP - 24 PB - Kluwer ER - TY - GEN A1 - Eisenblätter, Andreas A1 - Fügenschuh, Armin A1 - Geerdes, Hans-Florian A1 - Koch, Thorsten A1 - Türke, Ulrich A1 - Meijerink, Ellen T1 - XML Data Specification and Documentation Y1 - 2003 PB - IST-2000-28088 MOMENTUM Technical Report ER - TY - CHAP A1 - Fügenschuh, Armin ED - Görts, W. T1 - Von Mikrochips, Proteinen und Schulbussen – Projektproseminare im Mathematikstudium T2 - Projektveranstaltungen in Mathematik, Informatik und Ingenieurwissenschaften Y1 - 2003 SP - 21 EP - 43 PB - UVW UniversitätsVerlagWebler, Bielefeld ER - TY - GEN A1 - Fügenschuh, Armin T1 - Einsatzplanung von ÖPNV-Bussen Y1 - 2002 PB - Mathematische Modellierung mit Schülern - Die Modellierungswoche im Kloster Höchst. M. Kiehl, A. Schich, S. Purpus (Hrsg.). Zentrum für Mathematik, Bensheim ER - TY - GEN A1 - Fügenschuh, Armin T1 - Proteinfaltung Y1 - 2001 PB - Mathematische Modellierung mit Schülern - Die Modellierungswoche im Kloster Höchst. M. Kiehl, A. Schich, S. Purpus (Hrsg.). Zentrum für Mathematik, Bensheim ER - TY - GEN A1 - Fügenschuh, Armin T1 - Optimale Schulanfangszeiten Y1 - 2006 PB - Bild der Wissenschaft 11/2006, Sonderbeilage zum Klaus-Tschira-Preis ER - TY - CHAP A1 - Fügenschuh, Armin A1 - Martin, Alexander A1 - Stöveken, Peter ED - Bixby, Robert E. ED - Simchi-Levi, D. ED - Martin, Alexander ED - Zimmermann, U. T1 - Integrated Optimization of School Starting Times and Public Bus Services T2 - Mathematics in the Supply Chain Y1 - 2004 ER - TY - CHAP A1 - Eisenblätter, Andreas A1 - Fügenschuh, Armin A1 - Geerdes, Hans-Florian A1 - Junglas, Daniel A1 - Koch, Thorsten A1 - Martin, Alexander T1 - Integer Programming Methods for UMTS Radio Network Planning T2 - Proceedings of the WiOpt’04, Cambridge, UK Y1 - 2004 ER -