专门用于求解TSP问题的matlab编制的蚁群算法,此程序的优化效率和鲁棒性都非常好,Ant Colony Algorithm for Traveling Salesman Problem,very efficient and robust

自编的多目标粒子群优化算法，可以运行哦。-Written and directed the multi-objective particle swarm optimization, you can run, oh.

General simulated annealing algorithm-anneal Minimizes a function with the method of simulated annealing (Kirkpatrick et al., 1983) ANNEAL takes three input parameters, in this order: LOSS is a function handle (anonymous function or

In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs. This algorithm is a member of the a