Dynamic Routing: Anticipation of Emission-Sensitive Traffic Management

Delivery companies are affected by emission-sensitive traffic management systems. These systems are installed in cities to react instantly to emission hot-spots through adapting traffic light programs at intersections. This results in a change of the travel times for the delivery vehicle. In this paper, the authors model the problem in a dynamic vehicle routing problem with stochastic transition of deterministic travel time matrices. To solve this problem, the authors apply approximate value iteration, a method of approximate dynamic programming, to anticipate future travel time matrix changes in dynamic routing decisions. The authors vary the approach in the level of information about the state of the traffic management system. This allows to distinguish the required information for the routing decisions. Further, the authors compare the dynamic and anticipatory routing policies with a static a priori routing. Computational studies show an improved tour duration of routing with traffic management information over the a priori routing by up to 6.5%. The authors further show that an efficient representation of the traffic management system status in the approximate value iteration approach is mandatory to achieve sufficient anticipation.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01636297
  • Record Type: Publication
  • Files: TRIS
  • Created Date: May 17 2017 4:50PM