Road network monitoring: algorithms and a case study

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.

[1]  Kenneth J. Dueker,et al.  A GEOGRAPHIC INFORMATION SYSTEM FRAMEWORK FOR TRANSPORTATION DATA SHARING , 2000 .

[2]  Richard W. Eglese,et al.  Routeing Winter Gritting Vehicles , 1994, Discret. Appl. Math..

[3]  G. Lapalme,et al.  A parallel insert method for the capacitated arc routing problem , 1984 .

[4]  Bruce L. Golden,et al.  Computational experiments with algorithms for a class of routing problems , 1983, Comput. Oper. Res..

[5]  Michel Mittaz Problèmes de cheminements optimaux dans les réseaux avec contraintes associées aux arcs , 2000 .

[6]  G. Ulusoy The fleet size and mix problem for capacitated arc routing , 1985 .

[7]  Bruce L. Golden,et al.  Capacitated arc routing problems , 1981, Networks.

[8]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Capacitated Arc Routing Problem , 2000, Oper. Res..

[9]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[10]  Martin Trépanier,et al.  Transit Itinerary Calculation on the Web: Based on a Transit User Information System , 2002 .

[11]  André Langevin,et al.  Transformations and Exact Node Routing Solutions by Column Generation , 2000 .

[12]  Erhan Erkut,et al.  Improving The Emergency Service Delivery In St. Albert , 2001 .

[13]  Moshe Dror,et al.  Combinatorial Optimization in a Cattle Yard: Feed Distribution, Vehicle Scheduling, Lot Sizing, and Dynamic Pen Assignment , 1998 .

[14]  Ángel Corberán,et al.  The capacitated arc routing problem. A heuristic algorithm , 1990 .

[15]  David Bernstein,et al.  Some map matching algorithms for personal navigation assistants , 2000 .

[16]  A. Tsakalidis,et al.  Integrating GIS, GPS and GSM technologies for the effective management of ambulances , 2001 .

[17]  M. Dror Arc Routing : Theory, Solutions and Applications , 2000 .

[18]  William E. Lorensen,et al.  Object-Oriented Modeling and Design , 1991, TOOLS.

[19]  Teresa M Adams,et al.  GUIDELINES FOR THE IMPLEMENTATION OF MULTIMODAL TRANSPORTATION LOCATION REFERENCING SYSTEMS , 2001 .

[20]  Michael F. Goodchild,et al.  GIS and Transportation: Status and Challenges , 2000, GeoInformatica.