A Fast Computational Genetic Algorithm for Economic Load Dispatch
|
|
- Robyn Maxwell
- 8 years ago
- Views:
Transcription
1 A Fast Computational Genetic Algorithm for Economic Load Dispatch M.Sailaja Kumari 1, M.Sydulu Sailaja_matam@Yahoo.com 1, 2 Department of Electrical Engineering National Institute of Technology, Warangal Andhra Pradesh, India, 2 sydulumaheswarapu@yahoo.co.in Abstract This paper presents a Fast Genetic Algorithm (FGA) approach for solving Economic Load Dispatch (ELD) problem. GAs perform powerful global searches, but their long computation times limit them when solving large scale optimization problems. The present paper describes a method to overcome this limitation by starting with random solutions within the search space and narrowing down the search space by considering the minimum and maximum errors of the population members. Since the search space is restricted to a small region within the available search space, the algorithm works very fast. This feature of the algorithm is attractive when applied to ELD of large systems. The convergence of the algorithm can be expected with in one or two generations independent of size of the system. The results have been demonstrated for ELD of standard 3 generator, 6 generator, 20 generator and 38 generator systems with and without consideration of transmission system losses. In all the cases the Fast GA shows reliable convergence. The final results obtained using Fast GA are compared with conventional GA and found to be encouraging. Index Terms Economic dispatch, Genetic algorithms, Incremental fuel cost of generators, Optimal dispatch. G I. INTRODUCTION ENETIC Algorithms (GAs) are optimization algorithms based on the mechanics of natural selection and natural genetics. GAs have been developed by John Holland in 1960s. Some fundamental ideas have been borrowed from genetics and are artificially used to construct more robust algorithms requiring minimal problem information [1]. Unlike classical search and optimization methods GA starts its search with a random set of solutions, instead of single solution. The Holland s GA that uses simple genetic operators is known as Simple Genetic Algorithm (SGA). SGA starts with a random population of solutions (chromosomes in GA terminology). Each population member is then evaluated for the given objective function and is assigned fitness. The algorithm then checks for the stopping condition. The condition can be either all population members assume equal 349 fitness values or when a maximum number of generations are reached. If the condition is not satisfied, the population members are arranged in descending order of their fitness value and genetic operators are applied to produce new and better fit population from old population while applying genetic operators like recombination, elitism, crossover and mutation. This completes one iteration and in GA terminology one generation. The generation count is updated and the process is repeated. SGA is capable of locating the near-optimal solutions, but requires a large number of generations to converge. In addition to SGA, there exists a number of advanced GAs, designed to have advanced features. Suitable combination of GA operators also are used [2] to enhance the performance of SGA. Economic Load Dispatch (ELD) is one of the important optimization problems in modern Energy Management Systems (EMS). ELD determines the optimal real power settings of generating units in order to minimize total fuel cost of thermal plants. Various mathematical programming methods and optimization techniques have previously been applied for solution of ELD. These include Lambda iteration method, participation factors method and gradient methods. ELD problems in practice are usually hard for traditional mathematical programming methodologies because of the equality and inequality constraints. GAs have also been applied for solution of ELD. [3, 4] present ELD using GA. A unit based encoding scheme is used, which restricts the applicability of GA to large-scale systems. In unit based encoding the chromosome length increase with number of units in the system. [5] presented a lambda-based GA approach for solving ED problem. The solution time grows approximately linearly with problem size rather than geometrically. An Extended compact Genetic Algorithm (ECGA) and an adaptive discretization technique named split-on-demand (SOD) were proposed [6] to solve ELD problem. A repair operator is defined for making the
2 infeasible solutions to satisfy the equality constraint. [7] proposed a combined economic and emission dispatch by considering both the economy and emission objectives. A comparison of GA, Micro GA and Evolutionary Programming is brought out for different size of systems. [8] presents Economic power Dispatch using a hybrid technique, where GA parameters are controlled using Fuzzy logic technique. In the present paper a fast computation genetic algorithm is proposed based on lambda-based GA approach. The paper presents a methodology to overcome long computation times involved with simple Genetic Algorithms. The fast computation feature of the developed algorithm is advantageous and can be used in on line power system studies. II. ECONOMIC LOAD DISPATCH A. Problem Formulation The objective of Economic Load Dispatch (ELD) for power system consisting of thermal generating units is to find the optimal combination of power generations that minimizes the total generation cost while satisfying the specified equality and inequality constraints. The fuel cost function of the generator is represented as a quadratic function of generator active powers. The minimization function J can be obtained as sum of the fuel costs F i of all the generating units. Min J= Subjected to NG F (1) i i=1 power outputs must be equal to the total power demand by the load plus losses, must be satisfied. If transmission system losses are neglected, the equality constraint becomes, the sum of the power outputs must be equal to the total power demand by the load. Also, the power output of each unit must be greater than or equal to the minimum power permitted and less than or equal to the maximum power permitted on that unit. B. Transmission system Losses To achieve true ELD transmission system losses must be taken into account, as power generating units are spread over large areas. Using B-coefficients method, the network losses are expressed as a quadratic function of unit generations as NG NG loss Gi ij Gj i=1 j=1 P = P B P (5) In (5) B ij are called as B-coefficients or loss coefficients. III. Simple Genetic Algorithm (SGA) A. Representing a solution in GA To find the optimal decision variables, to optimize an objective function and to satisfy the constraints, the variables are represented in binary strings. Eqn.(6) gives a mapping function defined to [1] take care of variable bounds. In (6) li is the string length used to code i th variable, DV(s i ) is the min max decoded value of the string s i. X i and X i are lower and upper bounds of variable x i. x -x x=x + DV 2-1 max min min i i i i li (s i ) (6) NG P =P +P i=1 Gi D loss P P P (3) Gimin Gi Gimax In (1) fuel cost of generating unit is given by 2 F = a + bp + cp i i i i Gi Gi Where a i, b i, c i are cost coefficients of unit i, P Gi is real power generation of unit i. This is a constrained optimization problem, that may be solved using [9] advanced calculus methods that involve Legrange function. The necessary condition for the existence of minimum cost operating condition for thermal power system is that the incremental cost rates of all the units be equal to some undetermined value Lambda (λ). Along with the necessary condition, the equality constraint, the sum of the (2) (4) 350 Variable bounds are taken care by the mapping function given by (6). After choosing a string representation, a random population of solutions is generated. Then fitness is assigned to each population member, which represents the goodness of each solution. The string is evaluated in the context of objective function and constraints. In the absence of constraints, the objective function is treated as fitness function. In case of a minimization problem, the solution with smaller fitness is better. Genetic Operators: The SGA uses reproduction operator, elitism operator, crossover operator and mutation operator. B. Reproduction operator The main goal of reproduction operator is to make duplicates of the best fit solutions in the population and eliminate least fit solutions, while keeping the population size constant. Some commonly used methods include tournament selection, proportionate selection or Roulette Wheel Selection
3 (RWS), and ranking selection. In tournament selection tournaments are played between two solutions and the better solution is chosen and placed in the mating pool. Two other solutions are selected again randomly and another slot in the mating pool is filled with a better solution. Each solution can take part in the tournament twice. The process is repeated until the mating pool is filled with new good quality solutions. In proportionate selection, solutions are assigned copies proportional to their fitness values. It can be thought of as a roulette-wheel mechanism, where the wheel is divided into N (population size) divisions, where the size of each is marked in proportion to the fitness of each population member. Thereafter the wheel is spun N times, each time selecting the solution indicated by the pointer. In RWS a string with a higher fitness has a higher probability of being copied into the mating pool. In RWS the number of copies a population member gets in the next population is equal to f i /f avg. This selection operator is slow compared to tournament selection, as it merely calculates the average fitness all population members. Fitness scaling techniques are used to enhance the performance of RWS operator. Ranking selection ranks the population members according to their fitness, from worst (rank1) to best (rank N), where N is the population size. Each member in the sorted list is assigned fitness equal to the rank of the solution in the list. Thereafter the proportional selection operator is applied with the ranked fitness values and N solutions are chosen from mating pool. C. Crossover operator The reproduction operator makes copies of the best fit solutions in the next generation, but it cannot create any diversity in the population members. It only makes more copies of best fit solutions at the cost of least fit solutions. Crossover and mutation operators create new solutions in the population. There exist a number of crossover operators in the literature, but in all the operators, two solutions are randomly selected from the mating pool. These are called parent chromosomes. Then a crossover site is randomly selected and a portion of the string is exchanged between the two parent chromosomes. These are called child chromosomes. The process is repeated until the population is filled with new chromosomes. This is the concept behind single point and multi point crossover operators. Another type of crossover known as uniform crossover creates a random mask and generates the child chromosomes from parents using the bit value in the mask. D. Elitism Operator In order not to loose the good solutions from the population elitism operator is used. This operator prevents all population members from undergoing crossover operation. If a crossover probability of P c is used, 100P c % of population undergoes crossover, whereas 100(1-Pc)% of population is copied to 351 next population without any modification. This operator preserves the best fit chromosomes in the current population, and prevents them from being modified during the crossover operation. E. Mutation Operator The crossover operator is mainly responsible for bringing diversity in the population; mutation operator is also used for bringing further diversity in the population. The bit wise mutation operator flips the selected bit from 1 to 0 and vice versa, with a mutation probability P m. SGA is very simple and straightforward. Reproduction operator selects good strings; crossover operator recombines them to form two better strings. The mutation operator alters the strings locally. If bad strings are created in crossover they are eliminated by the reproduction operator. GAs with these simple operators, constitute a potential search and optimization algorithms. IV. ELD using SGA and FGA For solution of ELD using SGA, incremental fuel cost of the generators i.e. lambda is encoded in the chromosome. The algorithm for implementing ELD without losses using Simple GA is as follows. 1. Read population size, chromosome length, unit data, Pdemand, Probability of Elitism, Crossover and mutation 2. Randomly generate population of chromosomes. 3. Decode the chromosomes using (6). 4. Lambda_act = Lambda_min + (Lambda_max - Lambda_min)* Decoded lambda 5. Use the Lambda_act and cost coefficients of the generators, and calculate real power output of the generators (Pgen). 6. Calculate the error of each chromosome as (Sum of Pgen) Pdemand. 7. Fitness(i) of each chromosome is calculated as 1/(1+error(i)/Pdemand). 8. Arrange the chromosomes in the descending order of their fitness. 9. Check if error(1) *Pdemand 10. If yes STOP and calculate Optimal fuel cost and Pgen of units 11. Check if Fitness(1)=Fitness(last chromosome) 12. If yes print All chromosomes have equal values, calculate Optimal fuel cost and Pgen of units and STOP. 13. Apply elitism, Reproduction (RWS), crossover and mutation and generate new population from old one. 14. Update generation count. 15. Check if Generation count > maximum generations?
4 16. If yes, print Problem not converged in maximum number of generations, STOP. 17. Repeat from step 3. For ELD using Fast GA incremental fuel cost of the generators i.e. Lambda is encoded in the chromosome. The algorithm for implementing ELD without losses using Fast GA is as follows. 1. Read population size, chromosome length, unit data, Pdemand, Probability of Elitism, Crossover and mutation 2. Randomly generate population of chromosomes. 3. Decode the chromosomes using eqn. (6). 4. Lambda_act = Lambda_min + (Lambda_max - Lambda_min) * Decoded lambda 5. Use the Lambda_act and cost coefficients of the generators, and calculate real power output of the generators (Pgen). 6. Calculate the error of each chromosome as (Sum of Pgen) Pdemand. 7. Identify Minimum positive error and corresponding chromosome no.(i1) 8. Identify Minimum negative error and corresponding chromosome no.(i2) 9. Set Lambda_max= Lambda_act(I1) 10. Set Lambda_min=Lambda_act(I2) 11. For all chromosomes calculate Lambda_act(chrom) = Lambda_min+(Lambda_max-Lambda_min)*Decoded lambda 12. Calculate Pgen from Lambda_act(chrom) 13. Error(chrom)=(Sum of Pgen)- Pdemand 14. Fitness(i) of each chromosome is calculated as 1/(1+Error(i)/Pdemand). 15. Arrange the chromosomes in the descending order of their fitness. 16. Check if error(1) *Pdemand 17. If yes STOP and calculate Optimal fuel cost and Pgen of units 18. Check if Fitness(1)=Fitness(last chromosome) 19. If yes print All chromosomes have equal values, calculate Optimal fuel cost and Pgen of units and STOP. 20. Apply elitism, Reproduction (RWS), crossover and mutation and generate new population from old one. 21. Update generation count. 22. Check if Generation count > maximum generations? 23. If yes, print Problem not converged in maximum number of generations, STOP. Repeat from step Upto step 6 both algorithms are same. In the fast GA, after the errors of all chromosomes are evaluated, the search space is restricted. This is done by identifying the chromosome which has minimum positive error, and setting the lambda_act of this chromosome to be Lambda_max. Then, identify the chromosome with minimum negative error, and set the lambda_act of this chromosome to be Lambda_min. This will largely reduce the search space from wide Lamdba_max, Lambda_min to small region. The remaining steps are just same as for simple GA. Since the search space is now a very narrow region between the maximum and minimum lambda values, the algorithm converges in two or three generations. For ELD considering transmission losses, in step 5 and 6 of the algorithms the losses are accounted for while calculating the real power output of generators and then error of each chromosome is evaluated as [(sum of Pgen)- Pdemand-Ploss]. The other steps remain same. The present paper uses loss coefficients for calculation of losses. V. RESULTS AND DISCUSSION The developed algorithm is tested on standard 3 generator, 6generator, 20 generator and 38generator systems. For every case the chromosome length, population size, Probability of crossover, Mutation and elitism considered with Simple GA and Fast GA are same. Roulette Wheel Parent selection technique, Uniform crossover and bit-wise mutation are used in all cases. Data for 38 generator system is presented in the appendix. Tables I to IV present the test system results without consideration of system losses. Tables V to VIII provide the test system results while taking system losses into consideration. Tables I presents the results of standard 3 generator system [9] for a power demand of 850MW without considering transmission losses. The results obtained are in agreement with the results shown in [9]. Further, for the same GA parameters FGA locates the optimal solution in just one iteration. The GA parameters considered for this case are Population size: 30, Chromosome length: 16 bits, max no of generations: 100, Elitism probability: 0.15, Crossover probability: 0.9, Mutation probability: TABLE I 3 GENERATOR SYSTEM WITHOUT LOSS Simple GA Fast GA Pdemand (MW) 850 Pg1 (MW) Pg2 (MW) Pg3 (MW) FC ($/hr) λ($/mwh)
5 2 1 Generations Time (Sec.) TABLE II 6GENERATOR SYSTEM WITHOUT LOSS Simple GA Fast GA Pdemand (MW) Pg1 (MW) Pg2 (MW) Pg3 (MW) Pg4 (MW) Pg5 (MW) Pg6 (MW) FC ($/hr) λ($/mwh) Generations Time (Sec.) Tables II presents the results of standard 6 generator system [10] for a power demand of 283.4MW. The GA parameters considered for this case are population size: 40, string length: 16, max no of generations: 100, elitism probability: 0.15, crossover probability: 0.95, mutation probability: Tables III presents the results of 20 generator system [11] for power demands of 1200, 2500 and 3600MW. The GA parameters for this test system (without losses) are population size: 40, string length: 16, max no of iterations: 100, elitism probability: 0.12, crossover probability: 0.98, mutation probability : In all the cases the FGA shows reliable convergence in just 1 iteration. TABLE III 20 GENERATOR SYSTEM WITHOUT LOSSES SGA FGA SGA FGA SGA FGA Pd Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg FC ($/hr) λ($/mwh ) generatio ns 7 1 Time Table IV presents results obtained for 38 generator system for power demands of 7500, 8600 MW without losses. The population size: 60, string length: 16, max no of generations: 100, elitism probability: 0.12, crossover probability: 0.92, mutation probability: For the two cases considered FGA provides better optimal solution in just one generation. TABLE IV 38 GENERATOR SYSTEM WITHOUT LOSSES Method Simple GA Fast GA Simple GA Fast GA Pdemand Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg FC($/hr) λ($/mwh) generations 12 Time (Sec)
6 Tables V presents the results of standard 3 generator system [9] for a power demand of 850MW while considering transmission losses. The GA parameters considered for this system are population size: 40, string length: 16, max no of generations:100, elitism probability: 0.15, crossover probability:0.95, mutation probability: The results obtained are in agreement with the results shown in [9]. TABLE V 3GENERATOR SYSTEM WITH LOSSES Simple GA Fast GA Pdemand (MW) 850 Pg1 (MW) Pg2 (MW) Pg3 (MW) FC ($/hr) λ($/mwh) Generations Loss Time (Sec.) respect to number of generations. From the figure it is obvious that, in case of FGA algorithm the error is considerably reduced in the first generation itself, so this leads to very fast convergence to optimal solution. TABLE VII 6GENERATOR SYSTEM WITH LOSSES Simple GA Fast GA Pdemand (MW) Pg1 (MW) Pg2 (MW) Pg3 (MW) Pg4 (MW) Pg5 (MW) Pg6 (MW) FC ($/hr) λ($/mwh) Generations Loss(MW) Time (Sec.) FGA SGA FGA SGA Error Error generations 5 Fig. 1. Variation of error of best fit chromosome with number of generations for 3 generator system with loss generations Further, for the same GA parameters FGA locates better optimal solution in just 2 generations compared to 10 generations with SGA. Fig.1 shows the variation of error of the best fit chromosome with number of generations. The figure clearly demonstrates the superiority of the developed FGA over SGA. Table VII presents the generator power outputs, optimal fuel cost and loss obtained for 6 generator system. The GA parameters considered are population size: 40, string length: 16, max no of generations: 100, Elitism probability: 0.15, crossover probability: 0.95, mutation probability: From the table it is clear that, for the same GA parameters the proposed FGA presents the optimal solution in just 2 generations compared to 8 generations with SGA. Fig. 2. shows the variation of error of the best fit chromosome with 354 Fig. 2. Variation of error of best fit chromosome with number of generations for 6generator system with loss Table VII provides the optimal generator outputs and optimal fuel cost with losses for 20 generator system [11]. The considered GA parameters are population size: 40, string length: 16, max no of generations: 100, elitism probability: 0.15, crossover probability: 0.95 (Pd=1200), crossover probability: 0.9 (Pd=2500), crossover probability: 0.92 (Pd=3600), mutation probability: From the table it is very clear that, for all the cases considered, FGA provides the optimal solution in minimum time. Further, for a power demand of 2500MW, SGA and
7 FGA provide a Fuel cost of ($/hr) and ($/hr) against ($/hr) as reported in [11] FGA SGA 10 TABLE VII 20 GENERATOR SYSTEM WITH LOSSES Gen in MW SGA FGA SGA FGA SGA FGA Pd 1200 MW 2500MW 3600MW Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg Pg FC ($/hr) λ($/mwh) generations Loss (MW) Time Error generations Fig. 4. Variation of error of best fit chromosome with number of generations for 20 generator system with loss, Pd=3600 VI. CONCLUSION The paper presented a Fast computation algorithm for Economic Load dispatch problem. For the same Genetic operators and parameters, the proposed algorithm shows better and faster convergence over simple GA. Large computational times involved with GAs can be overcome by assessing the variation of error with the solution at hand. A number of test cases have been studied and the algorithm showed reliable convergence. The developed algorithm can be used for real time ELD problems, as the solution accuracy is achieved in minimum time. The only limitation of the algorithm is, if the solution represents a single variable (lambda in this case), the error variation can be easily assessed with respect to this single variable. But if the chromosome represents a number of variables, the error variation with respect to all the variables cannot be predicted and it becomes difficult to restrict the search space to small regions FGA SGA Error generations Fig. 3. Variation of error of best fit chromosome with number of generations for 20 generator system with loss, Pd=1200 Fig. 3 and 4 display the variation of error of the best fit chromosome with number of generations for a power demand of 1200MW and 2500Mw respectively. Even here the FGA shows its superiority over SGA. 355
8 APPENDIX 38 GENERATOR SYSTEM DATA Gen.No. a b c Pmin Pmax REFERENCES [1] Kalyanmoy Deb, Multi-objective Optimization using Evolutionary algorithms, John Wiley and Sons, [2] Anastasios G.Bakirtzis, Pandel N.Biskas, Christoforos E.Zoumas, Vasilios Petridis, Optimal Power Flow by Enhanced Genetic Algorithm, IEEE Transactions on Power Systems, Vol.17, No.2, May 2002, pp [3] Sheble, G.B. and K. Brittig, Refined genetic algorithm-economic dispatch example, IEEE paper 94 WM PWRS, presented at the IEEE/PES 1994 winter meeting. [4] Walters, D.C. and G.B.Sheble, Genetic algorithm solution of Economic dispatch with valve point loading, IEEE Trans. on Power Systems, Vol. 8, No. 3, pp , August [5] Po-Hung Chen and Hong-Chan Chang, Large-Scale Economic Dispatch by Genetic Algorithm, IEEE Trans. On Power Systems, Vol. 10, No.4, November [6] Chao-Hong Chen and Ying-ping Chen, Real Coded ECGA for Economic Dispatch, GECCO 07, July 7-11, 2007, London, England, United Kingdom. [7] P.Venkatesh, R.Gnanadass and Narayana Prasad Padhy, Comparison and Application of Evolutionary Programming Techniques to combined Economic Emission Dispatch with Line flow Constraints, IEEE Transactions on Power Systems, Vol 18, No.2, May [8] A.Laoufi, A.Hazzab and M.Rahli, Economic Dispatch using Fuzzy- Genetic Algorithm, International Journal of Applied Engineering Research, ISSN Vol.1, No.3 (2006). [9] Allen J.Wood and Bruce F.Wollenberg, Power Generation Operation and control, A wiley-interscience Publication, John Wiley & Sons, INC, [10] Alsac,O. and Stott.B, Optimal Load Flow with Steady State Security, IEEE Transactions on Power Apparats and Systems, Vol.93, No.3, [11] Ching-Tzong Su and Chien-Tung Lin, New approach with a Hopfield Modeling Framework to Economic Dispatch, IEEE Transactions on Power Systems, Vol. 15, No. 2, May
International 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): 2279-0063 ISSN (Online): 2279-0071 International
More informationCHAPTER 3 SECURITY CONSTRAINED OPTIMAL SHORT-TERM HYDROTHERMAL SCHEDULING
60 CHAPTER 3 SECURITY CONSTRAINED OPTIMAL SHORT-TERM HYDROTHERMAL SCHEDULING 3.1 INTRODUCTION Optimal short-term hydrothermal scheduling of power systems aims at determining optimal hydro and thermal generations
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 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 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 informationModel-based Parameter Optimization of an Engine Control Unit using Genetic Algorithms
Symposium on Automotive/Avionics Avionics Systems Engineering (SAASE) 2009, UC San Diego Model-based Parameter Optimization of an Engine Control Unit using Genetic Algorithms Dipl.-Inform. Malte Lochau
More informationGenetic Algorithm Performance with Different Selection Strategies in Solving TSP
Proceedings of the World Congress on Engineering Vol II WCE, July 6-8,, London, U.K. Genetic Algorithm Performance with Different Selection Strategies in Solving TSP Noraini Mohd Razali, John Geraghty
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 informationNon-Uniform Mapping in Binary-Coded Genetic Algorithms
Non-Uniform Mapping in Binary-Coded 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 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 informationA hybrid Approach of Genetic Algorithm and Particle Swarm Technique to Software Test Case Generation
A hybrid Approach of Genetic Algorithm and Particle Swarm Technique to Software Test Case Generation Abhishek Singh Department of Information Technology Amity School of Engineering and Technology Amity
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: 47-57 ISSN: 0976-4828 Society of Education, India Website: www.soeagra.com/iaast/iaast.htm Original Article Efficient Genetic
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 informationNew Modifications of Selection Operator in Genetic Algorithms for the Traveling Salesman Problem
New Modifications of Selection Operator in Genetic Algorithms for the Traveling Salesman Problem Radovic, Marija; and Milutinovic, Veljko Abstract One of the algorithms used for solving Traveling Salesman
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 informationSimulating the Multiple Time-Period Arrival in Yield Management
Simulating the Multiple Time-Period Arrival in Yield Management P.K.Suri #1, Rakesh Kumar #2, Pardeep Kumar Mittal #3 #1 Dean(R&D), Chairman & Professor(CSE/IT/MCA), H.C.T.M., Kaithal(Haryana), India #2
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 informationHYBRID GENETIC ALGORITHMS FOR SCHEDULING ADVERTISEMENTS ON A WEB PAGE
HYBRID GENETIC ALGORITHMS FOR SCHEDULING ADVERTISEMENTS ON A WEB PAGE Subodha Kumar University of Washington subodha@u.washington.edu Varghese S. Jacob University of Texas at Dallas vjacob@utdallas.edu
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 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. Al-Amin Bhuiyan Department of Computer Science and Engineering, Jahangirnagar University,
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 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/2011-2012 ***************************************************************************
More informationGenetic Algorithms for Bridge Maintenance Scheduling. Master Thesis
Genetic Algorithms for Bridge Maintenance Scheduling Yan ZHANG Master Thesis 1st Examiner: Prof. Dr. Hans-Joachim Bungartz 2nd Examiner: Prof. Dr. rer.nat. Ernst Rank Assistant Advisor: DIPL.-ING. Katharina
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, 774-789 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 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, 69-75 Published Online February 2014 in MECS (http://www.mecs-press.org/) DOI: 10.5815/ijisa.2014.03.07 Application of GA for Optimal Location of Devices
More informationA Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II
182 IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 6, NO. 2, APRIL 2002 A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II Kalyanmoy Deb, Associate Member, IEEE, Amrit Pratap, Sameer Agarwal,
More informationISSN: 2319-5967 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 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 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 informationA Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem
A Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem Sayedmohammadreza Vaghefinezhad 1, Kuan Yew Wong 2 1 Department of Manufacturing & Industrial Engineering, Faculty of Mechanical
More informationThe Binary Genetic Algorithm
CHAPTER 2 The Binary Genetic Algorithm 2.1 GENETIC ALGORITHMS: NATURAL SELECTION ON A COMPUTER If the previous chapter whet your appetite for something better than the traditional optimization methods,
More informationMemory Allocation Technique for Segregated Free List Based on Genetic Algorithm
Journal of Al-Nahrain University Vol.15 (2), June, 2012, pp.161-168 Science Memory Allocation Technique for Segregated Free List Based on Genetic Algorithm Manal F. Younis Computer Department, College
More informationA Comparison of Genotype Representations to Acquire Stock Trading Strategy Using Genetic Algorithms
2009 International Conference on Adaptive and Intelligent Systems A Comparison of Genotype Representations to Acquire Stock Trading Strategy Using Genetic Algorithms Kazuhiro Matsui Dept. of Computer Science
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 informationGenetic Algorithm Based Interconnection Network Topology Optimization Analysis
Genetic Algorithm Based Interconnection Network Topology Optimization Analysis 1 WANG Peng, 2 Wang XueFei, 3 Wu YaMing 1,3 College of Information Engineering, Suihua University, Suihua Heilongjiang, 152061
More informationEstimation of the COCOMO Model Parameters Using Genetic Algorithms for NASA Software Projects
Journal of Computer Science 2 (2): 118-123, 2006 ISSN 1549-3636 2006 Science Publications Estimation of the COCOMO Model Parameters Using Genetic Algorithms for NASA Software Projects Alaa F. Sheta Computers
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 informationAsexual Versus Sexual Reproduction in Genetic Algorithms 1
Asexual Versus Sexual Reproduction in Genetic Algorithms Wendy Ann Deslauriers (wendyd@alumni.princeton.edu) Institute of Cognitive Science,Room 22, Dunton Tower Carleton University, 25 Colonel By Drive
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 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, 75-453 Koszalin,
More informationA Multi-Objective Performance Evaluation in Grid Task Scheduling using Evolutionary Algorithms
A Multi-Objective Performance Evaluation in Grid Task Scheduling using Evolutionary Algorithms MIGUEL CAMELO, YEZID DONOSO, HAROLD CASTRO Systems and Computer Engineering Department Universidad de los
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 Reiff-Marganiec Department
More informationSolving Banana (Rosenbrock) Function Based on Fitness Function
Available online at www.worldscientificnews.com WSN 6 (2015) 41-56 EISSN 2392-2192 Solving Banana (Rosenbrock) Function Based on Fitness Function Lubna Zaghlul Bashir 1,a, Rajaa Salih Mohammed Hasan 2,b
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 Al-Duwaish H. and Naeem, Wasif Electrical Engineering Department/King Fahd University of Petroleum and Minerals
More informationA Multi-objective Genetic Algorithm for Employee Scheduling
A Multi-objective Genetic Algorithm for Scheduling Russell Greenspan University of Illinois December, rgreensp@uiuc.edu ABSTRACT A Genetic Algorithm (GA) is applied to an employee scheduling optimization
More informationA Service Revenue-oriented Task Scheduling Model of Cloud Computing
Journal of Information & Computational Science 10:10 (2013) 3153 3161 July 1, 2013 Available at http://www.joics.com A Service Revenue-oriented Task Scheduling Model of Cloud Computing Jianguang Deng a,b,,
More informationKeywords: Beta distribution, Genetic algorithm, Normal distribution, Uniform distribution, Yield management.
Volume 3, Issue 9, September 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Simulating
More informationAPPLICATION OF ADVANCED SEARCH- METHODS FOR AUTOMOTIVE DATA-BUS SYSTEM SIGNAL INTEGRITY OPTIMIZATION
APPLICATION OF ADVANCED SEARCH- METHODS FOR AUTOMOTIVE DATA-BUS SYSTEM SIGNAL INTEGRITY OPTIMIZATION Harald Günther 1, Stephan Frei 1, Thomas Wenzel, Wolfgang Mickisch 1 Technische Universität Dortmund,
More informationA Reactive Tabu Search for Service Restoration in Electric Power Distribution Systems
IEEE International Conference on Evolutionary Computation May 4-11 1998, Anchorage, Alaska A Reactive Tabu Search for Service Restoration in Electric Power Distribution Systems Sakae Toune, Hiroyuki Fudo,
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 informationCLOUD DATABASE ROUTE SCHEDULING USING COMBANATION OF PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHM
CLOUD DATABASE ROUTE SCHEDULING USING COMBANATION OF PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHM *Shabnam Ghasemi 1 and Mohammad Kalantari 2 1 Deparment of Computer Engineering, Islamic Azad University,
More informationVol. 35, No. 3, Sept 30,2000 ملخص تعتبر الخوارزمات الجينية واحدة من أفضل طرق البحث من ناحية األداء. فبالرغم من أن استخدام هذه الطريقة ال يعطي الحل
AIN SHAMS UNIVERSITY FACULTY OF ENGINEERING Vol. 35, No. 3, Sept 30,2000 SCIENTIFIC BULLETIN Received on : 3/9/2000 Accepted on: 28/9/2000 pp : 337-348 GENETIC ALGORITHMS AND ITS USE WITH BACK- PROPAGATION
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 informationSelection Procedures for Module Discovery: Exploring Evolutionary Algorithms for Cognitive Science
Selection Procedures for Module Discovery: Exploring Evolutionary Algorithms for Cognitive Science Janet Wiles (j.wiles@csee.uq.edu.au) Ruth Schulz (ruth@csee.uq.edu.au) Scott Bolland (scottb@csee.uq.edu.au)
More informationGenetic Algorithm. Based on Darwinian Paradigm. Intrinsically a robust search and optimization mechanism. Conceptual Algorithm
24 Genetic Algorithm Based on Darwinian Paradigm Reproduction Competition Survive Selection Intrinsically a robust search and optimization mechanism Slide -47 - Conceptual Algorithm Slide -48 - 25 Genetic
More informationGenetic Algorithms and Sudoku
Genetic Algorithms and Sudoku Dr. John M. Weiss Department of Mathematics and Computer Science South Dakota School of Mines and Technology (SDSM&T) Rapid City, SD 57701-3995 john.weiss@sdsmt.edu MICS 2009
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, FIN-0015
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 informationProposal and Analysis of Stock Trading System Using Genetic Algorithm and Stock Back Test System
Proposal and Analysis of Stock Trading System Using Genetic Algorithm and Stock Back Test System Abstract: In recent years, many brokerage firms and hedge funds use a trading system based on financial
More information4. Zastosowania Optymalizacja wielokryterialna
4. Zastosowania Optymalizacja wielokryterialna Tadeusz Burczyński 1,2) 1), Department for Strength of Materials and Computational Mechanics, Konarskiego 18a, 44-100 Gliwice, Poland 2) Cracow University
More informationEffect of Using Neural Networks in GA-Based School Timetabling
Effect of Using Neural Networks in GA-Based School Timetabling JANIS ZUTERS Department of Computer Science University of Latvia Raina bulv. 19, Riga, LV-1050 LATVIA janis.zuters@lu.lv Abstract: - The school
More informationA Non-Linear Schema Theorem for Genetic Algorithms
A Non-Linear Schema Theorem for Genetic Algorithms William A Greene Computer Science Department University of New Orleans New Orleans, LA 70148 bill@csunoedu 504-280-6755 Abstract We generalize Holland
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 informationHYBRID GENETIC ALGORITHM PARAMETER EFFECTS FOR OPTIMIZATION OF CONSTRUCTION RESOURCE ALLOCATION PROBLEM. Jin-Lee KIM 1, M. ASCE
1560 HYBRID GENETIC ALGORITHM PARAMETER EFFECTS FOR OPTIMIZATION OF CONSTRUCTION RESOURCE ALLOCATION PROBLEM Jin-Lee KIM 1, M. ASCE 1 Assistant Professor, Department of Civil Engineering and Construction
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 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 informationAS part of the development process, software needs to
Dynamic White-Box Software Testing using a Recursive Hybrid Evolutionary Strategy/Genetic Algorithm Ashwin Panchapakesan, Graduate Student Member, Rami Abielmona, Senior Member, IEEE, and Emil Petriu,
More informationThe Influence of Binary Representations of Integers on the Performance of Selectorecombinative Genetic Algorithms
The Influence of Binary Representations of Integers on the Performance of Selectorecombinative Genetic Algorithms Franz Rothlauf Working Paper 1/2002 February 2002 Working Papers in Information Systems
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, March-April, 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 informationAN OPTIMAL STRATEGY FOR YARD TRUCKS MANAGEMENT IN HONG KONG CONTAINER TERMINALS
AN OPTIMAL STRATEGY FOR YARD TRUCKS MANAGEMENT IN HONG KONG CONTAINER TERMINALS Z. X. Wang Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Hong Kong E-mail: jeremy.wang@connect.polyu.hk
More informationA Brief Study of the Nurse Scheduling Problem (NSP)
A Brief Study of the Nurse Scheduling Problem (NSP) Lizzy Augustine, Morgan Faer, Andreas Kavountzis, Reema Patel Submitted Tuesday December 15, 2009 0. Introduction and Background Our interest in the
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 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 3-5, 2011,
More informationLearning in Abstract Memory Schemes for Dynamic Optimization
Fourth International Conference on Natural Computation Learning in Abstract Memory Schemes for Dynamic Optimization Hendrik Richter HTWK Leipzig, Fachbereich Elektrotechnik und Informationstechnik, Institut
More informationSpatial Interaction Model Optimisation on. Parallel Computers
To appear in "Concurrency: Practice and Experience", 1994. Spatial Interaction Model Optimisation on Parallel Computers Felicity George, Nicholas Radcliffe, Mark Smith Edinburgh Parallel Computing Centre,
More informationGoldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Reading, MA:
is another objective that the GA could optimize. The approach used here is also adaptable. On any particular project, the designer can congure the GA to focus on optimizing certain constraints (such as
More informationWireless Sensor Networks Coverage Optimization based on Improved AFSA Algorithm
, pp. 99-108 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 informationOptimal Tuning of PID Controller Using Meta Heuristic Approach
International Journal of Electronic and Electrical Engineering. ISSN 0974-2174, Volume 7, Number 2 (2014), pp. 171-176 International Research Publication House http://www.irphouse.com Optimal Tuning of
More informationWeb based Multi Product Inventory Optimization using Genetic Algorithm
Web based Multi Product Inventory Optimization using Genetic Algorithm Priya P Research Scholar, Dept of computer science, Bharathiar University, Coimbatore Dr.K.Iyakutti Senior Professor, Madurai Kamarajar
More informationInfluence of the Crossover Operator in the Performance of the Hybrid Taguchi GA
Influence of the Crossover Operator in the Performance of the Hybrid Taguchi GA Stjepan Picek Faculty of Electrical Engineering and Computing Unska 3, Zagreb, Croatia Email: stjepan@computer.org Marin
More informationFuzzy Genetic Heuristic for University Course Timetable Problem
Int. J. Advance. Soft Comput. Appl., Vol. 2, No. 1, March 2010 ISSN 2074-8523; Copyright ICSRS Publication, 2010 www.i-csrs.org Fuzzy Genetic Heuristic for University Course Timetable Problem Arindam Chaudhuri
More informationIndex Terms- Batch Scheduling, Evolutionary Algorithms, Multiobjective Optimization, NSGA-II.
Batch Scheduling By Evolutionary Algorithms for Multiobjective Optimization Charmi B. Desai, Narendra M. Patel L.D. College of Engineering, Ahmedabad Abstract - Multi-objective optimization problems are
More informationA Novel Constraint Handling Strategy for Expensive Optimization Problems
th World Congress on Structural and Multidisciplinary Optimization 7 th - 2 th, June 25, Sydney Australia A Novel Constraint Handling Strategy for Expensive Optimization Problems Kalyan Shankar Bhattacharjee,
More informationResearch Article Service Composition Optimization Using Differential Evolution and Opposition-based Learning
Research Journal of Applied Sciences, Engineering and Technology 11(2): 229-234, 2015 ISSN: 2040-7459; e-issn: 2040-7467 2015 Maxwell Scientific Publication Corp. Submitted: May 20, 2015 Accepted: June
More informationENHANCEMENT OF POWER SYSTEM SECURITY USING PSO-NR OPTIMIZATION TECHNIQUE
International Journal of Electrical Engineering & Technology (IJEET) olume 7, Issue 1, Jan-Feb, 2016, pp.35-44, Article ID: IJEET_07_01_004 Available online at http:// http://www.iaeme.com/ijeet/issues.asp?jtype=ijeet&type=7&itype=1
More informationInternational Journal of Emerging Technologies in Computational and Applied Sciences (IJETCAS) www.iasir.net
International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) International Journal of Emerging Technologies in Computational
More informationA Multiobjective Genetic Fuzzy System for Obtaining Compact and Accurate Fuzzy Classifiers with Transparent Fuzzy Partitions
A Multiobjective Genetic Fuzzy System for Obtaining Compact and Accurate Fuzzy Classifiers with Transparent Fuzzy Partitions Pietari Pulkkinen Tampere University of Technology Department of Automation
More informationOptimization of PID parameters with an improved simplex PSO
Li et al. Journal of Inequalities and Applications (2015) 2015:325 DOI 10.1186/s13660-015-0785-2 R E S E A R C H Open Access Optimization of PID parameters with an improved simplex PSO Ji-min Li 1, Yeong-Cheng
More informationA Review And Evaluations Of Shortest Path Algorithms
A Review And Evaluations Of Shortest Path Algorithms Kairanbay Magzhan, Hajar Mat Jani Abstract: Nowadays, in computer networks, the routing is based on the shortest path problem. This will help in minimizing
More informationA Hybrid Tabu Search Method for Assembly Line Balancing
Proceedings of the 7th WSEAS International Conference on Simulation, Modelling and Optimization, Beijing, China, September 15-17, 2007 443 A Hybrid Tabu Search Method for Assembly Line Balancing SUPAPORN
More informationA Genetic Algorithm-Evolved 3D Point Cloud Descriptor
A Genetic Algorithm-Evolved 3D Point Cloud Descriptor Dominik Wȩgrzyn and Luís A. Alexandre IT - Instituto de Telecomunicações Dept. of Computer Science, Univ. Beira Interior, 6200-001 Covilhã, Portugal
More informationUsing Adaptive Random Trees (ART) for optimal scorecard segmentation
A FAIR ISAAC WHITE PAPER Using Adaptive Random Trees (ART) for optimal scorecard segmentation By Chris Ralph Analytic Science Director April 2006 Summary Segmented systems of models are widely recognized
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 informationOptimisation of the Gas-Exchange System of Combustion Engines by Genetic Algorithm
Optimisation of the Gas-Exchange System of Combustion Engines by Genetic Algorithm C. D. Rose, S. R. Marsland, and D. Law School of Engineering and Advanced Technology Massey University Palmerston North,
More informationA GENETIC ALGORITHM FOR RESOURCE LEVELING OF CONSTRUCTION PROJECTS
A GENETIC ALGORITHM FOR RESOURCE LEVELING OF CONSTRUCTION PROJECTS Mahdi Abbasi Iranagh 1 and Rifat Sonmez 2 Dept. of Civil Engrg, Middle East Technical University, Ankara, 06800, Turkey Critical path
More informationWeb Service Selection using Particle Swarm Optimization and Genetic Algorithms
Web Service Selection using Particle Swarm Optimization and Genetic Algorithms Simone A. Ludwig Department of Computer Science North Dakota State University Fargo, ND, USA simone.ludwig@ndsu.edu Thomas
More informationMulti-Objective Optimization using Evolutionary Algorithms
Multi-Objective Optimization using Evolutionary Algorithms Kalyanmoy Deb Department of Mechanical Engineering, Indian Institute of Technology, Kanpur, India JOHN WILEY & SONS, LTD Chichester New York Weinheim
More informationSIMULATING CANCELLATIONS AND OVERBOOKING IN YIELD MANAGEMENT
CHAPTER 8 SIMULATING CANCELLATIONS AND OVERBOOKING IN YIELD MANAGEMENT In YM, one of the major problems in maximizing revenue is the number of cancellations. In industries implementing YM this is very
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 informationAn Efficient Approach for Task Scheduling Based on Multi-Objective Genetic Algorithm in Cloud Computing Environment
IJCSC VOLUME 5 NUMBER 2 JULY-SEPT 2014 PP. 110-115 ISSN-0973-7391 An Efficient Approach for Task Scheduling Based on Multi-Objective Genetic Algorithm in Cloud Computing Environment 1 Sourabh Budhiraja,
More information