|
|
|
Publications
W. Maden, R.W. Eglese and D. Black (2009) Vehicle routing and scheduling with time varying data: a case study; Journal of the Operational Research Society, 14 October 2009
Abstract
A heuristic algorithm is described for vehicle routing and scheduling problems to minimise the total travel time, where the time required for a vehicle to travel along any road in the network varies according to the time of travel. The variation is caused by congestion that is typically greatest during morning and evening rush hours. The algorithm is used to schedule a fleet of delivery vehicles operating in the South West of the United Kingdom for a sample of days. The results demonstrate how conventional methods that do not take time-varying speeds into account when planning, except for an overall contingency allowance, may still lead to some routes taking too long. The results are analysed to show that in the case study using the proposed approach can lead to savings in CO2 emissions of about 7%.
A. Sbihi and R.W. Eglese (2007) The Relationship between Vehicle Routing and Scheduling and Green Logistics - A Literature Survey Green Logistics WM6 Report, Lancaster
Abstract
The basic Vehicle Routing and Scheduling Problem (VRSP) is described followed by an outline of solution approaches. Different variations of the basic VRSP are examined that involve the consideration of additional constraints or other changes in the structure of the appropriate model. An introduction is provided to Green Logistics issues that are relevant to vehicle routing and scheduling including discussion of the environmental objectives that should be considered. Particular consideration is given to VRSP models that relate to environmental issues including the time dependent VRSP, the transportation of hazardous materials and dynamic VRSP models. Finally some conclusions are drawn about further research needs in this area and the relation to road pricing.
A. Sbihi and R. W. Eglese (2007)
Combinatorial optimization and Green Logistics;
4OR:
A Quarterly Journal of Operations Research, Volume 5, Number 2, Pages 99-116, ISSN 1619-4500
R. Eglese, W. Maden, A. Slater (2006) A Road TimetableTM to aid vehicle routing and scheduling;
Computers & Operations Research 33, 3508-3519
Abstract
Both within and between urban conurbations, the time of a journey and the corresponding shortest path in a road network from an origin to a destination may depend on the time of the day, the day of the week and the season of the year. Significant journey time differences occur mainly due to recurring instances and variations in levels of traffic congestion throughout the year. This paper examines the issues involved in constructing a database of road times for a road network that uses time-dependent data on the travel times for individual roads in the network to provide the expected times and distances between locations for journeys starting at different times. The benefits of time-dependent vehicle routing and scheduling systems are demonstrated by using real-world data for the road network in the north west of England.
update 30 October 2009
|