Skip to content

A Biased Randomised Clark and Wrights Savings Heuristic for the time dependent pollution routing problem

Research output: Contribution to conferenceAbstractpeer-review

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.
Original languageEnglish
Publication statusPublished - 15 Jul 2015
Event27th European Conference on Operational Research (EURO 2015) - UK, Glasgow, United Kingdom
Duration: 12 Jul 201515 Jul 2015


Conference27th European Conference on Operational Research (EURO 2015)
CountryUnited Kingdom

Related information

Relations Get citation (various referencing formats)

ID: 14983609