Accepted author manuscript, 730 KB, PDF document
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Research output: Contribution to Journal/Magazine › Journal article › peer-review
}
TY - JOUR
T1 - Finding least fuel emission paths in a network with time-varying speeds
AU - Qian, Jiani
AU - Eglese, Richard
PY - 2014/1
Y1 - 2014/1
N2 - This article considers the problem of finding a route and schedule for a vehicle starting from a depot, visiting a set of customers, and returning to the depot, in atime-dependent network where the objective is to minimize the greenhouse gas emissions. In this formulation, the speeds of the vehicle as well as the routes chosen are decision variables subject to limits determined by the level of congestion on the roads at the time. Two methods are proposed to find the optimal strategy for a single route. One is a time-increment-based dynamicprogramming method, and the other is a new heuristic approach. In addition, a case study is carried out, which compares the performances of these methods, as well as the least polluting routes with the shortest time routes between two customer nodes.
AB - This article considers the problem of finding a route and schedule for a vehicle starting from a depot, visiting a set of customers, and returning to the depot, in atime-dependent network where the objective is to minimize the greenhouse gas emissions. In this formulation, the speeds of the vehicle as well as the routes chosen are decision variables subject to limits determined by the level of congestion on the roads at the time. Two methods are proposed to find the optimal strategy for a single route. One is a time-increment-based dynamicprogramming method, and the other is a new heuristic approach. In addition, a case study is carried out, which compares the performances of these methods, as well as the least polluting routes with the shortest time routes between two customer nodes.
KW - time-varying speeds
KW - fuel emissions optimization
KW - dynamic programming
KW - heuristics
U2 - 10.1002/net.21524
DO - 10.1002/net.21524
M3 - Journal article
VL - 63
SP - 96
EP - 106
JO - Networks
JF - Networks
SN - 0028-3045
IS - 1
ER -