An algorithm for the approximate solution of a large-scale travelling salesman problem in a plane

An algorithm for the approximate solution of a large-scale travelling salesman problem in a plane

0.00 Avg rating0 Votes
Article ID: iaor1990692
Country: United Kingdom
Volume: 28
Start Page Number: 1
End Page Number: 7
Publication Date: Feb 1988
Journal: USSR Computational Mathematics and Mathematical Physics
Authors:
Abstract:

A decomposition and aggregation approach is proposed. The set of nodes is partitioned into subsets, each subset is aggregated, and the solution of the problem is reduced to solving subproblems for the subsets followed by joining of these solutions in the sequence corresponding to the solution of the problem for the aggregate nodes representing the subsets.

Reviews

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