Professional Documents
Culture Documents
As this is web based project, it is easier to fetch the data from the
database and remove the unwanted data by just clicking the delete
button. This project will limit the time and money factor involve in the
time table management system. The maintenance of this web based is
much easier and accurate than the existing manual system. As this web
based system, the security features are somehow higher than the manual
system. In this system, there is less chance of mishandling of the data
because only the administrator will login through their login id and
password and upload all the related data and generate the time table. So
there is no misuse of the data.
Many special features which we have not included now in our project
will likely to be added in the near future. In our project, there is only
administrator panel where the admin will upload all the data related to
the college, teachers, branches, subjects and labs. Now in the future
extension, we will assign the login id and password to all the teachers so
that they can be able to see their schedule and print the time table. In the
future, we also give the facility of the leave management. In the leave
management criteria, any teacher who wants to take the leave will
inform the administrator by sending the mail and then administrator will
assign the lecture to another teacher by sending the mail and by sending
sms to the cell phone. In the future, we will also give the facility of
changing any lectures manually. It means if anyone wants to exchange
their lectures which are automatic generated by the system, then he can
able to change it manually. The will also give the alert if any collision
will occur with any other subject of the other branch. So these are some
future prospects of our project which we are going to implement later.
Hard constraints: (1) Lectures (2) Room Occupancy (3) Conflicts (4)
Availabilities
Soft constraints: (5) Minimum working days (6) Capacity of the room
(7) Compactness of the Curriculum
METHODOLOGY
The methodology used in this application enables us to approach
Evolutionary Algorithms. Evolutionary Algorithms are a class of direct,
probabilistic search and optimisation algorithms gleaned from the model
of organic evolution. A Genetic Algorithm (GA) is a type of EA and is
regarded as being the most widely known EA in recent times. A GA
diers from other search techniques in the following ways: GAs
optimises the trade o between exploring new points in the search space
and exploring the information discovered thus far. GAs is randomised
algorithms, in that they use operators whose results are governed by
probability. The results for such operations are based on the value of a
random number. This means GAs use probabilistic transition rules, not
deterministic rules. GA was combined with a heuristic specific greedy
algorithm to take advantage of the global search of feasible solutions and
specific technique efficiency in local solution optimization. This
approach resulted in considerably smaller execution times.