253 resultados para Kombinatorische Optimierung
Resumo:
Magdeburg, Univ., Fak. für Mathematik, Diss., 2011
Resumo:
Magdeburg, Univ., Fak. für Mathematik, Habil.-Schr., 2012
Resumo:
When designing metaheuristic optimization methods, there is a trade-off between application range and effectiveness. For large real-world instances of combinatorial optimization problems out-of-the-box metaheuristics often fail, and optimization methods need to be adapted to the problem at hand. Knowledge about the structure of high-quality solutions can be exploited by introducing a so called bias into one of the components of the metaheuristic used. These problem-specific adaptations allow to increase search performance. This thesis analyzes the characteristics of high-quality solutions for three constrained spanning tree problems: the optimal communication spanning tree problem, the quadratic minimum spanning tree problem and the bounded diameter minimum spanning tree problem. Several relevant tree properties, that should be explored when analyzing a constrained spanning tree problem, are identified. Based on the gained insights on the structure of high-quality solutions, efficient and robust solution approaches are designed for each of the three problems. Experimental studies analyze the performance of the developed approaches compared to the current state-of-the-art.
Resumo:
The focus of this thesis is to contribute to the development of new, exact solution approaches to different combinatorial optimization problems. In particular, we derive dedicated algorithms for a special class of Traveling Tournament Problems (TTPs), the Dial-A-Ride Problem (DARP), and the Vehicle Routing Problem with Time Windows and Temporal Synchronized Pickup and Delivery (VRPTWTSPD). Furthermore, we extend the concept of using dual-optimal inequalities for stabilized Column Generation (CG) and detail its application to improved CG algorithms for the cutting stock problem, the bin packing problem, the vertex coloring problem, and the bin packing problem with conflicts. In all approaches, we make use of some knowledge about the structure of the problem at hand to individualize and enhance existing algorithms. Specifically, we utilize knowledge about the input data (TTP), problem-specific constraints (DARP and VRPTWTSPD), and the dual solution space (stabilized CG). Extensive computational results proving the usefulness of the proposed methods are reported.
Resumo:
Magdeburg, Univ., Fak. für Maschinenbau, Diss., 2011
Resumo:
Gasket, flange, optimization, blow-out-safety, leakage
Resumo:
Robuste Regelung, Schwingungsregelung, Smart-Structures, Quantitative Feedback Theory, Optimierung
Resumo:
Electrical welding torch, MAG-torch, MIG-torch, TIG-torch
Resumo:
Magdeburg, Univ., Fak. für Maschinenbau, Diss., 2011
Resumo:
Magdeburg, Univ., Fak. für Elektrotechnik und Informationstechnik, Diss., 2010
Resumo:
Parapoxvirus-ovis, Bovine Kidney Cell Line, Fed-Batch, Dialysis, Volume-Expanded-Fed Batch, Scale-Up, Shear-Force, Membrane Aeration
Resumo:
Wissensmanagement, Deutsche Telekom, T-Com, Prozessmanagement, Organisation, implizites Wissen, explizites Wissen
Resumo:
Value-added process, Prcess optimisation, imultaneous Endineering, Concurrent Engineering, Process Factors, Procecc modelling
Resumo:
Magdeburg, Univ., Fak. für Maschinenbau, Diss., 2011
Resumo:
Magdeburg, Univ., Fak. für Informatik, Diss., 2015