significance, was first introduced by Dantzig and Ramser (1959), then extensively studied in the literature in various versions and approached using alternative algorithms.
The problem consists, in its basic version, of designing a set of minimum cost-routes for a number of identical vehicles having a fixed capacity to serve a set of customers with known demands. Several structural constraints can be added to the basic CVRP giving rise to many variants such as time windows
for the customer to be served, limits on the lengths of the routes and limits on the time that a driver can work.
Since the CVRP is a NP-hard problem, three solution approaches are typically employed: heuristics, approximation and exact methods (Alba and Dorronsoro, 2006; Osman,
significance, was first introduced by Dantzig and Ramser (1959), then extensively studied in the literature in various versions and approached using alternative algorithms.The problem consists, in its basic version, of designing a set of minimum cost-routes for a number of identical vehicles having a fixed capacity to serve a set of customers with known demands. Several structural constraints can be added to the basic CVRP giving rise to many variants such as time windowsfor the customer to be served, limits on the lengths of the routes and limits on the time that a driver can work.Since the CVRP is a NP-hard problem, three solution approaches are typically employed: heuristics, approximation and exact methods (Alba and Dorronsoro, 2006; Osman,
การแปล กรุณารอสักครู่..