Artificial intelligence

Abstract: Solutions’ search for Traveling Salesman task’s class in the binary branching scheme of branch-and-bound method can be noticeable accelerated by referring to a fast algorithm for solving a variant of the assignment problem, used to compute lower bounds for the Hamiltonian routes’ cost. Optimal solution for assignment problem for resulting matrix can be found in time O(n²). The algorithm of the branch and bound scheme that uses a fast algorithm for solving the assignment problem as a lower bound of the solution’s cost is proposed.

Keywords: Traveling Salesman Problem, exact method, modification of the Little’s method’s.

References: