A hybrid heuristics for vehicle routing problem with simultaneous pickup and delivery service

摘要

The vehicle routing problem with simultaneous delivery and pick-up service (VRPSPD) was considered in this paper. A hybrid heurictics was proposed to determine the optimal set of routes to totally satisfy both the delivery and pick-up demand of the customer population. An extensive numerical experiment was performed on benchmark problem instances available in literature. It is found that the proposed approach gives good results compared to the existing algorithms.