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

1、Efficient Planning of Substation Automation System CablesThanikesavan Sivanthi and Jan PolandABB Switzerland Ltd, Corporate Research, Segelhofstrasse 1K, 5405, Baden-D¨ attwil, Aargau, SwitzerlandAbstract. The manua

2、l selection 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

3、 modeling of the substation automation system cable planning as an integer linear optimization problem to gen- erate an efficient cable plan for substation automation systems.1 IntroductionCabling between different devic

4、es of a substation automation system (SAS) [1] is a major cost factor in the SAS design process. Usually computer aided de- sign software is used to create the design templates of SAS devices and their interconnections.

5、The design templates are then instantiated in a SAS project and the cables are manually assigned to the connections. The selection and as- signment of cables to connections must follow certain engineering rules. This eng

6、ineering process 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 pla

7、nning can be 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 t

8、he formulation 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

9、to study 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 probl

10、em. The 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

11、design 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 Heidelbe

12、rg 2011212 T. Sivanthi and J. Polandrepresent the set of all cable types, where M is the total number of cable types in a sub problem. In a cable instance, there can be one or more connections and we refer to the connect

13、ion with lowest index among all connections in the cable instance as the leader and the other connections as the followers. This implies that all connections except the first connection in C can either be a leader or fol

14、lower. Moreover, based on the signal rules a set of connection pairs X can be derived where each (i,? i) ∈ X represents the connections i and ? i that must notbe assigned to the same cable. Let ¯ C be the set of con

15、nection pairs (i,? i) wherei,? i ∈ C, i > ? i, (i,? i) / ∈ X. We introduce the following binary variable Xi,? i, where(i,? i) ∈ ¯ C, which when true implies that connection i is a follower of a leader ? i.Xi,? i

16、= 0 or 1, where (i,? i) ∈ ¯ C . (1)Similarly, based on the cable rules a set of connection cable pairs Y can be derived where each (i, j) ∈ Y implies that cable type j is not allowed for connection i. Let ¯ K b

17、e 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) ∈ ¯ K, which whentrue implies that the leader i is assigned to an instance o

18、f cable type j.Yi,j = 0 or 1, where (i, j) ∈ ¯ K . (2)Table 1 illustrates all binary variables corresponding to the example shown in Figure 1 for the case with two cable types K1 and K2. It is assumed that connectio

19、ns 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 except the first connection, which must be a leader, can either be a leader or

20、follower. This is ensured by the following constraint.?(i,? i)∈ ¯ CXi,? i +?j∈K(i,j)∈ ¯ KYi,j = 1, ?i ∈ C . (3)A connection which is a leader in a cable cannot be a follower of a leader in another cable. This i

21、s expressed by the following constraint.Xi,? i +?(? i,i?)∈ ¯ CX? i,i? ≤ 1, ?(i,? i) ∈ ¯ C . (4)An implicit constraint of the cable planning problem is the capacity constraint which implies that the number of co

22、nnections assigned to a cable must be lessTable 1. Binary variables corresponding to Figure 1 exampleC1 C2 C3 C4 C5 K1 K2C1 - - - - - Y1,1 Y1,2C2 X2,1 - - - - Y2,1 Y2,2C3 - X3,2 - - - - Y3,2C4 X4,1 X4,2 X4,3 - - Y4,1 Y4,