MATLAB-programme

VRP, for solving vehicle routing problem

使用遗传算法和蚁群算法求解TSP问题，并且 实时地将计算结果和所用时间等信息显示在界面上，很直观。(The use of genetic algorithms and ant colony algorithm for TSP problem, and real-time results and the use of the time information is displayed in the interface is very intuitive.)

vc++ 调用 matlab vc++ 调用 matlab vc++ 调用 matlab vc++ 调用 matlab(vc++ matlab)

Matlab中实现轮对分析的程序源码和相关的程序源码包，，能实现火车轮轨接触关系的分析 (Round of analysis of program source code and related procedures source package in Matlab, train wheel-rail contact analysis of the relationship)

说明：  一个MATLAB的应用程序，很方便的！使用时需要转换为M文件。(A MATLAB application, very convenient! The use of M need to convert files.)

hierarchical Mesh Segmentation based on Fitting Primitives 配套源码(code for hierarchical Mesh Segmentation based on Fitting Primitives)

Balanced PSO,可作为benchmark比较(You campare your algorithm with it.)

递归法求解整数划分。 整数划分，是指把一个正整数n写成如下形式： n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )

VC++调用MATLAB Engine。本文档详细介绍了在VC++编程中如何调用MATLAB引擎。(VC++ calling MATLAB Engine. This document details the VC++ programmers how to call the MATLAB engine.)

本程序是使用VC编写，在VC中调用MATLAB,由于MATLAB编写算法功能强大，所以与VC结合使用比较方便。(The program is written using the VC in the VC call MATLAB, MATLAB write algorithms as powerful, it is convenient in combination with the VC.)