搜索结果
找到约 27 项符合
Traveling 的查询结果
按分类筛选
matlab例程 TSP( Traveling Salesman Problem) is a typical NP complete problem ,genetic algorithm is the perfect
TSP( Traveling Salesman Problem) is a typical NP complete problem ,genetic algorithm is the perfect method for solving NP complete problem.
其他 The basic principle using the branchand- bound strategy to solve the traveling salesperson optimiz
The basic principle using the branchand-
bound strategy to solve the traveling
salesperson optimization problem (TSP)
consists of two parts.
&#1048708 There is a way to split the solution space.
&#1048708 There is a way to predict a lower bound for a
class of solutions.
&#1048708 There is also a way ...
matlab例程 Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algo
Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
文章/文档 Traveling Salesman Problem (TSP) has been an interesting problem for a long time in classical optim
Traveling Salesman Problem (TSP) has been an interesting problem for a long
time in classical optimization techniques which are based on linear and nonlinear
programming. TSP can be described as follows: Given a number of cities to visit
and their distances from all other cities know, an optimal tra ...
人工智能/神经网络 Traveling Salesperson Problem Our branch-and-strategy splits a branch and bound solution into two
Traveling Salesperson Problem
Our branch-and-strategy splits a branch and bound solution into two groups:
one group including a particular arc and the other excluding this arc.
1.Each splitting incurs a lower bound and we shall traverse the searching tree with the "lower" lower bound.
2.If a const ...
其他 This simple simulation of a pulse traveling down a parallel-plate guide makes a handy test code for
This simple simulation of a pulse traveling down a parallel-plate guide makes a handy test code for initial experiments with boundary conditions. ToyFDTD3 adds some simple features to ToyFDTD1: A PMC boundary condition, a sinusoidal pulse source, and output tracking a single point in the mesh. Relea ...
人工智能/神经网络 this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up
this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
Notes:
1. Input error checking included
2. Inputs can be specified in any order, s ...
matlab例程 Using Ant Colony Optimization Algorithm to solve Traveling Salesman Problem.对此方面的研究很有帮助
Using Ant Colony Optimization Algorithm to solve Traveling Salesman Problem.对此方面的研究很有帮助
数值算法/人工智能 遗传算法和“货郎担” 问题: "The traveling salesman problem, or TSP for short, is this: given a finite number of
遗传算法和“货郎担” 问题:
"The traveling salesman problem, or TSP for short, is this: given a finite number of cities along with the cost of travel between each pair of them, find the cheapest way of visiting all the cities and returning to your starting point."
电子书籍 多旅行商问题(Multiple Traveling Salesperson Problem ,简称MTSP) 讨论的是如何安排m( > 1 ) 位旅行商访问n( > m ) 座城市,要
多旅行商问题(Multiple Traveling Salesperson Problem ,简称MTSP) 讨论的是如何安排m( > 1 ) 位旅行商访问n( >
m ) 座城市,要求每个城市只允许被访问一次时,求解所有旅行商花费的费用和是最小(或最大) 的问题。MTSP 问题其实与单
旅行商问题(Traveling Salesperson Problem ,简称TSP) 相似,但是由于添加了任何城市只要被 ...