Urban Freight Truck Routing under Stochastic Congestion and Emission Considerations

• Main Authors: Taesung Hwang, Yanfeng Ouyang
• Format: Article
• Language: English
• Published: MDPI AG 2015-05-01
• Series: Sustainability
• Subjects: truck emission; urban freight delivery; stochastic shortest path problem; dynamic programming algorithm
• Online Access: http://www.mdpi.com/2071-1050/7/6/6610

Freight trucks are known to be a major source of air pollutants as well as greenhouse gas emissions in U.S. metropolitan areas, and they have significant effects on air quality and global climate change. Emissions from freight trucks during their deliveries should be considered by the trucking service sector when they make routing decisions. This study proposes a model that incorporates total delivery time, various emissions including CO2, VOC, NOX, and PM from freight truck activities, and a penalty for late or early arrival into the total cost objective of a stochastic shortest path problem. We focus on urban transportation networks in which random congestion states on each link follows an independent probability distribution. Our model finds the best truck routing on a given network so as to minimize the expected total cost. This problem is formulated into a mathematical model, and two solution algorithms including a dynamic programming approach and a deterministic shortest path heuristic are proposed. Numerical examples show that the proposed approach performs very well even for the large-size U.S. urban networks.