The problem considered in this paper is the Time dependent Pollution Routing Problem (TDPRP) which deals with the problem of routing a fleet of vehicles to serve a set of customers with known demand and set time windows while considering the speed of each vehicle on each arc. We propose an integer linear programming model and the Biased Randomized Clarke and Wrights Savings Heuristic (BRCWSH) to solve the problem, explicitly taking into account traffic congestion. Using benchmark instances, computational experiments will be conducted to evaluate the performance of the proposed formulation and the solution quality generated using BRCWSH.
|Publication status||Published - 15 Jul 2015|
|Event||27th European Conference on Operational Research (EURO 2015) - UK, Glasgow, United Kingdom|
Duration: 12 Jul 2015 → 15 Jul 2015
|Conference||27th European Conference on Operational Research (EURO 2015)|
|Period||12/07/15 → 15/07/15|