Research on Time Dependent Vehicle Routing Problem with Simultaneous Delivery and Pickup

Considering that travel routing costs change with time against the background of reverse logistics, this paper presents the time dependent vehicle routing problem of simultaneous delivery and pick-up (TD-VRPSDP), and establishes the mixed integer programming model of TD-VRPSDP. The pheromone updating strategy based on rank-based ant colony system and max-min ant system algorithm are used for solving TD-VRPSDP. Time heuristic in ant colony system (ACS) is designed for the constraint of dynamic routing characteristics and time windows in TD-VRPSDP. Eight group test instances are generated in the numerical simulation experiments. The results show that the ACS designed in this paper can solve TD-VRPSDP well.