2026-07-21T19:27:34Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3541 2024-03-06T10:28:59Z ddc:004 open_access

A Case Study on Optimizing Toll Enforcements on Motorways Borndörfer, Ralf Sagnol, Guillaume Swarat, Elmar Vehicle Routing Problem Duty Rostering Integer Programming Operations Research 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Ralf Borndörfer and Guillaume Sagnol and Elmar Swarat 2012 Is Part Of OASIcs, Volume 22, 3rd Student Conference on Operational Research (2012) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.SCOR.2012.1 urn:nbn:de:0030-drops-35418 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SCOR.2012.1 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode