90B06 Transportation, logistics
Filtern
Erscheinungsjahr
Dokumenttyp
- ZIB-Report (54) (entfernen)
Volltext vorhanden
- ja (54)
Gehört zur Bibliographie
- nein (54)
Schlagworte
- column generation (8)
- Optimierung (7)
- line planning (5)
- online optimization (5)
- real-time (5)
- ADAC (4)
- competitive analysis (4)
- soft time windows (4)
- vehicle dispatching (4)
- Column Generation (3)
- Competitive Analysis (3)
- Integer Programming (3)
- Online Optimization (3)
- Optimization (3)
- combinatorial optimization (3)
- elevator (3)
- integer programming (3)
- online (3)
- Fallstudie (2)
- Linienplan (2)
- Linienplanung (2)
- Netzwerkaggregation (2)
- Online-Optimierung (2)
- Passenger routing (2)
- Periodic timetabling (2)
- Public transport (2)
- Train Timetabling Problem (2)
- Vehicle Routing Problem (2)
- branch and bound (2)
- elevator group control (2)
- network aggregation (2)
- pricing (2)
- public transport (2)
- railway track allocation (2)
- rapid branching (2)
- real world data (2)
- real-world problems (2)
- öffentlicher Verkehr (2)
- Aufzugsgruppensteuerung (1)
- Aufzugssteuerung (1)
- Aufzüge (1)
- Automatic Storage System (1)
- Bicriteria Optimization (1)
- Bundle Method (1)
- Constraint Shortest Paths Problem (1)
- Container Terminal (1)
- Data Library (1)
- Dial-a-Ride-Problem (1)
- Dienstplanung (1)
- Discrete Mathematics (1)
- Duty Roster Planning (1)
- Duty Rostering (1)
- Duty Scheduling (1)
- Echtzeit-Optimierung (1)
- Echzeitoptimierung (1)
- Exakte Reoptimierung (1)
- Fahrplan (1)
- Fahrplanung (1)
- Flugzeugumlaufplanung (1)
- Ganzzahlige Programmierung (1)
- Heuristics (1)
- Hochregallagerbediengeräte (1)
- Intermediate Storage Area (1)
- Kommissioniermobile (1)
- Kompetitive Analyse (1)
- Landside operation (1)
- Latency (1)
- Logistik (1)
- Nahverkehr (1)
- Online Algorithmen (1)
- Online Optimierung (1)
- Online optimization (1)
- Online-Algorithm (1)
- Online-Algorithms (1)
- Onlineoptimierung (1)
- Operations Research (1)
- Preisplanung (1)
- Problembibliothek (1)
- Proximale Bündelmethode (1)
- Railway Track Allocation (1)
- Rapid Branching (1)
- Rapid-Branching-Heuristik (1)
- Realtime Optimization (1)
- Robust Optimization (1)
- Simplon Korridor (1)
- Simplon corridor (1)
- Simulation (1)
- Spaltenerzeugung (1)
- Storage space allocation (1)
- Survey (1)
- Tail Assignment (1)
- Taktfahrplan (1)
- Toll Enforcement (1)
- Transportation Systems (1)
- Trassenallokation (1)
- Trassenallokationsproblem (1)
- Traveling Repairman (1)
- Traveling Salesman Problem (1)
- Vehicle Routing (1)
- Yard crane scheduling (1)
- Zielorientierte Planung (1)
- Zielrufsteuerung (1)
- applications of integer programming (1)
- bundle method (1)
- case study (1)
- competitiveness (1)
- computational complexity (1)
- convex relaxation (1)
- destination call system (1)
- discrete optimization (1)
- diskrete Optimierung (1)
- duty scheduling (1)
- duty templates (1)
- elevator control (1)
- exact reoptimation (1)
- ganzzahlige Programmierung (1)
- high load (1)
- hyperassignments (1)
- hypergraphs (1)
- kompetitive Analyse (1)
- large scale optimization (1)
- large scale problems (1)
- logistics (1)
- lower bounds (1)
- macroscopic railway modeling (1)
- makroskopische Bahnmodellierung (1)
- mixed-integer-programming (1)
- network models (1)
- optimality gap (1)
- passenger routing (1)
- periodic timetable (1)
- policy (1)
- polyhedral combinatorics (1)
- public transit (1)
- public transportation (1)
- randomized algorithms (1)
- real time optimation (1)
- reoptimization (1)
- robuste Optimierung (1)
- rolling-stock-planning (1)
- simulation (1)
- simulation studies (1)
- stochastic demand (1)
- supply chain management, supply network optimization, mixed-integer linear programming, primal heuristics, numerical stability, large-scale optimization (1)
- timetabling (1)
- transportation planning (1)
- trip timetable (1)
- vehicle rotation planning (1)
- vehicle routing (1)
Institut
Umsteigen ohne Warten
(2017)
Wir stellen einen mathematischen Optimierungsansatz zur Berechnung von periodischen Taktfahrplänen vor, bei dem die Umsteigezeiten unter
Berücksichtigung des Passagierverhaltens minimiert werden. Wir untersuchen damit den Einfluss wichtiger Systemparameter und Verhaltensmuster auf die Beförderungsqualität.
SAP's decision support systems for optimized supply network planning rely on mixed-integer programming as the core engine to compute optimal or near-optimal solutions. The modeling flexibility and the optimality guarantees provided by mixed-integer programming greatly aid the design of a robust and future-proof decision support system for a large and diverse customer base. In this paper we describe our coordinated efforts to ensure that the performance of the underlying solution algorithms matches the complexity of the large supply chain problems and tight time limits encountered in practice.
The task of periodic timetabling is to schedule the trips in a public transport system by determining arrival and departure times at every station such that travel and transfer times are minimized. To date, the optimization literature generally assumes that passengers do not respond to changes in the timetable, i.e., the passenger routes are fixed. This is unrealistic and ignores potentially valuable degrees of freedom. We investigate in this paper periodic timetabling models with integrated passenger routing. We show that different routing models have a huge influence on the quality of the entire system: Whatever metric is applied, the performance ratios of timetables w.r.t. to different routing models can be arbitrarily large. Computations on a real-world instance for the city of Wuppertal substantiate the theoretical findings. These results indicate the existence of untapped optimization potentials that can be used to improve the efficiency of public transport systems.
Wir illustrieren anhand des Liniennetzes der Stadt Potsdam das Potenzial mathematischer Methoden der Angebotsplanung. Wir zeigen,
dass das "bestmögliche" Verkehrsangebot stark von planerischen Vorgaben beeinflusst wird, mit denen man die Erreichung unterschiedlicher und teilweise gegenläufiger Ziele steuern kann. Die Komplexität des Systems führt zum Auftreten von Rückkoppelungseffekten, die man nicht mit Hilfe von Daumenregeln beherrschen kann. Vielmehr ist der Einsatz moderner Planungsverfahren in einer interdisziplinären Zusammenarbeit von politischen Entscheidungsträgern, Verkehrsingenieuren und Mathematikern notwendig, um die aktuellen Herausforderungen in der Verkehrsplanung zu meistern. Der Artikel dokumentiert einen Beitrag zum 7. ÖPNV Innovationskongress des Ministeriums für Verkehr und Infrastruktur des Landes Baden-Württemberg, der vom 9.-11. März 2015 in Freiburg stattfand.
The task of timetabling is to schedule the trips in a public transport system by determining periodic arrival and departure times at every station. The goal is to provide a service that is both attractive for passengers and can be operated economically. To date, timetable optimization is generally done with respect to fixed passenger routes, i.e., it is assumed that passengers do not respond to changes in the timetable. This is unrealistic and ignores potentially valuable degrees of freedom. We investigate in this paper periodic timetabling models with integrated passenger routing. We propose several models that differ in the allowed passenger paths and the objectives. We compare these models theoretically and report on computations on real-world instances for the city of Wuppertal.
Mathematik im Verkehr
(2014)
Nach einem kurzen Abriss über die Bedeutung des Verkehrssektors als eine wichtige Schlüsseltechnologie im gesamten Verlauf der Menschheitsgeschichte skizzieren wir die Rolle der Mathematik für Verkehr und Transport. Wir spekulieren dann über zukünftige Entwicklungen, insbesondere im Bereich des öffentlichen Personenverkehrs, und begründen, dass die in diesem Bereich anstehenden Herausforderungen nur mit dem Einsatz mathematischer Methoden angemessen bewältigt werden können. Die demographischen Prozesse, die in verschiedenen Teilen der Welt unterschiedlich verlaufen, wie z.B. Überalterung in Europa oder dynamische Trends zu Megastädten in Entwicklungsländern, sich ändernde Lebens- und Produktionsverhältnisse, stark wachsender Bedarf nach Mobilität und enormes Anwachsen der Komplexität der Verkehrsplanung und -durchführung, machen einen verstärkten Zugriff auf mathematische Modellierung, Simulation und Optimierung notwendig. Diese Entwicklung stellt sowohl große Herausforderungen an die Mathematik, wo vielfach noch keine geeigneten Methoden vorhanden sind, als auch an die Praktiker im Bereich von Verkehr und Transport, die sich mit neuen Planungs- und Steuerungstechnologien befassen und diese effizient einsetzen müssen. Hier wird intensive Kooperation zwischen vielen beteiligten Akteuren gefragt sein.
We propose a novel extended formulation for the line planning problem in public transport. It is based on a new concept of frequency configurations that account for all possible options to provide a required transportation capacity on an infrastructure edge. We show that this model yields a strong LP relaxation. It implies, in particular, general classes of facet defining inequalities for the standard model.
In this paper we present the problem of computing optimal tours of toll inspectors on German motorways. This problem is a special type of vehicle routing problem and builds up an integrated model, consisting of a tour
planning and a duty rostering part. The tours should guarantee a network-wide control whose intensity is proportional to given spatial and time dependent traffic distributions. We model this using a space-time network
and formulate the associated optimization problem by an integer program (IP). Since sequential approaches fail, we integrated the assignment of crews to the tours in our model. In this process all duties of a crew member must fit in a feasible roster. It is modeled as a Multi-Commodity Flow Problem in a directed acyclic graph, where specific paths correspond to
feasible rosters for one month. We present computational results in a
case-study on a German subnetwork which documents the practicability of our approach.
This paper provides a generic formulation for rolling stock planning
problems in the context of intercity passenger traffic. The main contributions
are a graph theoretical model and a Mixed-Integer-Programming
formulation that integrate all main requirements of the considered
Vehicle-Rotation-Planning problem (VRPP). We show that it is
possible to solve this model for real-world instances provided by our
industrial partner DB Fernverkehr AG using modern algorithms and
computers.
Rapid Branching
(2012)
We propose rapid branching (RB) as a general branch-and-bound heuristic
for solving large scale optimization problems in traffic and transport.
The key idea is to combine a special branching rule and a greedy node selection
strategy in order to produce solutions of controlled quality rapidly
and efficiently. We report on three successful applications of the method
for integrated vehicle and crew scheduling, railway track allocation, and
railway vehicle rotation planning.