搜索资源列表
Multi-travelingsalesmanproblem
- 多旅行商问题是单旅行商问题的扩展, 具有更广泛的实际意义。在研究M TSP 解的特点的基础上, 提 出了最小化总行程和均分多个旅行商访问点数、最小化总行程及均分访问路程的两个多目标的M TSP 问题, 并分别给出了相应的数学模型、求解算法和应用实例, 实例表明模型的正确性。-Multi-traveling salesman problem traveling salesman problem is a single expansion, with a wider range of pra
TSP-simulated-annealing-algorithm
- 应用于哈密顿回路的TSP模拟退火算法，里面有6个m文件-Hamiltonian circuit used in the TSP simulated annealing algorithm, which has a 6 m files
GATSproblem
- 主程序是GA.m,geneticTSP.m是主体程序,遗传算法解决TSP问题完整程序-The main program is GA.m, geneticTSP.m is the main program, the genetic algorithm to solve TSP complete program
TCP
- 蚁群算法是当前研究非常火热的一种智能算法，下面的蚁群算法程序专门用于求解TSP问题，我们经过仿真检验，发现此程序的优化效率和鲁棒性都非常好。 function [R_best,L_best,L_ave,Shortest_Route,Shortest_Length]=ACATSP(C,NC_max,m,Alpha,Beta,Rho,Q)-Ant colony algorithm is very hot current research an intelligent algorithm, the
Multiple Traveling Salesmen Problem
- MTSP_GA Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA) Finds a (near) optimal solution to the M-TSP by setting up a GA to search for the shortest route (least distance needed for the salesmen to travel to each city exa