A parallel route building algorithm for the vehicle routing and scheduling problem with time windows

A parallel route building algorithm for the vehicle routing and scheduling problem with time windows

0.00 Avg rating0 Votes
Article ID: iaor19961626
Country: Netherlands
Volume: 66
Issue: 3
Start Page Number: 331
End Page Number: 340
Publication Date: May 1993
Journal: European Journal of Operational Research
Authors: ,
Abstract:

This paper describes an insertion algorithm for the Vehicle Routeing and Scheduling Problem with Time Windows. This algorithm builds routes in parallel and uses a generalized regret measure over all unrouted customers in order to select the next candidate for insertion. numerical results on the standard set of problems of Solomon are reported as well as comparisons with his sequential algorithm.

Reviews

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