Refine
Document Type
- ZIB-Report (4)
Language
- English (4)
Has Fulltext
- yes (4)
Is part of the Bibliography
- no (4)
Keywords
- Mixed Integer Programming (4) (remove)
Institute
Network Spot Checking Games: Theory and Application to Toll Enforcing in Transportation Networks
(2014)
We introduce the class of spot-checking games (SC games). These games model
problems where the goal is to distribute fare inspectors over a toll network.
In an SC game, the pure strategies of network users correspond to
paths in a graph, and the pure strategies of the inspectors
are subset of edges to be controlled.
Although SC games are not zero-sum, we show that a Nash equilibrium
can be computed by linear programming.
The computation of a strong Stackelberg equilibrium is
more relevant for this problem, but we show that this is NP-hard.
However, we give some bounds on the \emph{price of spite},
which measures how the
payoff of the inspector
degrades when committing to a Nash equilibrium.
Finally, we demonstrate the quality of these bounds for a real-world application,
namely the enforcement of a truck toll on German motorways.
We present a game-theoretic approach to optimize the strategies of toll enforcement
on a motorway network. In contrast to previous approaches,
we consider a network with an arbitrary
topology, and we handle the fact that
users may choose their Origin-Destination path; in particular they may take a detour to
avoid sections with a high control rate. We show that a Nash equilibrium can be
computed with an LP (although the game is not zero-sum), and we give a MIP for the computation
of a Stackelberg equilibrium. Experimental results based on an application to the
enforcement of a truck toll on German motorways are presented.
We introduce a concurrent solver for the periodic event scheduling problem (PESP). It combines mixed integer programming techniques, the modulo network simplex method, satisfiability approaches, and a new heuristic based on maximum cuts. Running these components in parallel speeds up the overall solution process. This enables us to significantly improve the current upper and lower bounds for all benchmark instances of the library PESPlib.
This paper provides a highly integrated solution approach for rolling stock
planning problems in the context of intercity passenger traffic. The main
contributions are a generic hypergraph based mixed integer programming
model and an integrated algorithm for the considered rolling stock rotation
planning problem. The new developed approach is able to handle a very large
set of industrial railway requirements, such as vehicle composition,
maintenance constraints, infrastructure capacity, and regularity aspects.
By the integration of this large bundle of technical railway aspects, we show
that our approach has the power to produce implementable rolling stock
rotations for our industrial cooperation partner DB Fernverkehr.
This is the first time that the rolling stock rotations at DB Fernverkehr
could be optimized by an automated system utilizing advanced mathematical
programming techniques.