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

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

0.00 Avg rating0 Votes
Article ID: iaor20063673
Country: China
Volume: 27
Issue: 3
Start Page Number: 223
End Page Number: 228
Publication Date: Jun 2005
Journal: Journal of University of Shanghai for Science and Technology
Authors: ,
Abstract:

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. Some of the solutions are equal to the lower bound.

Reviews

Required fields are marked *. Your email address will not be published.