您要查找的是不是:
- Multimethod collaborative optimization algorithm based on serial collaboration is advanced to get better global optima of complex optimization problem. 為更好地求解復雜優(yōu)化問(wèn)題的全局最優(yōu)解,提出了基于串聯(lián)協(xié)作的多方法協(xié)作優(yōu)化方法。
- The implementation issue for solving this complex optimization problem was discussed and an instance for Shanghai Pudong Airport was given to demonstrate the significance of the work. 討論了該復雜優(yōu)化問(wèn)題的分解方法,給出了上海浦東機場(chǎng)地面網(wǎng)絡(luò )的算例,驗證了所做工作的實(shí)用性。
- Above all, IEA is an algorithm with good properties, and it can be widely applied to solve complex optimization problems in water science. 總之,免疫進(jìn)化算法是一種性能良好的優(yōu)化算法,它能夠被廣泛用于解決水科學(xué)中的復雜優(yōu)化問(wèn)題。
- The PSO algorithm is a new evolutionary computation method which is applicable to complex optimization problems that are nonlinear, nondifferentiable and multimodal. 微粒群算法是一種新興的算法,它能有效地解決非線(xiàn)性、不可微、多峰的復雜優(yōu)化問(wèn)題。
- An equation or inequality relating the variables in an optimization problem. 在優(yōu)化問(wèn)題中,一種表示若干變量相互關(guān)系的方程(式)或不等式。
- The vessel stowage planning is not only a complex combination and optimization problem, but also a NP-Complete problem. 大型集裝箱船舶配載問(wèn)題是一個(gè)復雜的組合優(yōu)化問(wèn)題,而且是一個(gè)NP問(wèn)題。
- Again, this is a multi-variate optimization problem. 這也是一個(gè)多變量的最優(yōu)化問(wèn)題。
- Layout problem is a combinatory optimization problem. 布局問(wèn)題是一個(gè)組合最優(yōu)化問(wèn)題。
- The TSP is a classic combinatorial optimization problem. TSP是經(jīng)典的組合優(yōu)化問(wèn)題。
- The GA can figure out a global optimization in a bionic process, providing a general frame to solve the optimization problem of the large complex system"s FD, and it"s robust. 遺傳算法作為一種模仿生物進(jìn)化過(guò)程的全局優(yōu)化算法,提供了一種求解復雜系統優(yōu)化問(wèn)題的通用框架,對問(wèn)題的種類(lèi)有很強的魯棒性。
- As an important procedure of the manufacturing process in refinery, oil blending could be abstracted as a complex non-linear optimization problem (NLP) with many constraints. 摘要針對復雜的非線(xiàn)性約束優(yōu)化問(wèn)題,提出了一種含變異算子的兩群微粒群算法。
- The truck dispatching can be taken as a multivariable optimization problem. 卡車(chē)調度可以化為一個(gè)受多變量影響的最值問(wèn)題。
- Task allocation problem is a typical combinatorial optimization problem. 任務(wù)分配問(wèn)題是一類(lèi)典型的組合優(yōu)化問(wèn)題。
- Electric distribution network reconfiguration is a complex optimization process aimed at finding a radial operating structure that minimizes the system power loss. 配電網(wǎng)絡(luò )是一個(gè)復雜的網(wǎng)絡(luò ),對其進(jìn)行網(wǎng)絡(luò )重構的目的就是為了使網(wǎng)損最小。
- How to distribute communication jammer shells can get least quantities, maximal interference cover area, and the highest receiving power, it is a complex multi-target optimization problem. 通信干擾彈如何分布才能使干擾彈數量最少,干擾覆蓋面積最大,干擾信號的收信功率最強,這是一個(gè)比較復雜的多目標優(yōu)化問(wèn)題。
- The algorithm is suit for handling the complex and nonlinear optimization problems. 該算法適合處理非線(xiàn)性?xún)?yōu)化問(wèn)題。
- The algorithm decomposes the complex non-linear optimal problem into three courses, according to the different constraints. 該算法將復雜的非線(xiàn)性?xún)?yōu)化問(wèn)題根據不同的優(yōu)化約束條件,分解為三個(gè)求解階段。
- The cast grouping and ordering problem of steelmaking continuous casting hot rolling (SM-CC) is a combinatorial optimization problem. 摘要煉鋼-連鑄生產(chǎn)的澆次組合與排序是帶有工藝約束的并行機流水車(chē)間調度問(wèn)題。
- The final control net is obtained by solving a nonlinear optimal problem. 重構曲線(xiàn)的最終控制網(wǎng)格可通過(guò)求解一個(gè)非線(xiàn)性?xún)?yōu)化問(wèn)題獲得。