A solution approach for vehicle routing problem with simultaneous pickup and delivery

Abstract

Simultaneously pickup and delivery problem is a vehicle routing problem that pickup and delivery demands of customers in each route are met simultaneously. The vehicle routing problem of a company provides delivery service to 76 customers from a depot is solved. The main objective is to create vehicle routes which minimize the distance travelled using the minimum number of vehicles. A MILP and a new heuristic algorithm are proposed to solve the problem. The algorithm was applied different data sets and results are evaluated with regression analysis