基于大洪水算法寻优思想,给出一种采用两城市互换策略进行邻域搜索的大洪水算法,以快速求解对称型最小比率旅行商问题.算法在Delphi7环境下编程实现,经大量数据测试和验证,大洪水算法是一种简单有效的算法,在运行效率上明显优于其他算法.
Based on the optimization idea of great deluge algorithm, this paper has proposed a great deluge algorithm which neighborhood search is based on two-city interconversion strategy, and it can be used to solve the minimum ratio travelling salesman problem quickly. The proposed algorithm is programmed in Delphi 7, and is tested through numerical examples of MRTSP. Simulations have showed that the proposed algorithm is a simple and effective algorithm and seems much superior to other algorithms on efficiency.