TY - JOUR
T1 - THE PERIODIC GREEN VEHICLE ROUTING PROBLEM WITH CONSIDERING OF TIME-DEPENDENT URBAN TRAFFIC AND TIME WINDOWS
TT -
JF - IUST
JO - IUST
VL - 7
IS - 1
UR - http://ijoce.iust.ac.ir/article-1-289-en.html
Y1 - 2017
SP - 143
EP - 156
KW - periodic green vehicle routing problem
KW - time-dependent urban traffic
KW - multiple trip
KW - carbon dioxide emission
KW - time window.
N2 - The travel times among demand points are strongly influenced by traffic in a supply chain. Due to this fact, the service times for customers are variable. For this reason, service time is often changes over a time interval in a real environment. In this paper, a time-dependent periodic green vehicle routing problem (VRP) considering the time windows for serving the customers and multiple trip is developed with this assumption that urban traffic would disrupt timely services. The objective function of proposed problem is to minimize the total amount of carbon dioxide emissions produced by the vehicle, earliness and lateness penalties costs and costs of used vehicles. At first, a novel linear integer mathematical model is formulated and then the model is validated via solving some test problems by CPLEX solver. Finally, the sensitivity analysis is carried out to study the role of two critical parameters in the optimal solution.
M3
ER -