This paper studies about the capacitated vehicle routing problem (CVRP). Since the problem is NP-hard, a local search based algorithm is used for the CVRP with the target to limit the aggregate visited distance and number of vehicles. This algorithm is proven to be effective and as efficient for CVRP by checking its comparability with existing best-known results. In this paper, this algorithm is used for CVRPSD by increasing the demands the customers by 10%, 15%, and 20% orderly. This algorithm is tested on the 5 problem set obtained from Augerat et. al CVRP benchmark problems which include instances range from 13 to 51 service nodes and a number of homogeneous vehicles are changed from 2 to 8 according to problem set. The empirical outcomes demonstrate that this algorithm gives better arrangements than understood benchmark problems contrasted with those detailed in the literature.
LOCAL SEARCH BASED ALGORITHM FOR CVRP WITH STOCHASTIC DEMANDS
28.08.2017
doi:10.26483/ijarcs.v8i7.4468
International Journal of Advanced Research in Computer Science; Vol 8, No 7 (2017): July-August 2017; 1087-1092 ; 0976-5697 ; 10.26483/ijarcs.v8i7
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
DDC: | 629 |
An effective tabu search approach with improved loading algorithms for the 3L-CVRP
Tema Archiv | 2015
|BASE | 2016
|An Effective Tabu Search Algorithm for the Vehicle Routing Problem with Stochastic Demands
Trans Tech Publications | 2011
|British Library Online Contents | 2010
|