Vehicle routing problem is one of the most useful problem in operation research fields. The problem is seeking to find an effective plane for fleet of vehicles. In this problem, the capacitated vehicles start form a central depot and deliver the demanded items of customers where each customer must be met once. The capacitated vehicle routing problem (CVRP) is a NP-hard problem. In this thesi we consider a CVRP with decision on hired or purchased of each vehicle. Since the optimal vehicle procurement cost is a function of total distance it traverses during the planning horizon, the model is modified in a way that the decision of purchasing or renting of each vehicle is made simultaneously. Hired cost and purchased cost of a vehicle are different and companies consider to their policy can hire or purchase vehicles. So by considering the net present value of money, the CVRP with vehicle hire or purchase decision is modeled. To solve the model, a shuffled frog leaping algorithm and a hybrid parallel simulated annealing - electromagnetism algorithm are proposed. Finally the efficiency of the presented algorithms are compared in different situation and in most cases PSAEM has better efficiency than SFL and the samples are solved in less run-time.