多目标优化遗传算法有效地避免了收敛速度慢和封闭竞争等问题， Pareto前沿更加接近理想前沿，并且收敛速度都非常快-Multi-objective optimization genetic algorithm is effective to avoid the slow convergence rate and close competition and other issues, leading Pareto closer to the ideal cutting edge, and the

moead for knapsack 基于分解的多目标优化算法，解决多目标背包问题-moead for knapsack

蚁群算法多目标优化,针对多个目标，主要用在路径取货方面-Ant colony algorithm for multi-objective optimization.

遗传算法C#代码，主要是解决多目标优化问题。只是算法的基本实现- Genetic Algorithm C# code, mainly to solve the multi-objective optimization problem. Just basic implementation of the algorithm