外文翻譯---變電站電纜自動(dòng)化系統(tǒng)的有效計(jì)劃-plc設(shè)計(jì)(完整版)
【正文】 number of conductors which is discrete uniformly distributed between 1 and 5. Each connection is allowed to be assigned to M out of the nine cable types, where M is discrete uniformly distributed between 3 and 6. Furthermore, the number of connection pairs which 214 T. Sivanthi and J. Poland Fig. 2. Performance obtained with different solvers cannot be assigned to the same cable is on average equal to (N ? 2)/3. It should be noted that the sub problem instances generated are harder than typical SAS cable planning sub problems. The instances are solved using different solvers and the results obtained are shown in Figure 2. The left plot shows the median putation time to obtain the optimal solution with some nonmercial solvers SCIPSOPLEX [2] [3] [4], CBC [5] and mercial solver CPLEX [6]. The right plot shows the performance of the nonmercial solvers relative to CPLEX. It is observed that SCIPCLP which is on average times slower than CPLEX scales well with increasing problem size unlike CBCCLP which scales poorly and is on average times slower than CPLEX. The salient result of our experiment is that even the harder than typical instances are fairly easily solved, therefore the integer linear optimization formulation clearly offers time and cost efficient solution for SAS cable planning. 5 Conclusion This paper presented the modeling of substation automation system cable planning as an integer optimization problem to generate a more efficient cable plan for substation automation systems. The results obtained for typical test cases show that the integer linear optimization formulation clearly offers time and cost efficient solution for the substation automation system cable planning. References 1. Brand, ., et al.: Substation Automation Handbook. Utility Automation Consulting (2020) 2. Achterberg, T.: SCIP: Solving Constraint Integer Programs. J. Math. Prog. Comp. 1(1), 1–41 (2020) 3. Achterberg, T.: Constraint Integer Programming, Technische Universit168。通常計(jì)算機(jī)輔助設(shè)計(jì)軟件是用來(lái)創(chuàng)建變電站自動(dòng)化系統(tǒng)設(shè)計(jì)模板的和設(shè)備之間的聯(lián)系。 本文組要內(nèi)容如下。每個(gè)任務(wù)由一個(gè)或多個(gè)表 ,每個(gè)表的字段是邏輯組設(shè)備如圖 1 所示。 電纜規(guī)則指定了允許的電纜類(lèi)型的一組連接，它還可以指定備用導(dǎo)體的數(shù)量和每個(gè)實(shí)例允許的電纜類(lèi)型。 讓 }......321{ NC ，? 代表的所有連接兩個(gè)區(qū)域之間的雙 ,其中 N 是總數(shù)量的連接 ,并且 }......3,2,1{ MK ? 代表的所有電纜類(lèi)型，在 M 是累計(jì)有線數(shù)字類(lèi)型的子問(wèn)題。正如前面提到過(guò)的所有連接的第一個(gè)連接除外 ,它必須是一個(gè)領(lǐng)導(dǎo)者，可以是一個(gè)領(lǐng)導(dǎo)者或是跟隨者。 .),(,)*,(),(,1 _**_^^*, ^^ Ciiiw he r e iCiiiiXX iiii ?????? （ 6） 類(lèi)似地 ,下面的約束禁止一個(gè)跟隨者選擇一個(gè)領(lǐng)袖 ,他的選擇電纜類(lèi)型不是一個(gè)允許的電纜類(lèi)型的跟隨者。 4 結(jié)果 為了進(jìn)行有意義的實(shí)驗(yàn)中，由于缺乏足夠的真正的子問(wèn)題的實(shí)例 ,我們生成的隨機(jī)子問(wèn)題實(shí)例與九電纜類(lèi)型。正確的圖顯示 ,非商業(yè)性的性能相對(duì)于動(dòng)態(tài)的解決。 at Berlin (2020) 4. SCIP Mixed Integer Programming Solver, 5. CLP Linear Programming Solver, 6. CPLEX Optimizer, cplexoptimizer 。實(shí)例使用不同的解決者和解決獲得的結(jié)果如圖 2 所示。電纜的目標(biāo)規(guī)劃問(wèn)題會(huì)被指定為： ?? ?_),( ,:m in Kji jij YMim iz e （ 8） 在 jM 的價(jià)錢(qián)是線纜 j 。在這個(gè)方程式中 ,如果連接 ^i 是一個(gè)領(lǐng)導(dǎo)者那么整體的所有連接包括連接 ^i 和它的追隨者小于電纜的能力需求 ,^j 型 i 分配 ,否則方 程在缺省情況下是滿(mǎn)意的。 Ciiw he r eorX ii ?? ),(,10 ^, ^ （ 1） 表 1 說(shuō)明了所有二進(jìn)制變量對(duì)應(yīng)于圖 1 所示的例子為案例和兩個(gè)電纜類(lèi)型1K 和 2K 。這種分解背后的基本原理是 ,電纜計(jì)劃應(yīng)該考慮物理裝配接口類(lèi) ,不應(yīng)該混之間的聯(lián)系兩個(gè)不同的源或目標(biāo)物理裝配接口類(lèi)在一份電報(bào)。這個(gè)類(lèi)型的電纜的連接分配是基于電纜工程規(guī)則。 SAS 電纜規(guī)劃是目前由計(jì)算機(jī)（ CAD）輔助設(shè)計(jì)工程師手工完成的。本文
畢業(yè)設(shè)計(jì)相關(guān)推薦
鄂ICP備17016276號(hào)-1