shenjinwangluoyuce

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. After an initial solution a neighborhood solution is selected by an exchange of a randomly selected pair of nodes. The randomly generated neighbor solution is selected if it improves the solution else it is selected with a probability that depends on the extent to which it deteriorates from the current solution.

一些matlab常用命令函数，便于matlab编程爱好者学习参考(Some of the Matlab command function, easy to Matlab programming enthusiasts to learn reference)

在基于分解的多目标优化算法（MOEA/D）的基础上加入差分算法，并且对于权重矢量的计算资源进行动态分布(Decomposition-based multi-objective optimization algorithm (MOEA/D) of the basis of the difference algorithm, and the weight vector for the dynamic distribution of computing resources)

MATLAB例子，执行与Integra系列热电偶扫描( Matlab Example to Perform a Thermocouple Scan with Integra Series )

无人机一维模糊控制器设计，simulink下运行(UAV fuzzy)

MATLAB复杂网络的实现 主要是一些复杂网络的MATLAB程序(MATLAB complex network)

cooperative sensing using AND technique

基于matlab的程序讲解，综合了所有知识及仿真，希望能帮助你学习(Combines all the knowledge and simulation matlab-based program to explain, hope to help you learn)

matlab阵列信号处理工具箱DBT,版本2.20,阵列信号处理必备(Directory stored in the source wavelet coding, including the commonly used wavelet transform procedures for)

说明：  给定n种物品和一个背包,物品i的重量是Wi,价值是vi,被包容量是C,应该如何选择装入被包的物品,使得装入背包中物品的总价值最大?对于每种物品i,只有两种选择,装入或者不装入. 输入:第一行两个正整数n(物品数)和C(容量) 第二行n个正整数n,表示物品价值 第三行n个正整数n,表示物品重量 输出:第一行表示总价值 第二行n个数(0/1),0表示物品不装入,1表示装入 例如, 输入: 5 10 6 3 5 4 6 2 2 6 5 4 输出 15 1 1 0 0 1 (Species of a given n items and a backpack, the weight of item i is Wi, the value of vi, was packet capacity is C, should be how to choose a package of items to be loaded, the backpack load in the largest total value of goods? For each item i, there are only two options, loaded or not loaded. Input: the first line of the two positive integer n (the number of items) and C (capacity) of the second line of n positive integer n, that the value of the third line of n positive integer n, that the weight of output: the total value of the first line of the second line, said n number of (0/1), 0 that the items do not load, that load 1 for example, enter: 5,106,354,622 6 5 4 output 15 1 1 0 0 1)