combinatorial optimization problem

基本解釋

Job-shop Scheduling Problem is a typical NP problems, which is one of the hardest combinatorial optimization problem.
作業(yè)車(chē)間調(diào)度問(wèn)題是一個(gè)典型的NP 難問(wèn)題，是最困難的組合優(yōu)化問(wèn)題之一。
Distribution Network Structure planning is a complex combinatorial optimization problem, which is difficult to solve properly by using traditional optimization methods.
配電網(wǎng)網(wǎng)架規(guī)劃是一個(gè)復(fù)雜的組合優(yōu)化問(wèn)題，傳統(tǒng)的優(yōu)化方法往往難以解決此類(lèi)問(wèn)題。
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.
通過(guò)在具體實(shí)例中的應(yīng)用表明，采用遺傳算法為有效地解決這一復(fù)雜組合優(yōu)化問(wèn)題提供了一種新途徑。