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.