Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route

Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route

0.00 Avg rating—0 Votes
Article ID: iaor2012904
Volume: 73
Issue: 2
Start Page Number: 323
End Page Number: 335
Publication Date: Feb 2012
Journal: Automation and Remote Control
Authors: ,
Keywords: graphs, combinatorial optimization
Abstract:

We propose approximate algorithms for routing problems with a bounded number of clients on each route (k‐VRP and Multi‐Depot k‐VRP). We derive estimates of the algorithms’ quality and conditions for their asymptotic exactness in the case of a complete graph in which the weights of the edges (arcs) are independent random variables with a common distribution function.

Reviews

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