Vehicle-routeing with time windows and time-varying congestion

Vehicle-routeing with time windows and time-varying congestion

0.00 Avg rating0 Votes
Article ID: iaor1992267
Country: United Kingdom
Volume: 42
Issue: 5
Start Page Number: 393
End Page Number: 400
Publication Date: May 1991
Journal: Journal of the Operational Research Society
Authors: ,
Keywords: transportation: road, Transportation: Road
Abstract:

This paper discusses vehicle-routeing and scheduling problems subject to time window restriction and time-varying traffic congestion. Time-varying congestion increases the complications of the problems and, in fact, makes it challenging even to find feasible solutions. Numerous heuristics have been developed for problems with time windows only, but few for those with both time windows and time-varying congestion. The authors identify a simple yet robust monotonicity property of arrival times, which allows the simplification of the computation. This property enhances the performance of existing heuristics. The feasibility check routines built upon this property considerably reduce computational burden.

Reviews

Required fields are marked *. Your email address will not be published.