METHOD FOR GENERATING OPTIMUM SOLUTION OF TSP IN ORDER

摘要

PURPOSE: A method for generating an optimum solution of a TSP(Traveling Salesman Problem) in order is provided to generate an optimum solution of a TSP for calculating the Kth optimum solution. CONSTITUTION: The minimum tour calculation based on all nodes which isn't calculated is performed. An optimum solution is calculated(401). The Kth optimum solution is outputted(402). A node division calculation is performed using the optimum solution(403). Child nodes generated from the node division calculation are attached to the minimum node(404). K is increased as much as '1' in order to calculate next optimum solution(405).