外文翻譯---變電站電纜自動化系統(tǒng)的有效計劃

1、Efficient Planning of Substation AutomationSystem CablesThanikesavan Sivanthi and Jan PolandABB Switzerland Ltd, Corporate Research,Segelhofstrasse 1K, 5405, Baden-D¨attwil, Aargau, SwitzerlandAbstract The manual se

2、lection and assignment of appropriate cables to the interconnections between the devices of a substation automation system is a major cost factor in substation automation system design. This paper discusses about the mo

3、deling of the substation automation system cable planning as an integer linear optimization problem to generate an efficient cable plan for substation automation systems.1 IntroductionCabling between different devices of

4、 a substation automation system (SAS) is a major cost factor in the SAS design process. Usually computer aided design software is used to create the design templates of SAS devices and their interconnections. The design

5、templates are then instantiated in a SAS project and the cables are manually assigned to the connections. The selection and assignment of cables to connections must follow certain engineering rules. This engineering pro

6、cess is usually time consuming and can cause engineering errors, thereby increasing the engineering cost. Apparently, the SAS cable planning is related to the well known bin packing problem. The SAS cable planning can b

7、e formulated as an integer linear optimization problem with the cable engineering rules expressed as a set of linear constraints and a cost objective for minimizing the total cable cost. This paper describes the formula

8、tion of SAS cable planning problem as an integer linear optimization problem and presents the results for some representative test cases. To the best of the authors’ knowledge the work is the first of the kind to study

9、 SAS cable planning. The paper is organized as follows. Section 2 presents an overview of the SAS cable planning process. Section 3 expresses the SAS cable planning problem as an integer linear optimization problem. Th

10、e results obtained by solving the optimization problem using some solvers is presented in Section 4. Section 5 draws some conclusions of this work.2 SAS Cable PlanningThe SAS cable planning begins after the system desig

11、n phase of a SAS project.The SAS cable planning is at present done manually by computer aided designT. Achterberg and J.C. Beck (Eds.): CPAIOR 2011, LNCS 6697, pp. 210–214, 2011.c Springer-Verlag Berlin Heidelberg 2011Ef

12、ficient Planning of Substation Automation System Cables 211total number of connections, and K = {1, 2, 3, . . .,M}212 T. Sivanthi and J. Polandrepresent the set of all cable types, where M is the total number of cable ty

13、pes in a sub problem. In a cable instance, there can be one or more connections and we refer to the connection with lowest index among all connections in the cable instance as the leader and the other connections as the

14、 followers. This implies that all connections except the first connection in C can either be a leader or follower. Moreover, based on the signal rules a set of connection pairs X can be derived where each (i,?i) ∈ X rep

15、resents the connections i and?i that must not be assigned to the same cable. Let ˉ C be the set of connection pairs (i,?i) where i,?i ∈ C, i >?i, (i,?i) /∈ X. We introduce the following binary variable Xi,?i, where (i

16、,?i) ∈ ˉ C, which when true implies that connection i is a follower of a leader?i.(1) C i i where or Xi i ? ? ) , ( , 1 0^,^Similarly, based on the cable rules a set of connection cable pairs Y can be derived where each

17、 (i, j) ∈ Y implies that cable type j is not allowed for connection i.Let ˉK be the set of connection cable pairs (i, j), where i ∈ C, j ∈ K, (i, j) /∈ Y. We introduce the following binary variable Yi,j, where (i, j) ∈ ˉ

18、K , which when true implies that the leader i is assigned to an instance of cable type j.(2)_ ^, ) , ( , 1 0 K j i where or X j i ? ?Table 1 illustrates all binary variables corresponding to the example shown in Figure

19、1 for the case with two cable types K1 and K2. It is assumed that connections C1 and C3 cannot be assigned to the same cable and K1 is not an allowed cable type for connection C3. As mentioned before all connections exc

20、ept the first connection, which must be a leader, can either be a leader or follower. This is ensured by the following constraint.（3） C i Y XK j i K jj iC i ii i ? ? ? ? ? ?? ? ?, 1) , ( ,,) , (, ^^A connection which is

21、a leader in a cable cannot be a follower of a leader in another cable. This is expressed by the following constraint.（4）_ ^*) , (, , ) , ( , 1_ ^^ ^ C i i X XC i ii i i i ? ? ? ? ??An implicit constraint of the cable pl