Team orienteering problem with time windows is one of the most important logistic distribution routing optimization problems. The optimization objective of this problem is to plan the optimal feasible routes in which the total reward is maximized while a set of customers can be served in the given time windows. An improved ant colony optimization approach was developed to deal with this problem. In order to construct better and faster solutions, the proposed algorithm uses a fast method to determine dynamic candidate list. Moreover,it adopts the sequence method and the greedy method to construct solutions. Compared with iterated local search, the proposed algorithm can obtain better results within 12 seconds.%带时间窗的团队定向问题是一类重要的物流配送路径优化问题,其优化目标是制定最优可行车辆路线,在规定的时间窗内服务一组顾客,以获得最大的总收益.提出了一类改进蚁群算法,用以求解该问题.为了提高解构造质量与效率,使用一种快速的方法来确定动态候选链表,并且利用串行法和贪婪法构造解.与迭代局部搜索相比,所提算法能够在12s内得到更好的解.
展开▼
