-
Article
A note on extending the generic crew scheduling model of Beasley and Cao by deadheads and layovers
Crew scheduling is a highly complex combinatorial problem that has substantial and consequential economic importance in practice. Although the core structure of the problem is the same in many different areas ...
-
Article
Local search-based metaheuristics for the split delivery vehicle routing problem
The split delivery vehicle routing problem is a variant of the standard vehicle routing problem where the single-visit assumption is waived and a customer might be served on more than one vehicle tour. In this...
-
Article
A simple and efficient tabu search heuristic for solving the open vehicle routing problem
The open vehicle routing problem (VRP) is an immediate variant of the standard vehicle routing problem where the vehicle need not return to the depot after servicing its last customer. In this paper, we presen...
-
Article
Models and algorithms for solving combined vehicle and crew scheduling problems with rest constraints : an application to road feeder service planning in air cargo transportation
We present a mathematical model and two algorithms for solving a complex combined vehicle and crew scheduling problem. The problem arises in the area of road feeder service (RFS) for air cargo transportation w...
-
Chapter
O&D revenue management in cargo airlines—a mathematical programming approach
In this paper we present a mathematical programming based approach for revenue management in cargo airlines. The approach is based on a modified version of a multicommodity network flow model which has been de...
-
Article
O&D revenue management in cargo airlines—a mathematical programming approach
In this paper we present a mathematical programming based approach for revenue management in cargo airlines. The approach is based on a modified version of a multicommodity network flow model which has been de...
-
Chapter and Conference Paper
AGA-Konzept und AGAPE-Toolbox und deren Verwendung im Rahmen der prototypischen Entwicklung der DSS-Komponente eines Leitstandes zur Feinsteuerung
Das Problem der Parametrisierung ist für die Integration Genetischer Algorithmen (GA) in Standard-Software kritisch. In dieser Arbeit stellen wir kurz das am WINFORS entwickelte Konzept der Adaptiven Genetisch...
-
Chapter and Conference Paper
Flugroutenplanung im Cargo Sektor
Wir beschreiben die spezifischen Charakteristika der Produktionsplanungsproblematik in der Luftfrachtindustrie sowie die methodische Basis zur Flugplanbewertung und -generierung innerhalb eines spezifischen De...
-
Article
Buchbesprechungen
-
Article
Book review
-
Article
A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints
In this paper we deal with the following special vehicle routing problem with time window constraints: Given a non-homogeneous fleet of vehicles and a fixed set of customers, during one time period, i.e. a day...
-
Chapter and Conference Paper
BAYTHE-NET — eine Modell- und Methodenbank zur Graphen- und Netzwerkoptimierung
We give an outline of the architecture and functionality of BAYTHE-NET a microcomputer-based interactive system for graph manipulation and network optimization.
-
Chapter and Conference Paper
Über die Matching Relaxation für das Set Partitioning Problem
Sei A eine (m×n) 0–1 Matrix und c ∊ ℝn ein Kostenvektor, dann läßt sich das Set Partitioning Problem wie folgt formulieren:
(SP) ... -
Chapter and Conference Paper
On the Construction of the Set of K-best Matchings and Their Use in Solving Constrained Matching Problems
For constructing the set of K-best solutions for a combinatorial optimization problem so-called partitioning schemes have been developed in literature which require the iterative solution of the basic optimizatio...
-
Chapter and Conference Paper
Einige Bemerkungen zu algorithmischen Verbesserungen für den Preflow-Push-Ansatz zur Bestimmung maximaler Flüsse
Sei G = (V,E) ein gerichteter Graph und c(u,v) ∈ N die Flußkapazität für jede Kante (u,v) ∈ E. In V seien zwei Knoten ausgezeichnet, die Quelle s und die Senke t, s ≠ t, wobei gelte
-
Chapter and Conference Paper
An Evaluation of Algorithmic Refinements and Proper Data Structures for the Preflow-Push Approach for Maximum Flow
Following the milestone paper by Goldberg on the preflow-push algorithm for solving maximum flow problems on networks, quite a number of refinements have been suggested in literature which reduce the computati...
-
Chapter and Conference Paper
Matching problems with Knapsack side constraints
We present and compare procedures for the approximate solution of the weighted matching problem with side constraints. The approaches are based on Lagrangean relaxation as well as on Lagrangean decomposition. ...
-
Article
Solving (large scale) matching problems combinatorially
In this paper we describe computational results for a modification of the shortest augmenting path approach for solving large scale matching problems. Using a new assignment start procedure and the two-phase s...
-
Article
Vorwort des Hauptherausgebers
-
Article
Buchbesprechungen
