带指定点集的团队定向问题及算法研究

Team Orienteering Problem with Specified Point Set

考虑现实世界配送问题中客户性质不同的特点,讨论了一类带指定点集的团队定向问题。建立了在时间限制条件下,带指定点集的以利润最大为目标的团队定向问题模型。提出了带2-opt的最大最小蚂蚁系统的蚁群优化算法,结合实际改进启发信息和信息素更新策略,采取2-opt对最优解进行优化。数值算例验证了算法的有效性,表明了在团队定向问题中考虑指定点集的重要性。

The team orienteering problem with the specified point set was discussed based on the nature of customers. A mathematic team orienteering problem model with the specified point set which targets the maximized profits was established under the time constrained condition. A MMAS algorithm with 2-opt was developed to solve this problem. It improved stimulating factor and update pheromones strategy. And optimal solution was optimized with 2-opt. The numerical examples demonstrate the algorithm is available, and it is important to take the specified point set into account to solve team orienteering problem.