Determination of point of maximum likelihood in failure domain using genetic algorithms

2006 ◽  
Vol 83 (4) ◽  
pp. 276-282 ◽  
Author(s):  
A.S. Obadage ◽  
N. Harnpornchai

This paper aims produce an academic scheduling system using Genetic Algorithm (GA) to solve the academic schedule. Factors to consider in academic scheduling are the lecture to be held, the available room, the lecturers and the time of the lecturer, the suitability of the credits with the time of the lecture, and perhaps also the time of Friday prayers, and so forth. Genetic Algorithms can provide the best solution for some solutions in dealing with scheduling problems. Based on the test results, the resulting system can automate the scheduling of lectures properly. Determination of parameter values in Genetic Algorithm also gives effect in producing the solution of lecture schedule


2014 ◽  
pp. 16-21
Author(s):  
S. Vazquez-Rodriguez ◽  
R. J. Duro

In this paper we have addressed the problem of observability of power systems from the point of view of topological observability and using genetic algorithms for its determination. The objective is to find a way to determine if a system is observable by establishing if a spanning tree of the system that verifies certain properties with regards to the use of available measurements can be obtained. To this end we have developed a genotype-phenotype transformation scheme for genetic algorithms that permits using very simple genetic operators over integer based chromosomes which after a building process can become very complex trees. The procedure was successfully applied to standard benchmark systems and we present some results for one of them.


Sign in / Sign up

Export Citation Format

Share Document