您要查找的是不是：
- This article proposes a modified algorithm for solving the travelling salesman problem (TSP) by neural network. 本文提出用神經(jīng)網(wǎng)絡(luò )解旅行商問(wèn)題(TSP)的改進(jìn)算法。
- Abstract： Bettering path is actually a problem of seeking an approximition algorithm for the travelling salesman problem. 摘 要： 較佳路徑[1]的求解問(wèn)題事實(shí)上是貨郎擔近似算法的問(wèn)題。
- When the method of antibody distilling and injecting used in Travelling Salesman Problem (TSP) were presented, the convergence of AIGA was proven theoretically. 結合旅行商問(wèn)題(TSP)，給出了示范抗體的提取和注射方法，并給出了算法收斂性的理論證明。
- Aimed at many fields' combinational optimization problems being transformed into travelling salesman problem (TSP), a complex particle swarm optimization (CPSO) algorithm was put forward to solve TSP. 摘要針對眾多領(lǐng)域的組合優(yōu)化問(wèn)題可轉化為旅行商問(wèn)題(TSP)，提出求解TSP的粒子群復形(CPSO)算法。
- travelling salesman problem(TSP) 旅行商問(wèn)題
- bi-objective travelling salesman problem 雙目標旅行商問(wèn)題
- Travelling Salesman Problem (TSP) TSP
- It is a retrospective method used to solve TSP practical cases, this case can be an effective home sleep travel salesman problem (traveling salesman problem). 這是一個(gè)關(guān)于用回溯法解決TSP問(wèn)題的實(shí)際案例，此案例可以有效的家覺(jué)旅行售貨員問(wèn)題（貨郎擔問(wèn)題）。
- plane travelling salesman problem 平面旅行商問(wèn)題
- Traveling salesman problem belongs to NP complete. Now it has not found the effective solution yet. 旅行商問(wèn)題屬于np問(wèn)題，現在還沒(méi)有找到有效的解法。
- Traveling salesman problem (TSP) is a typical NP complete combinatorial optimum problem. 摘要旅行商問(wèn)題(TSP)是典型的NP完全組合優(yōu)化問(wèn)題。
- Dorigo M, Gambardella L M. Ant colony system: a cooperative learning approach to the traveling salesman problem[J]. 段海濱;王道波.;一種快速全局優(yōu)化的改進(jìn)蟻群算法及仿真[J]
- Traveling Salesman Problem (TSP) is a classic combinatorial optimizes issue and an NP-hard. 旅行商問(wèn)題是一個(gè)經(jīng)典的組合優(yōu)化問(wèn)題，也是一個(gè)NP難題。
- Clerc M. Discrete Swarm Optimizition Illustratedbythe Traveling Salesman Problem [DB/OL]. http://www. mauriceclerc.net, 2000. 曾劍潮;崔志華.;微粒群算法[M]
- This method is then applied in the traveling salesman problem, and the results show that this method leads to significant improvement over the traditional subgradient algorithm. 最后通過(guò)仿真實(shí)驗驗證了該方法的有效性。
- Simulation results for solving the Traveling Salesman Problem(TSP)show that ACAHM is superior to other congeneric algorithms in terms of solution quality and computation speed. 以旅行商問(wèn)題為例進(jìn)行仿真實(shí)驗,結果表明該算法比其他同類(lèi)算法具有更好的性能。
- By use of the properties of ergodicity, randomicity, and regularity of chaos, a chaos ant colony optimization (CACO) algorithm is proposed to solve traveling salesman problem. 摘要利用混沌運動(dòng)的遍歷性、隨機性和規律性等特點(diǎn)，提出了一種求解旅行商問(wèn)題的混沌蟻群(CACO)算法。
- This paper presents a new kind of traveling salesman problem which is called course traveling salesman problem, and gives an improved edge-searching-based ACO. 定義了一種新的旅行商問(wèn)題，即過(guò)程旅行商問(wèn)題，針對這個(gè)問(wèn)題提出了一種基于邊緣搜索的改進(jìn)蟻群算法。
- Circle permutation problem is translated into traveling salesman problem (TSP) firstly, then the simulated annealing algorithm (SA) is used to solve the TSP. 摘要首先把圓排列問(wèn)題轉化為旅行商問(wèn)題，然后利用模擬退火算法求解此問(wèn)題。
- The applications of ACO to static and dynamic COPs, such as traveling salesman problem, quadratic assignment problem, network routing problem are reviewed. 結合旅行商問(wèn)題、二次指派問(wèn)題以及網(wǎng)絡(luò )路由問(wèn)題等典型組合優(yōu)化問(wèn)題;概述了ACO在靜態(tài)組合最優(yōu)化和動(dòng)態(tài)組合優(yōu)化問(wèn)題中的應用.
