| Article ID: | iaor2012189 |
| Volume: | 72 |
| Issue: | 12 |
| Start Page Number: | 2527 |
| End Page Number: | 2540 |
| Publication Date: | Dec 2011 |
| Journal: | Automation and Remote Control |
| Authors: | Ivanko E |
| Keywords: | combinatorial optimization |
An empirical algorithm to solve the traveling salesman problem was proposed. It is distinguished for the consecutive rational decomposition of the given task into subtasks of lower dimensions. Each subtask can be solved using any existing method, exact or empirical, including the recursively applied algorithm described in the present paper.