关键词: 航次方案, 蚁群算法, 整数规划, 变异算子

Abstract: According to the mathematical model of Voyage scheme optimization, an improved ant colony algorithm is presented. Three strategies to improve the algorithm, it first uses selection of two-stage method to reduce the computational complexity, then uses small group of optimal search method to initialize the pheromone intensity, finally designs a kind of dynamic interval mutation operator to avoid getting into the local optimal. Different sizes of numerical experiments show that the algorithm has good computational performance.

Key words: voyage scheme, ant colony algorithm, integer programming, mutation operator