Search - heuristic TSP

Search - heuristic TSP - List

[matlab] matlog DL : 0: 物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP) Networks: Shortest path, min cost network flow, minimum spanning tree problems Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP Material handling: Equipment selection General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes -logistics analysis tool kit. Facility location : Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated Vehicle routing facility location : VRP, VRP with time windows, the traveling salesman problem (TSP) Networks : Shortest path, min cost network flow, minimum spanning tree Geocoding problems : world city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout : Steepest descent Pairwise interchange (Constituencies) heuristic for QAP Material handling : Equipment selection General purpose : Linear programming using the revised simplex method, mixed-integer linear programming programming (MILP) branch and bound procedure Data : world cities with populations of at least 10,000, U.
Date : 2025-12-22 Size : 4.63mb User : 陈宝文
[matlab] ACTSP DL : 0: 实现了蚁群算法求解TSP问题。注释详细 function[R_best,L_best,L_ave,Shortest_Route,Shortest_Length]=ACATSP(C,NC_max,m,Alpha,Beta,Rho,Q) ------------------------------------------------------------------------- 主要符号说明 C n个城市的坐标，n×2的矩阵 NC_max最大迭代次数 m蚂蚁个数 Alpha表征信息素重要程度的参数 Beta表征启发式因子重要程度的参数 Rho信息素蒸发系数 Q信息素增加强度系数 R_best各代最佳路线 L_best各代最佳路线的长度 ========================================================================= -Ant Colony Algorithm for the realization of the TSP problem. Notes the detailed function [R_best, L_best, L_ave, Shortest_Route, Shortest_Length] = ACATSP (C, NC_max, m, Alpha, Beta, Rho, Q) ------------------------------------------------------------------- The main symbol------ C n that cities coordinates, n × 2 matrix NC_max the largest number of iterations m the number of Alpha ant pheromones characterized the importance of the parameters Beta factor heuristic importance of characterization of the parameters Rho evaporation coefficient of pheromone pheromone Q increase in intensity coefficient R_best best route generations generations L_best the length of the best route ====== ================================================== =================
Date : 2025-12-22 Size : 2kb User : 王晶
[matlab] TSPusingTabuSearch(matlabcode) DL : 0: TSP can be defined as a problem where starting from a node it is required to visit every other node only once in a way that the total distance covered is minimized. Tabu Search is a heuristic that prevent the process from cycling in a small set of solutions, some attribute of recently visited solutions is stored in a Tabu List, which prevents their occurrence for a limited period. For our problem, the attribute used is a pair of nodes that have been exchanged recently. A Tabu structure stores the number of iterations for which a given pair of nodes is prohibited from exchange.
Date : 2025-12-22 Size : 17kb User : amilcar
[matlab] Ant-Colony-Algorithm DL : 0: 蚁周模型，解决TSP问题。蚁群算法是一种新型高效的启发式优化算法,在解决优化组合问题特别是TSP求解问题上具有很高效率.-Ants week model, to solve the TSP. The ant colony algorithm is a new and efficient heuristic optimization algorithm, to solve the problem of optimal combination, especially TSP solving problems with high efficiency
Date : 2025-12-22 Size : 2kb User : 韩松
[matlab] TSP DL : 0: TSP是组合优化问题的经典问题，作为启发式算法的编程初学者可以利用这个问题练习编程，本算例条理清晰，简单明了，可以进行学习。-TSP problem is a classic combinatorial optimization problems, as heuristic programming beginner exercise program can take advantage of this issue, this study clear, simple, can learn.
Date : 2025-12-22 Size : 2kb User : 葛显龙
[matlab] codes DL : 0: 启发式算法的TSP的matlab程序，包含模拟退火算法与遗传算法。(Heuristic algorithm of TSP matlab program, including simulated annealing algorithm and genetic algorithm.)
Date : 2025-12-22 Size : 1.76mb User : canlee1992
[matlab] matlab DL : 0: 用于解决TSP的启发式算法的matlab程序，包含模拟退火算法与遗传算法。(Matlab program for solving TSP heuristic algorithm, including simulated annealing algorithm and genetic algorithm.)
Date : 2025-12-22 Size : 81kb User : canlee1992
[matlab] 蚁群算法（路径规划程序） DL : 0: 蚁群算法是一种群智能算法，也是启发式算法。基本原理来源于自然界蚂蚁觅食的最短路径原理。蚁群算法根据模拟蚂蚁寻找食物的最短路径行为来设计的仿生算法，因此一般而言，蚁群算法用来解决最短路径问题，并真的在旅行商问题（TSP，一个寻找最短路径的问题）上取得了比较好的成效。目前，也已渐渐应用到其他领域中去，在图着色问题、车辆调度问题、集成电路设计、通讯网络、数据聚类分析等方面都有所应用。(Ant colony algorithm is a population intelligent algorithm, and it is also a heuristic algorithm. The basic principle comes from the shortest path principle of the ant foraging in nature. The ant colony algorithm based on the simulation of ants to find the shortest path algorithm to design the bionic food behavior, so in general, the ant colony algorithm to solve the shortest path problem, and really in the traveling salesman problem (TSP, a search for the shortest path problem) has made good effect. At present, it has gradually applied to other fields, and has been applied in graph coloring, vehicle scheduling, integrated circuit design, communication network, data clustering analysis and so on.)
Date : 2025-12-22 Size : 142kb User : wyj2277
[matlab] vrp DL : 0: 假设在一个供求关系系统中，车辆从货源取货，配送到对应的若干配送点。车辆存在最大载货量，且配送可能有时间限制。需要合理安排取货时间，组织适当的行车路线，使用户需求得到满足，同时使某个代价函数最小，比如总工作时间最少、路径最短等。可以看出TSP问题是VRP问题的一种简单特殊形式。因此，VRP也是一种NP hard 问题。目前解决此种问题的办法有多种，主要以启发式算法为主。包括退火算法、遗传算法、蚁群算法、禁忌算法等，本文介绍两种比较简单算法：C-W节约算法和遗传算法。(Assume that in a supply and demand relationship system, the vehicle picks up the goods from the source and delivers them to the corresponding distribution points. There is a maximum amount of cargo in the vehicle and there may be a time limit for delivery. It is necessary to arrange the picking time reasonably, organize the appropriate driving route, and satisfy the user's needs, and at the same time minimize a certain cost function, such as the minimum total working time and the shortest path. It can be seen that the TSP problem is a simple and special form of the VRP problem. Therefore, VRP is also an NP hard problem. At present, there are many ways to solve this kind of problem, mainly based on heuristic algorithms. Including annealing algorithm, genetic algorithm, ant colony algorithm, tabu algorithm, etc. This paper introduces two simple algorithms: C-W saving algorithm and genetic algorithm.)
Date : 2025-12-22 Size : 4kb User : HappyppaH