OBJECTIVE To design an algorithm that can be used for planning the location of distribution substations in a network.

Size: px
Start display at page:

Download "OBJECTIVE To design an algorithm that can be used for planning the location of distribution substations in a network."

Transcription

1 SUBSTATION DESIGN PRJ 100 SAIDI FELIX JUMA F17/9366/2002 SUPERVISOR: DR.CYRUS WEKESA EXAMINER:DR. M.K. MANG OLI

2 OBJECTIVE To design an algorithm that can be used for planning the location of distribution substations in a network.

3 ELECTRICAL SUBSTATION DEFINITION A subsidiary station of an electricity generation, transmission and distribution system where voltage is transformed from one level to another using transformers

4 TYPES OF SUBSTATIONS Transmission SS Distribution substation - transfers power from the transmission system to the distribution system of an area

5 CHOICE OF GA Substation location is an optimization problem. As the location varies so do the lengths of conductors which immediately connect the SS to the network nodes GA is a search technique used in computing to find exact or approximate solutions to optimization problems. It is an optimization tool.

6 GENETIC ALGORITHM WORKING INITIALIZATION many individual solutions are randomly generated to form an initial population SELECTION proportion of initial population chosen to breed a new generation. Individual solutions chosen on a fitness based process. Roulette wheel selection is a common selection method. REPRODUCTION crossover and mutation genetic operators are used to create next generation. Average fitness of next generation is better than for previous TERMINATION generation process is repeated until a termination condition is reached

7 CROSSOVER

8 MUTATION

9 SIMPLE GA PSEUDOCODE Choose initial population Evaluate the fitness of each individual in the population Repeat the steps below until termination select best ranking individuals to reproduce Breed new generation through crossover and/or mutation and produce offspring Evaluate the individual fitnesses of the offspring.

10 CONSTRAINTS OF PROBLEM All load points must be supplied Each load point is supplied by just one substation A substation can supply more than one load

11 STRUCTURE For optimization of the problem, the solutions are encoded in a matrix structure (CHROMOSOMES) In these chromosomes the number of rows equals to the number of substations (involving the existing and candidate ones) where En is the number of existing substations and Nn is the number of candidate substations

12 Chromosome structure

13 PROCEDURE IN MATLAB The creation function (SP_Create) was designed. This creates the first population used by the GA. Fitness function was created. This assigned a fitness score that s inversely proportional to the difference between the solution and the value a chromosome represents.

14 Procedure cont. A multipoint crossover function and the mutation function was written to carry out the generations. Behaviour of fitness function was checked in the GA TOOL and the M file (SP_main) created. This was then made to take in data from excel file DATA and also the output was given in excel file RESULTS

15 GENETIC ALGORITHM TOOL

16 working Program uses DATA.xls as its input. It has the following worksheets; 1. Input load data 2. Present substations and their capacities 3. Candidate points

17 Inputting data

18 Sample loads and coordinates

19 Current substations

20 Candidate points

21 Running program Once data has been entered the program is run by invoking the following in MATLAB 1. DSP.fig 2. DSP 3. SP_main

22 GUI

23 PROGRESS

24 PLOT OF SS LOCATION AND CAPACITY

25 RESULTS FILE Contains the following worksheets 1. Transformer capacities 2. Transformer powers 3. Substation coordinates 4. Load (X-Y) and substation (X-Y) links

26 Load and Substation links

27 CONCLUSION A genetic algorithm for optimal location of distribution substations and determination of their locations was generated

28 RECOMMENDATIONS The algorithm developed was attaining local optima. Combination of GA and other optimization methods should be explored. This is due to the fact that although GA finds good local solutions, its quite inefficient in finding the last mutations to find absolute optimum

29 Recent research suggests use of more than one parent can yield better quality chromosomes. This should be explored.

30 thanks for your attention