A solution for simultaneous adaptive ant colony algorithm to memory demand vehicle routing problem with pickups

Aiming at simultaneous delivery and pickup cargo that was vehicle routing problem with simultaneous delivery and pickup (VRPSDP) existed in logistics area, an adaptive ant colony algorithm was proposed to minimize the path length. According to the characteristics of the vehicle routing problem, a mathematical model was proposed to solve the problem. In order to prevent ant colony algorithm from falling into the local optimal, this paper based on the idea of combining the heuristic algorithm with ant colony algorithm proposed adaptive memory of ant colony algorithm. Simulation results shown that the algorithm can improve the global search ability of ant colony algorithm, and effectively avoid the local optimum, reduce the total distribution distance, thereby the new method's accuracy was verified.