关键词: 自感应蚁群算法, 同时供货和取货的车辆路径问题, 信息素, 算法

Abstract: Vehicle routing problem with simultaneous delivery and pick-up is one of the important compovents of the vehicle routing question,and the complexity of the question makes the present solving methods confined to various kinds of insert heuristics algorithm. By quoting the ant colony algorithm appearing in recent years and the further investigation of ants behavior,the paper puts forward to the definitions of reaction factor,expect degree factor,relative distance quality factor and accelerate factor for the first time, incorporates the distance characteristic of the present route in the field of pheromone upgrading,and finally structures a new self-telepathy ant colony algorithm(STACA).STACA method fully utilizes the overall distributed pheromone to respond to information,shifts the state according to the arranging value of capacity of vehicle and the proportion between nodal interval and the node and interval of central point,and effectively solves the contradiction between fast searching and falling into local optima by utilizing the dynamic regulation accelerate factor in the pheromone newer formula. The artificial test has proved the validity of STACA,meanwhile,this algorithm expanded the algorithm space of VRP too.

Key words: aelf-telepathy ant colony algorithm(STACA), vehicle routing problem with simultaneous delivery and pick-up (VRPSDP), pheromone, algorithm