Sparse ant system supporting large-scale combination optimization problem and solving method

• Main Authors: CHEN YANG, LI JIAYU, LYU YING, SHI BO, WU JINGFEI, WANG ZIZHE, HUANG ZHIBIN, TANG XIN
• Format: Patent
• Language: Chinese; English
• Published: 28.09.2018
• Subjects: CALCULATING; COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS; COMPUTING; COUNTING; PHYSICS

The invention provides a sparse ant system supporting a large-scale combination optimization problem. The system comprises an initial solution construction module, an iterative solving module, a sparse pheromone matrix update module and an optimal solution calculation module. The invention furthermore provides a method for calculating an optimal solution of the large-scale combination optimizationproblem by using the sparse ant system. The method comprises the steps of 1, constructing an initial solution; 2, calculating optimal solutions by multi-time iteration, calculating global iterative optimal solutions in M ants, circulating each ant for N times, obtaining a sub-step solution node j during each calculation, finally obtaining feasible solutions of current iteration, selecting the global optimal solution in the feasible solutions of the M ants, and performing comparison and update on the global optimal solution of the current iteration and the iterative optimal solution so far; 3,after each iteration is f