Portal de Periódicos da CAPES

An Algorithm for the Traveling Salesman Problem

1963; Institute for Operations Research and the Management Sciences; Volume: 11; Issue: 6 Linguagem: Inglês

10.1287/opre.11.6.972

1526-5463

John D. C. Little, Katta G. Murty, Dura W. Sweeney, Caroline Karel,

Optimization and Search Problems

A “branch and bound” algorithm is presented for solving the traveling salesman problem. The set of all tours (feasible solutions) is broken up into increasingly small subsets by a procedure called branching. For each subset a lower bound on the length of the tours therein is calculated. Eventually, a subset is found that contains a single tour whose length is less than or equal to some lower bound for every tour. The motivation of the branching and the calculation of the lower bounds are based on ideas frequently used in solving assignment problems. Computationally, the algorithm extends the size of problem that can reasonably be solved without using methods special to the particular problem.