On the distance constrained vehicle routing problem

On the distance constrained vehicle routing problem

0.00 Avg rating0 Votes
Article ID: iaor1993553
Country: United States
Volume: 40
Issue: 4
Start Page Number: 790
End Page Number: 799
Publication Date: Jul 1992
Journal: Operations Research
Authors: , ,
Keywords: networks, transportation: general
Abstract:

The authors analyze the vehicle routing problem with constraints on the total distance traveled by each vehicle. Two objective functions are considered: minimize the total distance traveled by vehicles and minimize the number of vehicles used. The authors demonstrate a close relationship between the optimal solutions for the two objective functions and perform a worst case analysis for a class of heuristics. They present a heuristic that provides a good worst case result when the number of vehicles used is relatively small.

Reviews

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