License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.SCOR.2012.1
URN: urn:nbn:de:0030-drops-35418
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2012/3541/
Go to the corresponding OASIcs Volume Portal

Borndörfer, Ralf ; Sagnol, Guillaume ; Swarat, Elmar

A Case Study on Optimizing Toll Enforcements on Motorways

pdf-format:
2.pdf (0.4 MB)

Abstract

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.

BibTeX - Entry

@InProceedings{borndrfer_et_al:OASIcs:2012:3541,
  author =	{Ralf Bornd{\"o}rfer and Guillaume Sagnol and Elmar Swarat},
  title =	{{A Case Study on Optimizing Toll Enforcements on Motorways}},
  booktitle =	{3rd Student Conference on Operational Research},
  pages =	{1--10},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-39-2},
  ISSN =	{2190-6807},
  year =	{2012},
  volume =	{22},
  editor =	{Stefan Ravizza and Penny Holborn},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2012/3541},
  URN =		{urn:nbn:de:0030-drops-35418},
  doi =		{10.4230/OASIcs.SCOR.2012.1},
  annote =	{Keywords: Vehicle Routing Problem, Duty Rostering, Integer Programming, Operations Research}
}

Keywords: Vehicle Routing Problem, Duty Rostering, Integer Programming, Operations Research
Collection: 3rd Student Conference on Operational Research
Issue Date: 2012
Date of publication: 26.06.2012

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI