Probabilistic analysis of a capacitated vehicle routing problem-I

Probabilistic analysis of a capacitated vehicle routing problem-I

0.00 Avg rating0 Votes
Article ID: iaor19942228
Country: Germany
Volume: 27
Start Page Number: 79
End Page Number: 87
Publication Date: Feb 1993
Journal: Optimization
Authors:
Keywords: computational analysis
Abstract:

A fleet of vehicles located at a service center must serve the demands of a set of customers. The amount delivered by each vehicle cannot exceed its capacity and a customer’s demand may not be split over more than one vehicle. In the present model, customers locations, as well as their demands are independent identically distributed. Simchi-Levi and Bramel determined the asymptotic value of the optimal solution in this model. The paper proves here a sharp rate of convergence to the asymptotic value.

Reviews

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