10.4230/OASICS.SCOR.2012.1
Borndörfer, Ralf
Ralf
Borndörfer
Sagnol, Guillaume
Guillaume
Sagnol
Swarat, Elmar
Elmar
Swarat
A Case Study on Optimizing Toll Enforcements on Motorways
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2012
Article
Vehicle Routing Problem
Duty Rostering
Integer Programming
Operations Research
Ravizza, Stefan
Stefan
Ravizza
Holborn, Penny
Penny
Holborn
2012
2012-06-26
2012-06-26
2012-06-26
en
urn:nbn:de:0030-drops-35418
10.4230/OASIcs.SCOR.2012
978-3-939897-39-2
2190-6807
10.4230/OASIcs.SCOR.2012
OASIcs, Volume 22, SCOR 2012
3rd Student Conference on Operational Research
2012
22
1
1
10
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Ravizza, Stefan
Stefan
Ravizza
Holborn, Penny
Penny
Holborn
2190-6807
Open Access Series in Informatics (OASIcs)
2012
22
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
10 pages
438092 bytes
application/pdf
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
info:eu-repo/semantics/openAccess
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.
OASIcs, Vol. 22, 3rd Student Conference on Operational Research, pages 1-10