对双目标旅行商问题设计了基于Pareto概念的多目标蚂蚁算法.借助于算法的全局搜索能力,在整个解空间内快速搜索多目标组合的Pareto有效解,并利用多目标蚂蚁算法维持解集多样性的特点,使搜索到的Pareto解在前沿均匀分布、经大量算例求解验证了其有效性,该算法具有较好的通用性.
A Pareto concept based multi-objective ant algorithm for the bi-objective TSP is proposed. Taking advantage of the capability of efficient global searching and maintenance of diversity of ant algorithm, the feasible region can be quickly explored and the Pareto solutions are found uniformly distributed on the frontier. Experiment results show the effectiveness and validity of the algorithm.