Puget, Jean Fancois
TSP (Traveling Salesman Problem) is a typical NP - complete problem and genetic algorithm (GA) is the perfect method for solving NP - complete problem. The basic theories, characteristics and the basic techniques of GA are first introduced in this paper. ...
TSP(Travelling salesman problem): 译作“旅行商问题”, 一个商人由于业务的需要,要到n个城市,每个城市之间都有一条路径和其他所有的城市相连。现在要求从一个城市出发,穿越所有其他所有的城市,再回到出发的城市。 出于成本的考虑,要求商人走的路径的长短最短。问能否找到这样的一条路径? 这是个经典的NP-complete...
TSP 问题是典型的NP完全问题,遗传算法是求解NP完全问题的一种常用方法。本文针对解决TSP 问题,在MATLAB中用遗传算法施行对TSP问题进行了求解，进行了选择、交叉和变异算子进行了算法设计，最后在MATLAB软件上进行编程实现。最后探讨了遗传算法解决旅行商问题自身具备的特点[1]。关键词：遗传算法；TSP问题；MATLAB软件 ...
设计用于获得具有阶乘复杂性的精确解的精确算法被归类为 NP-Complete。启发式方法的解决方案都基于优化问题。这些算法的复杂性低于精确算法。因此,它可以在更少的时间和空间内给出解决方案,并用于近似解足以解决问题的情况,特别是在很难获得精确解的情况下。
TSPisatypicalprobleminthefieldofcombinatorialoptimization,thecoreofthis tostate,itproblemistofindtheshortcutincludingallthecities.Althoughitisverysimple solve,whatismore,ithasbeenprovedtoisnotSOeasytobetheNP—completeproblem.Butit doesexistextensively,anditisthecentralgeneralizeandsimplifiedformofmanycomplexissues....
(TSP) -- finding whether all the cities in a salesperson's route can be visited exactly once with a specified limit on travel time -- is one of the canonical examples of an NP-complete problem; solutions appear to require an inordinate amount of time to generate, but are simple to ...
Traveling salesman problem ( TSP ) is a typical NP complete combinatorial optimum problem. 摘要旅行商问题 ( TSP ) 是典型的NP完全组合优化问题. 互联网 A chaos optimization method is proposed for TSP. 针对tsp问题,提出了一种用于解决组合优化问题的混沌优化算法. ...
TSP is a typical problem in the field of combinatorial optimization,the core of this problem is to find the shortcut including all the cities.Although it is very simple to state,it is notsoeasy to solve,what is more,it has been proved to be the NP—complete problem.and it is the cent...
C.H. Papadimitriou Euclidean TSP is NP-complete Theoretical Computer Science, 4 (1977), pp. 237-244 View PDFView articleView in ScopusGoogle Scholar [29] C.H. Papadimitriou, U.V. Vazirani On two geometric problems related to the traveling salesman problem Journal of Algorithms, 5 (1984), ...