A Case Study on Optimizing Toll Enforcements on Motorways

  • 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.

Export metadata

  • Export Bibtex
Metadaten
Author:Ralf Borndörfer, Guillaume Sagnol, Elmar Swarat
Document Type:In Proceedings
Parent Title (English):3rd Student Conference on Operational Research
Volume:22
First Page:1
Last Page:10
Series:OpenAccess Series in Informatics (OASIcs)
Year of first publication:2012
Preprint:urn:nbn:de:0297-zib-15498
DOI:http://dx.doi.org/10.4230/OASIcs.SCOR.2012.1

$Rev: 13581 $