Genetic Algorithm To Generate The Automatic Time-Table - An Over View
Genetic Algorithm To Generate The Automatic Time-Table - An Over View
Genetic Algorithm To Generate The Automatic Time-Table - An Over View
Abstract--In this paper we glance through the various approaches used by the researchers to develop an automatic timetable using Genetic
algorithms. The optimized genetic algorithm can be used with the heuristic approach to design and develop the timetable of an institute. At stake
during the process of development, the stakeholders are the professors and the students. The efficient utilization of the infrastructure is the main
aim of the authors. The crossover, mutation and the fitness function is to be calculated for the implementation. In genetic algorithm every
individual are characterized by a fitness function. After analysis if there is higher fitness then it means better solution and then after based on
their fitness, parents are selected to reproduce offspring for a new generation where fitter individuals have more chance to reproduce. The
objective of the work is to create a model used to generate the acceptable schedule using probabilistic operators.
Keywords—Rule-Based agents, Genetic Algorithm, fitness function, Timetable Generator, Heuristic approach.
__________________________________________________*****_________________________________________________
3480
IJRITCC | November 2014, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 2 Issue: 11 3480 – 3483
_______________________________________________________________________________________________
They attempt to mimic nature by evolving solutions to
problems rather than designing them. Genetic algorithms 3) Crossover:It combines the genetic material from parents
work by analogy with Natural Selection as follows. First, a order to produce children, during breeding. Since only the
population pool of chromosomes is maintained. The good solutions are picked for breeding, during the
chromosomes are strings of symbols or numbers. There is selection procedure, the crossover operator mixes the
good precedence for this since humans are defined in DNA genetic material, in order to produce children with even
using a four-symbol alphabet. The chromosomes are also greater fitness.
called the genotype (the coding of the solution), as opposed
to the phenotype (the solution itself). In the Genetic
algorithm, a pool of chromosomes is maintained, which are
strings. These chromosomes must be evaluated for fitness.
Poor solutions are purged and small changes are made
to existing solutions and then allow "natural selection" to
take its course, evolving the gene pool so that steadily
better solutions are discovered.
3481
IJRITCC | November 2014, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 2 Issue: 11 3480 – 3483
_______________________________________________________________________________________________
and maintenance times when compared to a deterministic For Further work there is need to explore different types of
ruleset with many conditions and checks. [5] genetic algorithms, like heuristic approach to develop the
application. for example ones with overlapping
populations such as steady state or incremental GAs. In
such cases, a small replacement percentage, so that the GA
could be used for driving the nodes at real time (once
an initial good state has been reached) and not just
training them For plan to investigate other methods for
finding the optimum rule set (for example, neural
networks or other heuristic search methods like simulated
annealing) and to formally compare the results with
theoretical results obtained by a statistical analysis of
the network. [11]
REFERENCES
Figure 4: Generation of conflicts and bounds [1] [1]. Solving Timetable Scheduling Problem by Using Genetic
Algorithms Branimir Sigl, Marin Golub, Vedran Mornar
IV. CONCLUSION Faculty of Electrical Engineering and Computing,
University of Zagreb Unska 3, 10000 Zagreb, Croatia
The GA in timetabling framework has been shown to [2]. J. J. Grefenstette, editor. Proceedings of the First
be successful on several real problems .It has been International Conference on Genetic Algorithms and
shown that the genetic algorithm perform better in finding their Applications.Practice and Theory of Automated
areas of interest even in a complex, real-world scene. [13] Timetabling VI Proceedings of The 6thInternational
Conference on the Practice and Theory of Automa.
This paper described how set of active rules can beused to
[3]. J. J. Grefenstette, editor. Proceedings of the Second
express the knowledge of intelligent and how a genetic
International Conference on Genetic Algorithms and
algorithm can be used to dynamically prioritize rules in the their Applications. Practice and Theory of Automated
face of dynamically evolving environments. One could Timetabling VI Proceedings of The 6thInternational
argue that the genetic algorithm can finda local optimum Conference on the Practice and Theory of Auto.
and then stop. This is always a danger with a genetic [4]. N. R. Jennings.Coordination Techniques for
algorithm, but again it depends on the search space. In this Distributed Artificial Intelligence. University of
time table generation approach, there are many good London Mile End Rd.London E1 4NS UK, 1995.
solutions and the genetic algorithm will find one of them. [5]. Om Prakash Shukla, Amit Bahekar, Jaya
Vijayvergiya, ”Effective Fault Diagnosis and
In extreme cases where there is only one good solution the
Maintenance Optimization by Genetic Algorithm”
genetic algorithm may fail, but again it can be restarted by Available :
the Active Rules with many chances to find a better http://researchjournals.in/documents/published/2204.pdf
solution. [8] One could also argue that this architecture is [6]. Leon Bambrick Supervisor Dr B Lovell “Lecture
not powerful enough since it does not work based on Timetabling Using Genetic Algorithms” Available :
an event/action language. However there is nothing to http://secretgeek.net/content/bambrilg.pdf
prevent this architecture from being a subset of a rich [7]. Alberto Colorni, Marco Dorigo “A Genetic Algorithm
and powerful event/action language. In such a case it can be to solve the time table problem” Available :
used to pick the rule to be fired when there are no http://citeseerx.ist.psu.edu
[8]. Sanjay R. Sutar , Rajan S. Bichkar “University
other criteria available for rule selection. In other cases it
Timetabling based on Hard Constraints using Genetic
may be better to let the genetic algorithm pick the rule to be
Algorithm” Available :
fired, instead of having many conditions which will http://research.ijcaonline.org/volume42/number15/pxc38
complicate the active rule set and consequently increase 77964.pdf
design, test and maintenance times. The benefits of this [9]. Eng. Ahmed Hamdi Abu ABSA, Dr. Sana'a Wafa
approach are simplified design and reduced development Al-Sayegh, ” Elearning Timetable Generator Using
and maintenance times of rule-based agents in the face of Genetic Algorithms” Available :
dynamically evolving environments. [11] https://uqu.edu.sa/files2/tiny_mce/plugins
/filemanager/files/30/papers/f18 9.pdf
[10]. Leon Bambrick, “Lecture Timetabling Using Genetic
Algorithms” Available :
http://secretgeek.net/content/bambrilg.pdf
V. FUTURE SCOPE
3482
IJRITCC | November 2014, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 2 Issue: 11 3480 – 3483
_______________________________________________________________________________________________
[11]. Evaggelos Nonas, Alexandra Poulovassilis,
”optimisation of active rule agents using a genetic
algorithm approach pdf”Available :
http://ebookbrowse.com/optimisation-of-active-rule-
agentsusing-a-genetic-algorithm-approach-pdf-
d381872402
[12]. Cite Seerx , Optimisation of Active Rule Agents
using a Genetic Algorithm approach, Available:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1
.56.2599
[13]. Wikipedia, Selection (genetic algorithm), Available:
http://en.wikipedia.org/wiki/Genetic_algorithm
[14]. Genetic Algorithms, Conclusion and Future
WorkAvailable:
http://www.doc.ic.ac.uk/~nd/surprise_96/journal/vol4/tc
w2/report.html
[15]. Wikipedia,Mutation (genetic algorithm) Available:
http://en.wikipedia.org
/wiki/Mutation_%28genetic_algorithm%29
3483
IJRITCC | November 2014, Available @ http://www.ijritcc.org
_______________________________________________________________________________________