Abstract: In this study, a heuristic algorithm called Arya method has been proposed for solving classic problems of VRP and it is based on the selection of the nearest neighbor. This innovative method has been developed and then compared to another well-known method of solving routing classic problems which is proposed by Clarke and Wright. These two methods are firstly coded by a programmer and then 295 randomly generated problems have been solved by these algorithm and the time and quality of their solutions were compared with each other.