基于快速下界估算的瓶颈旅行商问题竞争决策算法

Solving bottleneck travelling salesman problem with competitive decision algorithm based on quick lower bound estimation

利用数学推导和证明得出了一个瓶颈旅行商问题下界快速估算法,在此基础上利用竞争决策算法(新型优化思想)的通用模型,给出了一种瓶颈旅行商问题的竞争决策算法,经过大量数据测试和验证,并将求解结果与下界相比较,部分结果与下界相同.

Based on mathematical inference and proof, a quick algorithm for estimating the lower bound of bottleneck travelling salesman problem (BTSP) is proposed. Based on the quick lower bound algorithm for BTSP and the general model of the competitive decision algorithm (a novel optimization idea), a quick competitive decision algorithm for solving BTSP is then presented. Series of numerical examples of BTSP are tested and their solutions are compared with the lower bound. Parts of the solutions are equal to the lower bound.