combinatorial optimization problem

基本解释

Job-shop Scheduling Problem is a typical NP problems, which is one of the hardest combinatorial optimization problem.
作业车间调度问题是一个典型的NP 难问题，是最困难的组合优化问题之一。
Distribution Network Structure planning is a complex combinatorial optimization problem, which is difficult to solve properly by using traditional optimization methods.
配电网网架规划是一个复杂的组合优化问题，传统的优化方法往往难以解决此类问题。
By the application in a concrete sample, it is indicated that the genetic algorithm provides a new way to solve this complicate combinatorial optimization problem effectively.
通过在具体实例中的应用表明，采用遗传算法为有效地解决这一复杂组合优化问题提供了一种新途径。