改进蚂蚁算法在组合优化中的应用-置换FlowShop问题求解

置换FlowShop问题是生产调度问题中的一种，具有广泛的工程应用背景．有效的调度能够提高企业的生产效率和设备利用率，增强企业竞争能力．然而多机器的置换FlowShop问题属于NP-hard问题，很难得到问题的最优解．文章简单介绍了蚂蚁算法，并提出退火蚂蚁算法一将max-min ant system与模拟退火算法相结合．通过与max-min ant system运算结果进行比较最后得出结论：退火蚂蚁算法性能得到显著提高．

The application of an improved ant algorithm to combinatorial optimization-solving FSP

Permutation flowshop problem is one of the scheduling questions in production, and it is largely applied in engineering. Effective scheduling can improve the manufacturing efficiency and make a better use of the equipments, thus helping the corporation to be more competitive. However, the question of permutation FlowShop among three or more machines belongs to NP-hard question, which makes it hard to get the best solution. Therefore, this article briefly illustrates the ant algorithm, brings forth an improved ant algorithm, and so solves the problems of FlowShop problem with it. Compared with the standard max-min system, a conclusion is drawn that the improved ant algorithm's performance is improved remarkably.