A new solution approach for vehicle routing problem with simultaneous pick-up and delivery

Pick up and delivery vehicle routing problem is that customers' demand are met using a vehicle with simultaneously pickup and delivery policies on each route. In this study, a vehicle routing problem consists of single depot and 76 customers is solved. The main objective is to create vehicle routes which minimize the distance travelled using the minimum number of vehicles. A Mixed Integer Linear Programming (MILP) from literature and a new heuristic algorithm are proposed to solve the problem. Effectives of new proposed algorithm is illustrated using different data set and a relationship among distances and number of vehicle is examined searched using a regression analysis.