浅谈求解组合优化问题的几种近似算法

Talking about Several Heuristic Algorithms Simply which Solve Optimizing Problem

现实生活中,为了最大限度地利用资源、节省开支,出现了许多最优化利用资源的问题,往往是要求求出最大值或最小值的。在优化问题中,比较常见的是组合优化问题。针对此类问题,也出现了不少求解的算法。该文对其中比较常用的几种近似算法进行了总结,并通过一种典型的组合优化问题——装箱问题的实例对各算法的优劣进行了比较。

In real life,in order to maximize the use of resources,cost savings,many problems about the most optimal use of resources ap-pear,they are often asked to derive the maximum or minimum value.In the optimization problem,the more common is combinatorial optimization problem.To such problems,there have been a lot of algorithms to solve them.In this paper,the author sum these heuristic algorithms which are commonly used,and these algorithms are compared.through a typical combinatorial optimization problems-for ex-ample the problem of packing the pros and cons.