给出一种通用组合优化算法——元胞蚂蚁算法,并将其应用于一些扩展TSP问题(包括瓶颈TSP、最小比率TSP、时间约束TSP等)的求解。经过数据测试和验证,获得了较好的结果。
A general discrete systems optimization algorithm——cellular ant algorithm is presented, and then it is applied to solve some extended TSP (including bottleneck TSP, minimum-ratio TSP and timeconstrained TSP). Numerical examples are tested, that give promising results.