CHAPTER 3 SECURITY CONSTRAINED OPTIMAL SHORTTERM HYDROTHERMAL SCHEDULING


 Jonathan Ramsey
 5 years ago
 Views:
Transcription
1 60 CHAPTER 3 SECURITY CONSTRAINED OPTIMAL SHORTTERM HYDROTHERMAL SCHEDULING 3.1 INTRODUCTION Optimal shortterm hydrothermal scheduling of power systems aims at determining optimal hydro and thermal generations in order to meet the load demands over a scheduled horizon of one day or a week while satisfying the various constraints on the hydraulic and power system network (Wood and Wollenberg 1996). The objective is to minimize total operation costs of thermal plants. The problem is a complex mathematical optimization problem with a highly nonlinear and computational expensive environment. In literature the hydrothermal scheduling with various constraints have been solved effectively by using GA based algorithms. However, none of these works reported in the literature considered the security constraints in the hydrothermal scheduling formulation, which are important from the point of view of practical application. In the present work, security constrained hydrothermal scheduling is solved using decomposition approach and GA based OPF. Also, GA based algorithm is implemented to solve the security constrained hydrothermal scheduling problem. The hydro subproblem is solved using proposed GA and thermal subproblem is solved using lambda iteration technique. GA based OPF is implemented only for the constraints violated intervals.
2 STATEMENT OF OPTIMAL HYDROTHERMAL SCHEDULING The generation mix of hydro and thermal plants for optimal scheduling is considered. For a number of time intervals N, the set of hydro plants is NH and the set of thermal units are NT. A typical shortterm hydrothermal generation scheduling problem is formulated as (Mohan et al 1993): NT N Min. TPC F mj(pt mj) m1 j1 (3.1) subject to: the characteristic equations of the hydro plants where Y, i j 1 Y ij AL ij  D ij NH µ ik k 1 ik = 1 if reservoir i is down stream to reservoir k = 0 otherwise D ik ; i 1,2,...NH; j 1,2,...N (3.2) the active power generation of hydro plants PH ij (H oi/g)[1 C i(yij Y i, j 1)/2]D ij; i 1,2,...NH; j 1,2,...N the limits on water storage level in reservoirs (3.3) Y i (min) Yij Yi (max) ;i 1,2,...NH; j 1,2,...N 1 (3.4) with Y i1 and Y i, N+1 fixed for i = 1,2, NH
3 62 the limits on water discharge D i (min) Dij Di (max) ;i 1,2,...NH; j 1,2,...N (3.5) the limits on active power generation of hydro units PH i (min) PHij PHi (max) ;i 1,2,...NH; j 1,2,...N (3.6) The optimal power flow problem for j th interval with transmission security constraint is formulated as: NT Min. TFCj (ampt m m 1 s 2 mj b m PT mj subject to: the power balance constraints cm) aspt 2 sj bspt sj cs ; j 1,2,...N (3.7) NT PT mj PDth, j PL j ; j 1,2,...N (3.8) m1 where PD th, j PD j  NH i 1 PH i, j generation limit constraints PT PT PT ;m 1,2,...NT; j 1,2,...N (3.9) m, (min) mj m, (max) the slack bus constraint PT PT PT ; j 1,2,...N (3.10) s, (min) sj s, (max)
4 63 line flow constraint k, (min) k k, (max) ; k = 1, 2,.. NL (3.11) the power flow equations F i (X, U, C) = 0; i = 1, 2,.. NB (3.12) where the state vector X comprises of the bus voltage phase angles and magnitudes. The control vector U comprises of all the controllable system variables like real power generations. The parameter vector C includes all the uncontrollable system parameters such as line parameters, loads, etc. 3.3 SECURITY CONSTRAINED OPTIMAL SHORTTERM HYDROTHERMAL SCHEDULING USING DECOMPOSITION APPROACH The optimal hydrothermal scheduling problem is solved in two phases. In the first phase the initial feasible water storage trajectory is obtained using Discharge Proportional to Demand Method (DPDM). For this water discharge a hydrothermal scheduling is obtained. In the next phase, the schedule is improved using local variation approach and lambda iteration technique to improve the hydrothermal scheduling. Line flow constraints are checked for its limits and GA based OPF is applied only to the intervals at which line flow constraints violate the limits. The algorithmic steps for the implementation of the proposed algorithm is as follows: Algorithm for Initial Water Storage Trajectory Step 1: Choose an initial water storage trajectory for each hydro plant using discharge proportional to demand method.
5 64 Determine the water discharge D ij and the hydro plant output Ph ij for i = 1,2 NH and j = 1,2 N. Step 2: Step 3: Step 4: For each time interval, j = 1,2 N compute the difference between system demand and total hydro power generation, PD th, j. PD th, j is considered as demand for the thermal units. The thermal subproblem is solved using lambda iteration technique. The fuel cost is calculated for each interval including transmission losses Discharge Proportional to Demand Method Step 1: Step 2: Step 3: Obtain total demand (PD tot ) by summing up the demands of the time intervals, j = 1,2 N. Obtain the total discharge (D i, tot ) by summing up the discharge of the time intervals, j = 1,2 N for each hydro plant i = 1,2 NH. Calculate the initial feasible water discharge for each hydro plant using the formula: D ij (PDj / PDtot) Di, tot ; i 1,2,...NH; j 1,2,...N (3.13) where, PD tot is the total system demand D i, tot is the total discharge of all hydro plants i =1,2 NH
6 Improving the Water Storage Trajectory Step 1: Set the hydro plant index, i = 1. Step 2: Set the time interval index, j = 1. Step 3: Step 4: Step 5: Step 6: Perturb the storage level of the hydro plant at the end of j th interval by +Y. Compute the discharge D ij and hydro generations, PH ij for the ith plant in the j th interval. Corresponding to the hydro generation PH ij, compute the optimal thermal generation schedule, P mj for the thermal plants m = 1,2 NT using lambda iteration technique. Repeat steps 4 and 5 for (j + 1) th interval. Step 7: Compute the total cost for j th and (j + 1) th intervals. Check for cost reduction by comparing preperturbed trajectory. If cost is less, proceed to step 8. Otherwise repeat steps 4 to 7 with a perturbation of Y. If the cost is less, go to step 8. Otherwise, retain the preperturbed storage level and go to step 8. Step 8: Step 9: Step10: Increment the interval index, j = j + 1. If j < N go to step 3. Otherwise go to step 9. Increment the hydro plant index, i= i + 1. If i < NH go to step 2. Otherwise go to step10. Repeat the above procedure until the maximum generation count is reached.
7 Genetic Algorithm Based OPF The optimal solution for the GA based OPF includes power balance equality constraints, limits on the active power generations and limits on line phase angle as inequality constraints. Units under decommitted hours, power generation varies significantly at the generator buses. Subsequently, variation in the line flows may lead to overloading of the lines. The approach of genetic algorithm limits the flow in the overloaded lines by adjusting the real power generations of the committed units. Fastdecoupled load flow method is used to calculate the line losses and the line flows. The various steps of the algorithm for solving the OPF problem with line flow constraints for each interval are same as discussed in section NUMERICAL EXAMPLES AND RESULTS The proposed algorithm has been tested on two sample systems, one with 9 buses, 11 transmission lines, 4 thermal plants and 3 hydro plants and an adapted Indian utility system comprising 66 buses, 93 transmission lines, 12 thermal plants and 11 hydro plants. 66bus and 9bus system data are provided in the Appendices 2 and 3 respectively. To prove the effectiveness of the discharge proportional to demand method, it is compared with the Average Inflow Method (AIFM). In the AIFM the discharge during each interval is made equal to the average inflow, which is obtained by summing the inflows to the reservoir during all the intervals and dividing it by the number of intervals.
8 67 Figures 3.1and 3.2 shows the cost convergence characteristics of 9 bus and 66bus systems respectively AIFM DPDM Total Fuel Cost (Rs) Hydro Thermal Iterations Figure 3.1 Cost convergence of 9bus system DPDM AIFM Total Fuel Cost (RS) Hydro Therm al Iterations Figure 3.2 Cost convergence of 66bus system
9 68 It is seen from Figures 3.1 and 3.2 that DPDM takes less number of iterations to reach the optimum solution and also it is seen that convergence is faster in the first few iterations and slow during the subsequent iterations and also the convergence curve is almost flat in the later part. AIFM takes more number of iterations to reach the near optimum solution. A number of trial studies were made on both the systems to choose the best initial incremental step size for Y and its subsequent reduction during trajectory perturbation from the convergence point of view. It is observed that the initial value of Y equal to 30 % of the initial discharge is the best choice, also its value should be reduced by 50% in the second and third iterations and thereafter maintained constant. Table 3.1 provides the cost comparison of both the methods for 9 bus and 66bus systems. In DPDM both the initial and final cost obtained is less as compared to AIFM. For a 9bus system, using DPDM the cost saving is 3.8 % as compared to AIFM and in the 66bus system the cost saving using DPDM is 0.24 % as compared to the AIFM. Table 3.1 Cost comparisons of AIFM and DPDM System Solution DPDM (Rs) AIFM (Rs) 9bus 66bus Initial Final Initial Final Figures 3.3 and 3.4 gives the discharge trajectory of plant 1 in the 9bus system for AIFM and DPDM. In AIFM the initial Discharge trajectory is 200cms, so it takes more number of iterations to reach the
10 69 optimum discharge. In DPDM the initial discharge trajectory is very close to the final discharge and it takes less number of iterations to reach the optimum discharge initial final Dishcarge (cms) Time Interval (hours) Figure 3.3 Discharge trajectory for plant 1 in 9bus system AIFM initial final Discharge (cms) Time Interval (hours) Figure 3.4 Discharge trajectory for plant 1 in 9bus System DPDM
11 70 Table 3.2 gives the comparison of optimal discharge obtained for the 9bus system using AIFM and DPDM for 24 intervals. Table 3.2 Comparison of optimal discharge obtained for 9bus system Interval (Hours) Optimal discharges of hydro plants in CMS (AIFM) Plant 1 Plant 2 Plant 3 Optimal discharges of hydro plants in CMS (DPDM) Total Total Plant 1 Plant 2 Plant 3 discharge discharge
12 71 Figure 3.5 shows the daily load curve of the 66bus utility system. A set of 12 limiting lines is chosen for observing line flow constraint violations. Demand (MW) Time Interval (hours) Figure 3.5 Load curve of 66bus system Table 3.3 gives the line phase angles of the violated line number 7 of a 66bus system. AIFM gives the line violations at intervals 1, 2, 3, 23 and 24. The GA based OPF removes the line flow violations by adjusting the real power generations and consequently the cost is increased from Rs to Rs DPDM gives the line violations at intervals 1, 2, 23 and 24. The GA based OPF removes the line flow violations by adjusting the real power generations and the cost is increased from Rs to Rs
13 72 Table 3.3 Comparison of line phase angle (degrees) for AIFM and DPDM Violated line no. Rating (degrees) Interval no. Before OPF (degrees) AIFM After OPF (degrees) Before OPF (degrees) DPDM After OPF (degrees) SECURITY CONSTRAINED OPTIMAL SHORTTERM HYDROTHERMAL SCHEDULING USING GA GA is applied to solve the security constrained optimal hydrothermal scheduling problem. The hydro subproblem is solved using GA and thermal subproblem is solved using lambda iteration technique without line losses. Both the hydro and thermal subproblems are solved alternatively. The total fuel cost over the time period is calculated including line losses for the best hydrothermal schedule obtained using proposed GA. Line flow constraints are checked for its limits at each interval. GA based OPF is implemented only for the constraint violated intervals. Fastdecoupled load flow method is used to calculate the line flows and losses. Computation of line flows and losses in each generation of genetic algorithm increases the computational time and increases the complexity of the problem. This proposed GA reduces the complexity, computation time and also gives near global optimum solution.
14 73 The hydro subproblem is solved using GA by creating the initial populations randomly. The strings generated in the population represent the discharge of each interval for all the plants. For the discharge, equivalent hydropower generations are calculated. The sum of hydropower generations of all the plants for each interval gives the demand for thermal subproblem. The thermal subproblem is solved using lambda iteration technique without considering losses. The cost obtained from economic dispatch and the penalty functions for the constraint violations are considered as objective function. Line losses and line flow constraints are computed only for the best solution obtained using GA. The various steps of the algorithm for solving the proposed GA for hydrothermal scheduling are given below Initialization of Population For the application of GA to the hydro scheduling problem a simple binary alphabet was chosen to encode a solution. Let the number of hydro units be NH, the string (in binary codes) be S and the number of time intervals be N, then each parent population is represented as follows: Step 1: Step 2: A number of initial binarycoded solutions (genotypes) are generated at random to form the initial parent of population size N p. Each string (S) represents the discharge for that particular interval of that unit (Figure 3.6). Binary strings are decoded to real values D ij (discharges) for the i th reservoir, i = 1,2 NH during the j th discrete time interval, j = 1,2 N.
15 74 S 1 S 2 S 3 S N1 S N U U U NH Figure 3.6 Binary representation of hydro discharges Step 3: Step 4: Step 5: Step 6: Each discharge D ij is checked for minimum and maximum limits. If discharge D ij is less than the minimum discharge level it is made equal to minimum discharge and if the discharge D ij is greater than the maximum discharge level it is made equal to maximum discharge. Corresponding generation schedule of the hydro plants, Ph ij ; i = 1,2 NH is calculated. In each time interval, j = 1,2 N compute the balance demand to be met from thermal units PD th, j by taking the difference between the system demand and the total hydropower generation. The scheduling of thermal units were done for the demand of PD th, j. This economic dispatch problem is solved using lambda iteration technique. The fuel cost is calculated for each interval excluding transmission losses.
16 75 Step 7: The fitness function for each parent population F pi is computed as: NH N pi, lim pi, lim pi Tpi 1 i 2 j p i 1 j 1 F FC k DH k PT ; pi 1, 2,..., N (3.14) where K 1, and K 2 are penalty factors for the constraint violations, FC Tpi is the total fuel cost for pith parent and the constraint violations are given by DH pi, lim i N j 1 if ((Y if D ij N j 1 N j 1  ((Y D i, (min) D ij ((Y  Y ij i, (min) i, (max) ((Y  Y i, (min) ) i, (min) i, (max)  Y N j 1  Y ) N i, (max) j 1 ) AL ij) i, (max) AL N j 1 ) ij N j 1 D N ), j 1 AL ij, AL ij ij ) ) (3.15) NT NT PDth, j PTm, (max), if PDth, j PTm, (max) pi, lim m 1 m 1 PTj (3.16) NT NT PTm, (min)  PDth, j, if PDth, j PTm, (min) m 1 m 1 Equation (3.14) represents the fitness function of parent population N p, equation (3.15) represents the constraint violation of total discharge for NH hydro plants and equation (3.16) represents the constraint violation of total thermal generation of NT thermal plants.
17 Reproduction The reproduction operator is a prime selection operator. Two genotypes are selected using Roulette wheel parent selection algorithm that selects a genotype with a probability proportional to genotypes relative fitness within the population. Then, a new offspring genotype is produced by means of the two basic genetic operators namely crossover and mutation Crossover To get the new patterns of genetic strings during the evolution process, two levels of crossover operation, i.e. string level crossover and population level crossover are introduced. Both type of crossover is done with fixed probability of String level crossover A good scheduling is expected by exchanging the strings of the units within the genotype. Since the partial string of genotype has no fitness function value, the selection processes are performed randomly with certain probability Population level crossover This operator is applied with certain probability. When applied, the parent genotypes are combined to form two new genotypes that inherent solution characteristics from both parents. In the opposite case the offspring are identical replications of their parents. Crossover is done between the parent genotypes obtained from roulette wheel parent selection. The crossover scheme used is singlepoint crossover.
18 Mutation Mutation introduces new genetic material into the gene at some low rate. With a small probability, randomly chosen bits of the offspring genotypes change from 0 to 1 and vice versa Selection The entire population, including parent and offspring are arranged in descending order. The best N p solutions, which survive are transcribed along with their elements to form the basis of the next generation. The above procedure is repeated until the given maximum generation count is reached Genetic Algorithm Based OPF The optimal solution for the GA based OPF includes power balance equality constraints, limits on the active power generations and limits on line phase angle as inequality constraints. Units under decommitted hours, power generation varies significantly at the generator buses. Subsequently, variation in the line flows may lead to overloading of the lines. The approach of genetic algorithm limits the flow in the overloaded lines by adjusting the real power generations of the committed units. Fastdecoupled load flow method is used to calculate the line losses and the line flows. The various steps of the algorithm for solving the OPF problem with line flow constraints for each intervals are as discussed in section
19 NUMERICAL EXAMPLES AND RESULTS The proposed algorithm has been tested on two sample systems, the first one consisting of 9 buses, 11 transmission lines, 4 thermal plants and 3 hydro plants and the second with an adapted Indian utility system comprising 66 buses, 93 transmission lines, 12 thermal plants and 11 hydro plants. 66bus and 9bus system data are provided in the Appendices 2 and 3 respectively. The proposed GA is used to solve the hydrothermal scheduling problem. In order to avoid the misleading results due to stochastic nature of the GA, 20 trial runs were made with each run starting with different random populations. The population size was 50 genotypes in all the runs. The hydro thermal scheduling convergence characteristic of fitness function for the best five individuals of a 9bus and 66bus systems using proposed GA is presented in Figure 3.7 and Figure 3.8 respectively. The fitness function convergence characteristic is drawn by taking the parent with minimum fitness value at the end of iterations. It is seen from Figure 3.7 and Figure 3.8 that fitness function converges smoothly to the optimum value without any abrupt oscillations. This shows the convergence reliability of the proposed algorithm. Figure 3.9 shows the optimal discharge trajectories of the hydro plant 1 of 9bus system. Figure 3.10 shows the daily load curve of the 9bus system. It is seen from the Figure 3.9 that the hydro discharge trajectory obtained by the proposed GA closely matches with the daily load curve. Figure 3.11 shows the daily load curve of the 66bus utility system. A set of 12 limiting lines is chosen for observing line flow constraint violations.
20 objective function ind 1 ind 2 ind 3 ind 4 ind No. of iterations Figure 3.7 Convergence characteristics of 9bus system objective function ind 1 ind 2 ind 3 ind 4 ind No. of Iterations Figure 3.8 Convergence characteristics of 66bus system
21 Discharge (cms) Time interval (hours) Figure 3.9 Discharge of hydro plant 1 of 9bus system Load (MW) T im e In terval (h ou rs) Figure 3.10 Load curve of a 9bus system
22 81 Demand (MW) Time Interval (hours) Figure 3.11 Load curve of 66bus system Table 3.4 gives the line phase angles of the violated line number 7 of a 66bus system. Hydrothermal scheduling obtained by the proposed GA gives the line flow violations at intervals 1, 2 and 24. The GA based OPF removes the line flow violations by adjusting the real power generations and consequently the cost is increased from Rs to Rs Table 3.4 Line flows in limiting line no. 7 of a 66bus system Violated line no. Rating (degrees) Interval no. Without line flow constraints (degrees) With line flow constraints (degrees)
23 SUMMARY This chapter presents a security constrained hydrothermal scheduling using decomposition approach. Initial water storage trajectory is obtained using DPDM. Using local variation method the initial storage trajectory is improved. The thermal problem is solved using lambda iteration technique. To avoid the complexity and to reduce the computational time GA based OPF is applied only to the best solution obtained from decomposition approach. Investigations reveal that the proposed method is efficient, simple and reliable. GA based security constrained hydrothermal scheduling is proposed in this chapter. The hydro subproblem is solved using GA and thermal subproblem is solved using lambda iteration technique. To avoid the complexity and to reduce the computational time, GA based OPF is applied only to the best solution obtained from GA based hydrothermal scheduling. Investigations on both systems reveal that the proposed method is relatively simple and reliable.
A Fast Computational Genetic Algorithm for Economic Load Dispatch
A Fast Computational Genetic Algorithm for Economic Load Dispatch M.Sailaja Kumari 1, M.Sydulu 2 Email: 1 Sailaja_matam@Yahoo.com 1, 2 Department of Electrical Engineering National Institute of Technology,
More informationECONOMIC GENERATION AND SCHEDULING OF POWER BY GENETIC ALGORITHM
ECONOMIC GENERATION AND SCHEDULING OF POWER BY GENETIC ALGORITHM RAHUL GARG, 2 A.K.SHARMA READER, DEPARTMENT OF ELECTRICAL ENGINEERING, SBCET, JAIPUR (RAJ.) 2 ASSOCIATE PROF, DEPARTMENT OF ELECTRICAL ENGINEERING,
More informationInternational Journal of Software and Web Sciences (IJSWS) www.iasir.net
International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) ISSN (Print): 22790063 ISSN (Online): 22790071 International
More informationIntroduction To Genetic Algorithms
1 Introduction To Genetic Algorithms Dr. Rajib Kumar Bhattacharjya Department of Civil Engineering IIT Guwahati Email: rkbc@iitg.ernet.in References 2 D. E. Goldberg, Genetic Algorithm In Search, Optimization
More informationInternational Journal of Advanced Research in Electrical, Electronics and Instrumentation Engineering
DOI: 10.15662/ijareeie.2014.0307061 Economic Dispatch of Power System Optimization with Power Generation Schedule Using Evolutionary Technique Girish Kumar 1, Rameshwar singh 2 PG Student [Control system],
More informationCHAPTER 1 INTRODUCTION
CHAPTER 1 INTRODUCTION Power systems form the largest man made complex system. It basically consists of generating sources, transmission network and distribution centers. Secure and economic operation
More informationModelbased Parameter Optimization of an Engine Control Unit using Genetic Algorithms
Symposium on Automotive/Avionics Avionics Systems Engineering (SAASE) 2009, UC San Diego Modelbased Parameter Optimization of an Engine Control Unit using Genetic Algorithms Dipl.Inform. Malte Lochau
More informationCollege of information technology Department of software
University of Babylon Undergraduate: third class College of information technology Department of software Subj.: Application of AI lecture notes/20112012 ***************************************************************************
More informationNonlinear Model Predictive Control of Hammerstein and Wiener Models Using Genetic Algorithms
Nonlinear Model Predictive Control of Hammerstein and Wiener Models Using Genetic Algorithms AlDuwaish H. and Naeem, Wasif Electrical Engineering Department/King Fahd University of Petroleum and Minerals
More informationGenetic Algorithms commonly used selection, replacement, and variation operators Fernando Lobo University of Algarve
Genetic Algorithms commonly used selection, replacement, and variation operators Fernando Lobo University of Algarve Outline Selection methods Replacement methods Variation operators Selection Methods
More informationISSN: 23195967 ISO 9001:2008 Certified International Journal of Engineering Science and Innovative Technology (IJESIT) Volume 2, Issue 3, May 2013
Transistor Level Fault Finding in VLSI Circuits using Genetic Algorithm Lalit A. Patel, Sarman K. Hadia CSPIT, CHARUSAT, Changa., CSPIT, CHARUSAT, Changa Abstract This paper presents, genetic based algorithm
More informationGenetic Algorithms for Bridge Maintenance Scheduling. Master Thesis
Genetic Algorithms for Bridge Maintenance Scheduling Yan ZHANG Master Thesis 1st Examiner: Prof. Dr. HansJoachim Bungartz 2nd Examiner: Prof. Dr. rer.nat. Ernst Rank Assistant Advisor: DIPL.ING. Katharina
More informationNumerical methods for American options
Lecture 9 Numerical methods for American options Lecture Notes by Andrzej Palczewski Computational Finance p. 1 American options The holder of an American option has the right to exercise it at any moment
More informationA Robust Method for Solving Transcendental Equations
www.ijcsi.org 413 A Robust Method for Solving Transcendental Equations Md. Golam Moazzam, Amita Chakraborty and Md. AlAmin Bhuiyan Department of Computer Science and Engineering, Jahangirnagar University,
More informationOPTIMAL DISPATCH OF POWER GENERATION SOFTWARE PACKAGE USING MATLAB
OPTIMAL DISPATCH OF POWER GENERATION SOFTWARE PACKAGE USING MATLAB MUHAMAD FIRDAUS BIN RAMLI UNIVERSITI MALAYSIA PAHANG v ABSTRACT In the reality practical power system, power plants are not at the same
More informationENHANCEMENT OF POWER SYSTEM SECURITY USING PSONR OPTIMIZATION TECHNIQUE
International Journal of Electrical Engineering & Technology (IJEET) olume 7, Issue 1, JanFeb, 2016, pp.3544, Article ID: IJEET_07_01_004 Available online at http:// http://www.iaeme.com/ijeet/issues.asp?jtype=ijeet&type=7&itype=1
More informationGenetic Algorithm TOOLBOX. For Use with MATLAB. Andrew Chipperfield Peter Fleming Hartmut Pohlheim Carlos Fonseca. Version 1.2.
Genetic Algorithm TOOLBOX For Use with MATLAB Andrew Chipperfield Peter Fleming Hartmut Pohlheim Carlos Fonseca Version 1.2 User s Guide Acknowledgements The production of this Toolbox was made possible
More informationWeightedLeastSquare(WLS) State Estimation
WeightedLeastSquare(WLS) State Estimation Yousu Chen PNNL December 18, 2015 This document is a description of how to formulate the weightedleast squares (WLS) state estimation problem. Most of the formulation
More informationLab 4: 26 th March 2012. Exercise 1: Evolutionary algorithms
Lab 4: 26 th March 2012 Exercise 1: Evolutionary algorithms 1. Found a problem where EAs would certainly perform very poorly compared to alternative approaches. Explain why. Suppose that we want to find
More informationOriginal Article Efficient Genetic Algorithm on Linear Programming Problem for Fittest Chromosomes
International Archive of Applied Sciences and Technology Volume 3 [2] June 2012: 4757 ISSN: 09764828 Society of Education, India Website: www.soeagra.com/iaast/iaast.htm Original Article Efficient Genetic
More informationHybrid Evolution of Heterogeneous Neural Networks
Hybrid Evolution of Heterogeneous Neural Networks 01001110 01100101 01110101 01110010 01101111 01101110 01101111 01110110 01100001 00100000 01110011 01101011 01110101 01110000 01101001 01101110 01100001
More informationSolving Method for a Class of Bilevel Linear Programming based on Genetic Algorithms
Solving Method for a Class of Bilevel Linear Programming based on Genetic Algorithms G. Wang, Z. Wan and X. Wang Abstract The paper studies and designs an genetic algorithm (GA) of the bilevel linear programming
More informationComparison of Major Domination Schemes for Diploid Binary Genetic Algorithms in Dynamic Environments
Comparison of Maor Domination Schemes for Diploid Binary Genetic Algorithms in Dynamic Environments A. Sima UYAR and A. Emre HARMANCI Istanbul Technical University Computer Engineering Department Maslak
More informationMemory Allocation Technique for Segregated Free List Based on Genetic Algorithm
Journal of AlNahrain University Vol.15 (2), June, 2012, pp.161168 Science Memory Allocation Technique for Segregated Free List Based on Genetic Algorithm Manal F. Younis Computer Department, College
More informationNonUniform Mapping in BinaryCoded Genetic Algorithms
NonUniform Mapping in BinaryCoded Genetic Algorithms Kalyanmoy Deb, Yashesh D. Dhebar, and N. V. R. Pavan Kanpur Genetic Algorithms Laboratory (KanGAL) Indian Institute of Technology Kanpur PIN 208016,
More informationApplication of GA for Optimal Location of FACTS Devices for Steady State Voltage Stability Enhancement of Power System
I.J. Intelligent Systems and Applications, 2014, 03, 6975 Published Online February 2014 in MECS (http://www.mecspress.org/) DOI: 10.5815/ijisa.2014.03.07 Application of GA for Optimal Location of Devices
More informationA progressive method to solve largescale AC Optimal Power Flow with discrete variables and control of the feasibility
A progressive method to solve largescale AC Optimal Power Flow with discrete variables and control of the feasibility Manuel Ruiz, Jean Maeght, Alexandre Marié, Patrick Panciatici and Arnaud Renaud manuel.ruiz@artelys.com
More informationAlpha Cut based Novel Selection for Genetic Algorithm
Alpha Cut based Novel for Genetic Algorithm Rakesh Kumar Professor Girdhar Gopal Research Scholar Rajesh Kumar Assistant Professor ABSTRACT Genetic algorithm (GA) has several genetic operators that can
More informationSystem Modelling and Online Optimal Management of MicroGrid with Battery Storage
1 System Modelling and Online Optimal Management of MicroGrid with Battery Storage Faisal A. Mohamed, Heikki N. Koivo Control Engineering Lab, Helsinki University of Technology, P.O. Box 5500, FIN0015
More informationUSBR PLEXOS Demo November 8, 2012
PLEXOS for Power Systems Electricity Market Simulation USBR PLEXOS Demo November 8, 2012 Who We Are PLEXOS Solutions is founded in 2005 Acquired by Energy Exemplar in 2011 Goal People To solve the challenge
More informationInformation Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay
Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture  17 ShannonFanoElias Coding and Introduction to Arithmetic Coding
More informationLecture 2: The SVM classifier
Lecture 2: The SVM classifier C19 Machine Learning Hilary 2015 A. Zisserman Review of linear classifiers Linear separability Perceptron Support Vector Machine (SVM) classifier Wide margin Cost function
More informationA Novel Binary Particle Swarm Optimization
Proceedings of the 5th Mediterranean Conference on T33 A Novel Binary Particle Swarm Optimization Motaba Ahmadieh Khanesar, Member, IEEE, Mohammad Teshnehlab and Mahdi Aliyari Shoorehdeli K. N. Toosi
More informationHydro Cascade & Storage Optimisation utilising PLEXOS
Hydro Cascade & Storage Optimisation utilising PLEXOS 2 nd Annual Electricity Price Modelling and Forecasting Forum Tom Forrest Senior Power Market Consultant Energy Exemplar  Europe Contents Overview
More informationNumerical Research on Distributed Genetic Algorithm with Redundant
Numerical Research on Distributed Genetic Algorithm with Redundant Binary Number 1 Sayori Seto, 2 Akinori Kanasugi 1,2 Graduate School of Engineering, Tokyo Denki University, Japan 10kme41@ms.dendai.ac.jp,
More informationPerformance Optimization of I4 I 4 Gasoline Engine with Variable Valve Timing Using WAVE/iSIGHT
Performance Optimization of I4 I 4 Gasoline Engine with Variable Valve Timing Using WAVE/iSIGHT Sean Li, DaimlerChrysler (sl60@dcx dcx.com) Charles Yuan, Engineous Software, Inc (yuan@engineous.com) Background!
More informationOPTIMIZATION TECHNIQUES AND AN INTRODUCTION TO GENETIC ALGORITHMS AND SIMULATED ANNEALING Dr. T. Ghose Dept. of EEE BIT, Mesra
OPTIMIZATION TECHNIQUES AND AN INTRODUCTION TO GENETIC ALGORITHMS AND SIMULATED ANNEALING Dr. T. Ghose Dept. of EEE BIT, Mesra INTRODUCTION:: Almost any problem in the design, operation, and analysis of
More informationCHAPTER 7 STOCHASTIC ANALYSIS OF MANPOWER LEVELS AFFECTING BUSINESS 7.1 Introduction
CHAPTER 7 STOCHASTIC ANALYSIS OF MANPOWER LEVELS AFFECTING BUSINESS 7.1 Introduction Consider in this chapter a business organization under fluctuating conditions of availability of manpower and business
More informationHighway Maintenance Scheduling Using Genetic Algorithm with Microscopic Traffic Simulation
Wang, Cheu and Fwa 1 Word Count: 6955 Highway Maintenance Scheduling Using Genetic Algorithm with Microscopic Traffic Simulation Ying Wang Research Scholar Department of Civil Engineering National University
More informationHolland s GA Schema Theorem
Holland s GA Schema Theorem v Objective provide a formal model for the effectiveness of the GA search process. v In the following we will first approach the problem through the framework formalized by
More informationDesign of Demand Forecasting Expert System for Dynamic Supply Chains
Design of Demand Forecasting Expert System for Dynamic Supply Chains Hanaa E. Sayed, Hossam A. Gabbar and Shigeji Miyazaki Okayama University Japan 8 1. Introduction When distributors and wholesalers seek
More informationOptimization of Preventive Maintenance Scheduling in Processing Plants
18 th European Symposium on Computer Aided Process Engineering ESCAPE 18 Bertrand Braunschweig and Xavier Joulia (Editors) 2008 Elsevier B.V./Ltd. All rights reserved. Optimization of Preventive Maintenance
More informationModern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh
Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh Peter Richtárik Week 3 Randomized Coordinate Descent With Arbitrary Sampling January 27, 2016 1 / 30 The Problem
More informationOPTIMIZATION PROBLEM FORMULATION AND SOLUTION TECHNIQUES
V OPTIMIZATION PROBLEM FORMULATION AND SOLUTION TECHNIQUES 5.1 Introduction There are many cases in practical applications where the variables of optimization are not continuous. Some or all of the variables
More informationWireless Sensor Networks Coverage Optimization based on Improved AFSA Algorithm
, pp. 99108 http://dx.doi.org/10.1457/ijfgcn.015.8.1.11 Wireless Sensor Networks Coverage Optimization based on Improved AFSA Algorithm Wang DaWei and Wang Changliang Zhejiang Industry Polytechnic College
More informationCHAPTER 6 GENETIC ALGORITHM OPTIMIZED FUZZY CONTROLLED MOBILE ROBOT
77 CHAPTER 6 GENETIC ALGORITHM OPTIMIZED FUZZY CONTROLLED MOBILE ROBOT 6.1 INTRODUCTION The idea of evolutionary computing was introduced by (Ingo Rechenberg 1971) in his work Evolutionary strategies.
More informationMethodology for Merit Order Dispatch. Version 1.0
Methodology for Merit Order Dispatch Version 1.0 25 th April 2011 TABLE OF CONTENTS 1. OBJECTIVES... 1 2. ROADMAP FOR IMPLEMENTATION... 1 3. DEFINITIONS... 3 4. OPERATIONS PLANNING... 3 4.1. General Considerations...
More informationTowards Online Recognition of Handwritten Mathematics
Towards Online Recognition of Handwritten Mathematics Vadim Mazalov, joint work with Oleg Golubitsky and Stephen M. Watt Ontario Research Centre for Computer Algebra Department of Computer Science Western
More informationSoftware Project Management with GAs
Software Project Management with GAs Enrique Alba, J. Francisco Chicano University of Málaga, Grupo GISUM, Departamento de Lenguajes y Ciencias de la Computación, E.T.S Ingeniería Informática, Campus de
More informationA Fast and Elitist Multiobjective Genetic Algorithm: NSGAII
182 IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 6, NO. 2, APRIL 2002 A Fast and Elitist Multiobjective Genetic Algorithm: NSGAII Kalyanmoy Deb, Associate Member, IEEE, Amrit Pratap, Sameer Agarwal,
More informationEvolutionary SAT Solver (ESS)
Ninth LACCEI Latin American and Caribbean Conference (LACCEI 2011), Engineering for a Smart Planet, Innovation, Information Technology and Computational Tools for Sustainable Development, August 35, 2011,
More informationSoftComputing Models for Building Applications  A Feasibility Study (EPSRC Ref: GR/L84513)
SoftComputing Models for Building Applications  A Feasibility Study (EPSRC Ref: GR/L84513) G S Virk, D Azzi, K I Alkadhimi and B P Haynes Department of Electrical and Electronic Engineering, University
More informationA NonLinear Schema Theorem for Genetic Algorithms
A NonLinear Schema Theorem for Genetic Algorithms William A Greene Computer Science Department University of New Orleans New Orleans, LA 70148 bill@csunoedu 5042806755 Abstract We generalize Holland
More informationInteger Programming: Algorithms  3
Week 9 Integer Programming: Algorithms  3 OPR 992 Applied Mathematical Programming OPR 992  Applied Mathematical Programming  p. 1/12 DantzigWolfe Reformulation Example Strength of the Linear Programming
More informationCHAPTER 5 PREDICTIVE MODELING STUDIES TO DETERMINE THE CONVEYING VELOCITY OF PARTS ON VIBRATORY FEEDER
93 CHAPTER 5 PREDICTIVE MODELING STUDIES TO DETERMINE THE CONVEYING VELOCITY OF PARTS ON VIBRATORY FEEDER 5.1 INTRODUCTION The development of an active trap based feeder for handling brakeliners was discussed
More informationAPPLICATION OF MODIFIED (PSO) AND SIMULATED ANNEALING ALGORITHM (SAA) IN ECONOMIC LOAD DISPATCH PROBLEM OF THERMAL GENERATING UNIT
International Journal of Electrical Engineering & Technology (IJEET) Volume 7, Issue 2, MarchApril, 2016, pp.69 78, Article ID: IJEET_07_02_008 Available online at http:// http://www.iaeme.com/ijeet/issues.asp?jtype=ijeet&vtype=7&itype=2
More informationScheduling Jobs and Preventive Maintenance Activities on Parallel Machines
Scheduling Jobs and Preventive Maintenance Activities on Parallel Machines Maher Rebai University of Technology of Troyes Department of Industrial Systems 12 rue Marie Curie, 10000 Troyes France maher.rebai@utt.fr
More informationArithmetic Coding: Introduction
Data Compression Arithmetic coding Arithmetic Coding: Introduction Allows using fractional parts of bits!! Used in PPM, JPEG/MPEG (as option), Bzip More time costly than Huffman, but integer implementation
More informationJun Gang, 1 Jiuping Xu, 1,2 and Yinfeng Xu 1. 1. Introduction
Journal of Applied Mathematics Volume 2013, Article ID 818731, 19 pages http://dx.doi.org/10.1155/2013/818731 Research Article Multiproject Resources Allocation Model under Fuzzy Random Environment and
More informationA Method of Cloud Resource Load Balancing Scheduling Based on Improved Adaptive Genetic Algorithm
Journal of Information & Computational Science 9: 16 (2012) 4801 4809 Available at http://www.joics.com A Method of Cloud Resource Load Balancing Scheduling Based on Improved Adaptive Genetic Algorithm
More informationApproximation Algorithms
Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NPCompleteness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms
More informationThe QOOL Algorithm for fast Online Optimization of Multiple Degree of Freedom Robot Locomotion
The QOOL Algorithm for fast Online Optimization of Multiple Degree of Freedom Robot Locomotion Daniel Marbach January 31th, 2005 Swiss Federal Institute of Technology at Lausanne Daniel.Marbach@epfl.ch
More informationComputing the Electricity Market Equilibrium: Uses of market equilibrium models
Computing the Electricity Market Equilibrium: Uses of market equilibrium models Ross Baldick Department of Electrical and Computer Engineering The University of Texas at Austin April 2007 Abstract We discuss
More informationChapter 2: Binomial Methods and the BlackScholes Formula
Chapter 2: Binomial Methods and the BlackScholes Formula 2.1 Binomial Trees We consider a financial market consisting of a bond B t = B(t), a stock S t = S(t), and a calloption C t = C(t), where the
More informationManagement of Software Projects with GAs
MIC05: The Sixth Metaheuristics International Conference 11521 Management of Software Projects with GAs Enrique Alba J. Francisco Chicano Departamento de Lenguajes y Ciencias de la Computación, Universidad
More informationModified Version of Roulette Selection for Evolution Algorithms  the Fan Selection
Modified Version of Roulette Selection for Evolution Algorithms  the Fan Selection Adam S lowik, Micha l Bia lko Department of Electronic, Technical University of Koszalin, ul. Śniadeckich 2, 75453 Koszalin,
More informationSmart Graphics: Methoden 3 Suche, Constraints
Smart Graphics: Methoden 3 Suche, Constraints Vorlesung Smart Graphics LMU München Medieninformatik Butz/Boring Smart Graphics SS2007 Methoden: Suche 2 Folie 1 Themen heute Suchverfahren Hillclimbing Simulated
More informationl 8 r 3 l 9 r 1 l 3 l 7 l 1 l 6 l 5 l 10 l 2 l 4 r 2
Heuristic Algorithms for the Terminal Assignment Problem Sami Khuri Teresa Chiu Department of Mathematics and Computer Science San Jose State University One Washington Square San Jose, CA 951920103 khuri@jupiter.sjsu.edu
More informationTutorial: Operations Research in Constraint Programming
Tutorial: Operations Research in Constraint Programming John Hooker Carnegie Mellon University May 2009 Revised June 2009 May 2009 Slide 1 Motivation Benders decomposition allows us to apply CP and OR
More informationA Parallel Processor for Distributed Genetic Algorithm with Redundant Binary Number
A Parallel Processor for Distributed Genetic Algorithm with Redundant Binary Number 1 Tomohiro KAMIMURA, 2 Akinori KANASUGI 1 Department of Electronics, Tokyo Denki University, 07ee055@ms.dendai.ac.jp
More informationCOMPARISON OF GENETIC OPERATORS ON A GENERAL GENETIC ALGORITHM PACKAGE HUAWEN XU. Master of Science. Shanghai Jiao Tong University.
COMPARISON OF GENETIC OPERATORS ON A GENERAL GENETIC ALGORITHM PACKAGE By HUAWEN XU Master of Science Shanghai Jiao Tong University Shanghai, China 1999 Submitted to the Faculty of the Graduate College
More informationSection 4: Scheduling Philosophy & Tools
Welcome to the Scheduling Philosophy & Tools section of the PJM Manual for Scheduling Operations. In this section you will find the following information: A description of the PJM OI s scheduling philosophy
More informationVolume 3, Issue 2, February 2015 International Journal of Advance Research in Computer Science and Management Studies
Volume 3, Issue 2, February 2015 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online at: www.ijarcsms.com
More informationTowards Heuristic Web Services Composition Using Immune Algorithm
Towards Heuristic Web Services Composition Using Immune Algorithm Jiuyun Xu School of Computer & Communication Engineering China University of Petroleum xujiuyun@ieee.org Stephan ReiffMarganiec Department
More informationMultiple Yard Cranes Scheduling Model and Algorithm in the Mixture Storage Block
JOURNAL OF SOFTWARE, VOL. 8, NO. 10, OCTOBER 2013 2495 Multiple ard Cranes Scheduling Model and Algorithm in the Mixture Storage Block Hongxing Zheng 1, Kai u 1, Chuang Tu 1 1 Transportation Management
More informationTwoStage Stochastic Linear Programs
TwoStage Stochastic Linear Programs Operations Research Anthony Papavasiliou 1 / 27 TwoStage Stochastic Linear Programs 1 Short Reviews Probability Spaces and Random Variables Convex Analysis 2 Deterministic
More informationCHAPTER 3 WATER DISTRIBUTION SYSTEM MAINTENANCE OPTIMIZATION PROBLEM
41 CHAPTER 3 WATER DISTRIBUTION SYSTEM MAINTENANCE OPTIMIZATION PROBLEM 3.1 INTRODUCTION Water distribution systems are complex interconnected networks that require extensive planning and maintenance to
More informationA Genetic Algorithm Processor Based on Redundant Binary Numbers (GAPBRBN)
ISSN: 2278 1323 All Rights Reserved 2014 IJARCET 3910 A Genetic Algorithm Processor Based on Redundant Binary Numbers (GAPBRBN) Miss: KIRTI JOSHI Abstract A Genetic Algorithm (GA) is an intelligent search
More informationTests for Two Survival Curves Using Cox s Proportional Hazards Model
Chapter 730 Tests for Two Survival Curves Using Cox s Proportional Hazards Model Introduction A clinical trial is often employed to test the equality of survival distributions of two treatment groups.
More informationGA as a Data Optimization Tool for Predictive Analytics
GA as a Data Optimization Tool for Predictive Analytics Chandra.J 1, Dr.Nachamai.M 2,Dr.Anitha.S.Pillai 3 1Assistant Professor, Department of computer Science, Christ University, Bangalore,India, chandra.j@christunivesity.in
More informationEstimation of the COCOMO Model Parameters Using Genetic Algorithms for NASA Software Projects
Journal of Computer Science 2 (2): 118123, 2006 ISSN 15493636 2006 Science Publications Estimation of the COCOMO Model Parameters Using Genetic Algorithms for NASA Software Projects Alaa F. Sheta Computers
More informationResearch Article Service Composition Optimization Using Differential Evolution and Oppositionbased Learning
Research Journal of Applied Sciences, Engineering and Technology 11(2): 229234, 2015 ISSN: 20407459; eissn: 20407467 2015 Maxwell Scientific Publication Corp. Submitted: May 20, 2015 Accepted: June
More information5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1
5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 General Integer Linear Program: (ILP) min c T x Ax b x 0 integer Assumption: A, b integer The integrality condition
More informationFunctional Optimization Models for Active Queue Management
Functional Optimization Models for Active Queue Management Yixin Chen Department of Computer Science and Engineering Washington University in St Louis 1 Brookings Drive St Louis, MO 63130, USA chen@cse.wustl.edu
More informationA Study of Crossover Operators for Genetic Algorithm and Proposal of a New Crossover Operator to Solve Open Shop Scheduling Problem
American Journal of Industrial and Business Management, 2016, 6, 774789 Published Online June 2016 in SciRes. http://www.scirp.org/journal/ajibm http://dx.doi.org/10.4236/ajibm.2016.66071 A Study of Crossover
More informationA New Method for Estimating Maximum Power Transfer and Voltage Stability Margins to Mitigate the Risk of Voltage Collapse
A New Method for Estimating Maximum Power Transfer and Voltage Stability Margins to Mitigate the Risk of Voltage Collapse Bernie Lesieutre Dan Molzahn University of WisconsinMadison PSERC Webinar, October
More informationA linear algebraic method for pricing temporary life annuities
A linear algebraic method for pricing temporary life annuities P. Date (joint work with R. Mamon, L. Jalen and I.C. Wang) Department of Mathematical Sciences, Brunel University, London Outline Introduction
More informationN11 Contingency Analysis using PowerWorld Simulator
N11 Contingency nalysis using PowerWorld Simulator uthor: PowerWorld Corporation Scott R. Dahman, P.E. Date: March 24, 2010 October 25, 2012 (revised) Table of Contents Background and Objective... 2
More informationLinear Threshold Units
Linear Threshold Units w x hx (... w n x n w We assume that each feature x j and each weight w j is a real number (we will relax this later) We will study three different algorithms for learning linear
More informationOPTIMAL RESERVOIR OPERATION FOR IRRIGATION OF CROPS USING GENETIC ALGORITHM: A CASE STUDY OF SUKHI RESERVOIR PROJECT
INTERNATIONAL JOURNAL OF CIVIL ENGINEERING AND TECHNOLOGY (IJCIET) International Journal of Civil Engineering and Technology (IJCIET), ISSN 0976 6308 (Print), ISSN 0976 6308 (Print) ISSN 0976 6316(Online)
More informationA Reactive Tabu Search for Service Restoration in Electric Power Distribution Systems
IEEE International Conference on Evolutionary Computation May 411 1998, Anchorage, Alaska A Reactive Tabu Search for Service Restoration in Electric Power Distribution Systems Sakae Toune, Hiroyuki Fudo,
More informationEE 402 RECITATION #13 REPORT
MIDDLE EAST TECHNICAL UNIVERSITY EE 402 RECITATION #13 REPORT LEADLAG COMPENSATOR DESIGN F. Kağan İPEK Utku KIRAN Ç. Berkan Şahin 5/16/2013 Contents INTRODUCTION... 3 MODELLING... 3 OBTAINING PTF of OPEN
More informationTHREE DIMENSIONAL REPRESENTATION OF AMINO ACID CHARAC TERISTICS
THREE DIMENSIONAL REPRESENTATION OF AMINO ACID CHARAC TERISTICS O.U. Sezerman 1, R. Islamaj 2, E. Alpaydin 2 1 Laborotory of Computational Biology, Sabancı University, Istanbul, Turkey. 2 Computer Engineering
More informationIN restructured power systems, securityconstrained unit
2144 IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 22, NO. 4, NOVEMBER 2007 Fast SCUC for LargeScale Power Systems Yong Fu, Member, IEEE, and Mohammad Shahidehpour, Fellow, IEEE Abstract In restructured power
More informationSingle item inventory control under periodic review and a minimum order quantity
Single item inventory control under periodic review and a minimum order quantity G. P. Kiesmüller, A.G. de Kok, S. Dabia Faculty of Technology Management, Technische Universiteit Eindhoven, P.O. Box 513,
More informationA New Interpretation of Information Rate
A New Interpretation of Information Rate reproduced with permission of AT&T By J. L. Kelly, jr. (Manuscript received March 2, 956) If the input symbols to a communication channel represent the outcomes
More informationLogistic Regression. Jia Li. Department of Statistics The Pennsylvania State University. Logistic Regression
Logistic Regression Department of Statistics The Pennsylvania State University Email: jiali@stat.psu.edu Logistic Regression Preserve linear classification boundaries. By the Bayes rule: Ĝ(x) = arg max
More informationTHE INTEGRATED SAFETY/SECURITY SYSTEM OF ACCADEMIA NAZIONALE DEI LINCEI AT CORSINI PALACE IN ROME Fabio Garzia
THE INTEGRATED SAFETY/SECURITY SYSTEM OF ACCADEMIA NAZIONALE DEI LINCEI AT CORSINI PALACE IN ROME Fabio Garzia Department of Electrical Engineering University of Rome La Sapienza Via Eudossiana, 18 00184
More informationA HYBRID GENETIC ALGORITHM FOR THE MAXIMUM LIKELIHOOD ESTIMATION OF MODELS WITH MULTIPLE EQUILIBRIA: A FIRST REPORT
New Mathematics and Natural Computation Vol. 1, No. 2 (2005) 295 303 c World Scientific Publishing Company A HYBRID GENETIC ALGORITHM FOR THE MAXIMUM LIKELIHOOD ESTIMATION OF MODELS WITH MULTIPLE EQUILIBRIA:
More informationXORbased artificial bee colony algorithm for binary optimization
Turkish Journal of Electrical Engineering & Computer Sciences http:// journals. tubitak. gov. tr/ elektrik/ Research Article Turk J Elec Eng & Comp Sci (2013) 21: 2307 2328 c TÜBİTAK doi:10.3906/elk1203104
More information