traveling
共 27 篇文章
traveling 相关的电子技术资料，包括技术文档、应用笔记、电路设计、代码示例等，共 27 篇文章，持续更新中。
针对多旅行商问题的tsp问题的遗传算法matlab程序-
针对多旅行商问题的tsp问题的遗传算法matlab程序-TSP problem for multi- traveling salesman problem of genetic algorithm matlab program
The+Telecommunications+Handbook
Changes in telecommunications are impacting all types of user<br />
group, which include business users, traveling users, small and<br />
home offices, and residential users. The acceptance rate of te
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.
􀂄 There is a way to split the solution space.
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.
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 fol
A Genetic Algorithms and the Traveling Salesman Problem
A Genetic Algorithms and the Traveling Salesman Problem
用于求解TSP(Traveling salesman problem
用于求解TSP(Traveling salesman problem，旅行商问题)问题，基本执行见run.bat, 其它详见其中的readme.txt。（实例为TSPLIB格式，见myprojects目录，包括eil51, d198, lin318等小型问题，以及1000到3000城市之间的例子，基本能得到最优解）
主要解决旅行商问题(traveling saleman problem,简称tsp
主要解决旅行商问题(traveling saleman problem,简称tsp，即已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市，求解最短距离的遗传算法。
traveling saleman problem的一个Ｃ＋＋算法
traveling saleman problem的一个Ｃ＋＋算法
A program to demonstrate the optimization process of ant colony optimization for the traveling salem
A program to demonstrate the optimization process of ant colony optimization for the traveling saleman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them
物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA)
物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location
Vehicle routing: VRP, VRP with time windows,
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
Genetic Algorithm (GA) based solver for the Traveling Salesman Problem
Genetic Algorithm (GA) based solver for the Traveling Salesman Problem
Using Ant Colony Optimization Algorithm to solve Traveling Salesman Problem.对此方面的研究很有帮助
Using Ant Colony Optimization Algorithm to solve Traveling Salesman Problem.对此方面的研究很有帮助
traveling saleman problem的代码
traveling saleman problem的代码
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
MTSP 问题其实与单 旅行商问题(Traveling Salesperson Problem ,简称TSP) 相似,但是由于添加了任何城市只要被某一旅行商访问到即可这个附加条 件,因而增加了问题
MTSP 问题其实与单
旅行商问题(Traveling Salesperson Problem ,简称TSP) 相似,但是由于添加了任何城市只要被某一旅行商访问到即可这个附加条
件,因而增加了问题复杂度。在以前使用遗传算法(GA) 研究解决MTSP 问题时,通常采用标准的TSP 染色体和处理方法。
遗传算法和“货郎担” 问题: "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 a
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 c
This code proposes genetic algorithm (GA) to optimize the point-to-point trajectory planning for a 3
This code proposes genetic algorithm (GA) to optimize the point-to-point trajectory planning for a 3-link robot arm. The objective function for the proposed GA is to minimizing traveling time and spa