Efficiencies in Freight & Passenger Routing & Scheduling

Details

• Creators:
  Dessouky, Maged M. ; Zou, Han
• Corporate Creators:
  University of Southern California. Dept. of Industrial and Systems Engineering
• Corporate Contributors:
  United States. Department of Transportation. Research and Innovative Technology Administration
• Subject/TRT Terms:
  Advanced Driver Information Systems Research Hub Data And Information Technology Dispatching Forecasting Freight Transportation Heuristic Methods I72: Traffic And Transport Planning Optimization Route Choice Scheduling Truck Traffic

  More +
• Resource Type:
  Tech Report
• Geographical Coverage:
  California;United States
• Edition:
  Final Report
• Corporate Publisher:
  METRANS Transportation Center (Calif.)
• Abstract:
  The problem we study concerns routing a fleet of capacitated vehicles in real time to collect shipment orders placed by a known set of customers. On each day of operation, only a subset of all customers request service. Some of these requests are known at the beginning of the day, while the rest arrive dynamically during the day. It is not known when and from which customers these dynamic requests may come from. An example of such an application is the daily operation of a trucking company that consolidates shipments from multiple suppliers. The objective of this dynamic vehicle routing problem (DVRP) is three fold: first, to minimize the impact (on total travel distance) of knowing only partial information; second, to maximize the flexibility of the existing routes in a dynamic environment; third, to provide fast responses to dynamic customer requests. Thus, we propose an optimization-based, look-ahead dynamic vehicle routing framework that periodically re-optimizes the current vehicle routes by using both the known and forecasted information. Heuristic algorithms are designed to construct an initial solution, improve the initial solution, and adjust the waiting time along the vehicle routes. We perform simulation experiments on well-known benchmark problem instances in the literature. For each instance, we compare the quality of our solution with other routing strategies. We see that the look-ahead routing strategy with forecasting of future requests outperforms a routing strategy that only makes use of the known demand information, in terms of total travel distance for instances with relatively fewer advance requests and more dynamic requests. Thus the look-ahead dynamic routing strategy shows its merits for problems with high level of uncertainty. Overall our proposed approach could generate routing solutions that could reduce freight vehicle miles traveled, thus minimizing the impact of freight on passenger travel since they primarily share the same road network, especially in major urban centers like Los Angeles.
• Format:
  PDF
• Collection(s):
  University Transportation Centers US Transportation Collection
• Main Document Checksum:
  urn:sha-512:1cfbc69d191dcfc7e7b5c5d8448d552ba729b8d07dbee7306dd83304e730783251aeecea456106dee6eb92f1758621f1d7a1d502a4bf6f1f11800ea2f838875f
• Download URL:
  https://rosap.ntl.bts.gov/view/dot/29160/dot_29160_DS1.pdf
• File Type:
  [PDF - 1.16 MB ]