Road network monitoring: algorithms and a case study

  • Authors:
  • Fabien Marzolf;Martin Trépanier;André Langevin

  • Affiliations:
  • Department of Mathematics and Industrial Engineering and GERAD, École Polytechnique de Montréal, Montréal, Qué., Canada;Department of Mathematics and Industrial Engineering and GERAD, École Polytechnique de Montréal, Montréal, Qué., Canada;Department of Mathematics and Industrial Engineering and GERAD, École Polytechnique de Montréal, Montréal, Qué., Canada

  • Venue:
  • Computers and Operations Research
  • Year:
  • 2006

Quantified Score

Hi-index 0.01

Visualization

Abstract

Road network monitoring is an activity conducted daily by the Ministry of Transportation of Quebec. The complete network must be monitored every 2 weeks. In this setting, the usual objective in arc routing of minimizing the total travel distance is irrelevant. The vehicles are equipped with global positioning systems (GPS) locating devices to monitor events and trace routes. Since most planned route are not completed because of events on the network, there is a need to continuously re-plan and re-schedule routes. We developed a methodology to achieve this task by gathering data from the GPS trace, matching it to the planned routes within a geographic information systems (GIS) and then use mathematical algorithms to propose a new schedule with new routes. The interurban road network studied consists in a hierarchy of three classes of roads that have different monitoring standards. We tested three different methods using different objectives depending on the operators' needs. Results show that the method that implies rescheduling based on assignment and reconstruction of routes with an arc-adding method gives the best coverage for each class of road.