Research on Prize-Collecting Vehicle Routing Problem Considering Dynamic Pickup Demands

Considering the current orders could not be fully served in a day time and dynamic pickup demands may appear randomly, this paper discussed the prize-collecting vehicle routing problem(PCVRP) with soft time windows, simultaneous pickup and delivery, and dynamic pickup demands(DPCVRP). It established a mathematical model and proposed a heuristic algorithm to solve it. The algorithm was based on the adaptive large neighborhood search algorithm, which embed tabu search algorithm. Simulation experiments results proved the model's rationality and the algorithm's effectiveness.