Search - 2 opt - CodeBus

Search - 2 opt - List

[matlab] TSP DL : 0: 用模拟退火算法求解TSP问题 [1]主函数tsp.m [2]计算路径长度的子函数 route_long.m [3]随机交换两个节点的顺序函数exchange.m-Using simulated annealing algorithm for solving TSP problems [1] the main function tsp.m [2] calculation of path length of Functions route_long.m [3] randomly exchange the order of two nodes function exchange.m
Date : 2025-12-26 Size : 1kb User : 齐亚超
[matlab] IGA DL : 0: 为改进遗传算法的源程序，采用了多次2-opt变异算子，进一步改进了计算结果。-The source code for the improved genetic algorithm using a number of 2-opt mutation operator to further improve the results.
Date : 2025-12-26 Size : 2kb User : 碧天
[matlab] nearest_neighbor_2opt DL : 0: Nearest Neighbor for TSP with 2-opt MATLAB
Date : 2025-12-26 Size : 1kb User : Yener
[matlab] farthest_insertion_2opt DL : 0: Fartest Insertion for TSP with 2-opt MATLAB
Date : 2025-12-26 Size : 1kb User : Yener
[matlab] random_tour_2opt DL : 0: Random Tour for TSP with 2-opt MATLAB
Date : 2025-12-26 Size : 1kb User : Yener
[matlab] gpso4.2-opt DL : 0: 基于遗传微粒群算法，对旅行商问题求解，采用2-opt进行局部搜索。GPSO4tsp-Genetic particle swarm algorithm for solving the traveling salesman problem, using 2-opt local search. GPSO4tsp
Date : 2025-12-26 Size : 918kb User : wuwu
[matlab] unit_opt DL : 0: The architecture of this set of codes and the interaction among them is shown in Figure 1. The main testing code main code.m calls the code riemann grad unit opt.m that performs Riemannian optimization under unitary matrix constraint. Steepest Descent/Ascent (SD/SA) algorithm (see Table 3.2 in [1]), Conjugate Gradient (CG-PR, CG-FR) algo- rithms (both Fletcher-Reeves and Polak-Ribi`ere formulas, see Table 3.3 in [1]), are im- plemented. This code further calls the codes implementing line search methods: Armijo method geod search armijo.m, as well as the polynomial and DFT-based approximation
Date : 2025-12-26 Size : 303kb User : dave
[matlab] Analyzing-2-opt DL : 0: Analyzing 2-opt for Traveling Salesman problem (TSP)
Date : 2025-12-26 Size : 1kb User : BB
[matlab] twice-update-PSO DL : 0: 本文二次更新型粒子群算法（ TUPSO）的基本思想是：一方面，在保留粒子群算法中快速收敛，易于实现，调整参数少等优势的前提下，通过融合基本粒子群算法中的信息共享原理与 DPSO-TSP 中的 2-Opt 运算法则，改进了DPSO-TSP中粒子进化的规则-In this paper, the basic idea of the new particle swarm optimization (TUPSO) algorithm is: on the one hand, by integrating the particle swarm optimization algorithm in the fast convergence, easy to achieve, adjust the parameters of less advantage of the premise, through the integration of basic particle swarm algorithm information sharing Principle and the 2-Opt algorithm in DPSO-TSP improves the rule of particle evolution in DPSO-TSP
Date : 2025-12-26 Size : 4kb User : CAITONGCHEN
[matlab] Article_Demo1 DL : 0: this research paper we present an immunological algorithm (IA) to solve global numerical optimization problems for high-dimensional instances. Such optimization problems are a crucial component for many real-world applications. We designed two versions of the IA: the first based on binary-code representation and the second based on real values, called opt-IMMALG01 and opt-IMMALG, respectively. A large set of experiments is presented to evaluate the effectiveness of the two proposed versions of IA. Both opt-IMMAL
Date : 2025-12-26 Size : 16kb User : FGGGG
[matlab] opt DL : 1: 四种不同的算法：AdaGrad、Adam、momentumGrad、RMSProp算法来解决优化问题：min f=1/2*||Ax-b||_2+u*||x||_1(Four different algorithms: AdaGrad, Adam, momentumGrad, and RMSProp algorithms to solve the optimization problem: Min f=1/2*||Ax-b||_2+u*||x||_1)
Date : 2025-12-26 Size : 1kb User : 刘禺