Preview

Development of Auniversity Timetable Automation System

Good Essays
Open Document
Open Document
15265 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Development of Auniversity Timetable Automation System
DEVELOPMENT OF AUNIVERSITY TIMETABLE AUTOMATION SYSTEM

BY

OYEBANJO SAMUEL ADEJUWON
08CG07800
COMPUTER SCIENCE

A PROJECT SUBMITTED TO THE DEPARTMENT OF COMPUTER AND INFORMATION SCIENCES, COLLEGE OF SCIENCE AND TECHNOLOGY, COVENANT UNIVERSITY, OTA.

IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE AWARD OF THE BACHELOR OF SCIENCE (B.Sc.) HONORS DEGREE IN COMPUTER SCIENCE.

MAY 2012

CERTIFICATION
This is to certify that the project work titled “DEVELOPMENT OF AUNIVERSITY TIMETABLE AUTOMATIONSYSTEM” is a bona fide work carried out by Oyebanjo Samuel Adejuwon (08CG07800) and was supervised by me and submitted to the Department of Computer and Information Sciences, College of Science and Technology, Covenant University, Ota.

Dr. A. A. Azeta ………………………
Project Supervisor Signature and Date

Professor C. K. Ayo ………………………
Head of Development (CIS) Signature and Date

DEDICATION
I dedicate this work to the Almighty God for His Infinite mercies over me; His grace and His faithfulness. I also dedicate this project to my parents Mr. and Mrs. Lekan Oyebanjo for their love, care and support both financially and otherwise.

ACKNOWLEDGEMENT
This work is a synergistic product of many minds and I feel a deep sense of gratitude tomy parents, Mr. and Mrs. Oyebanjo for their encouragement and for being ever supportive. My sincere thanks goes to my supervisor Dr. A. A. Azeta for his thorough assistance with this work andto Mr. Omobadegun and Mr. Oyelami for their encouragement and advice. I also acknowledge the Computer Science Students (set 2011/2012) for their active verbal participation and suggestions towards the evolvement of this project work.

TABLE OF CONTENTS CERTIFICATION 2 DEDICATION 3 ACKNOWLEDGEMENT 4 TABLE OF CONTENTS 5 LIST OF FIGURES 7 LIST OF TABLES 8 ABSTRACT 9 CHAPTER ONE 10 INTRODUCTION 10 1.1. BACKGROUND STATEMENT 10 1.2. STATEMENT OF THE PROBLEM 11 1.3. AIM AND OBJECTIVES



References: 1. A. Cornelissen, M.J. Sprengers and B.Mader(2010). "OPUS-College Timetable Module Design Document" Journal of Computer Science 1(1), 1-7. 2. Abramson D. & Abela J. (1992). "A parallel genetic algorithm for solving the school timetabling problem." In Proceedings of the 15th Australian Computer Science Conference, Hobart, 1-11. 3. Adam Marczyk (2004). "Genetic Algorithms and Evolutionary Computation ". Available online at http://www.talkorigins.org/faqs/genalg/genalg.html. 4. Al-Attar A.(1994). White Paper: "A hybrid GA-heuristic search strategy." AI Expert, USA. 5. Alberto Colorni, Marco Dorigo, Vittorio Manniezzo (1992). "A Genetic Algorithm to Solve the Timetable Problem" Journal of Computational Optimization and Applications, 1, 90-92. 6. Bufe M., Fischer T., Gubbels H., Hacker C., Hasprich O., Scheibel C., Weicker K., Weicker N., Wenig M., & Wolfangel C. (2001). Automated solution of a highly constrained school timetabling problem - preliminary results. EvoWorkshops, Como-Italy. 7. Burke E, Elliman D and Weare R (1994)."A genetic algorithm for university timetabling system." Presented at the East-West Conference on Computer Technologies in Education, Crimea, Ukraine. 8. Carrasco M.P.& Pato M.V.(2001). "A multiobjective genetic algorithm for the class/teacher timetabling problem." In Proceedings of the Practice and Theory of Automated Timetabling (PATAT '00), Lecture Notes in Computer Science, Springer, 2079, 3-17. 9. Chan H. W. (1997). "School Timetabling Using Genetic Search." 2th International Conference on the Practice and Theory of Automated Timetabling, PATAT '97. 10. Coello Carlos (2000). "An updated survey of GA-based multiobjective optimization techniques." ACM Computing Surveys, 32(2), 109-143. 11. Costa D.(1994). "A tabu search algorithm for computing an operational timetable." European Journal of Operational Research, 76(1), 98-110. 12. Datta D., Deb K., & Fonseca, C.M.(2006). Multi-objective evolutionary algorithm for university class timetabling problem, In Evolutionary Scheduling, Springer-Verlag Press. 13. David A Coley (1999). An Introduction to Genetic Algorithms for Scientists and Engineers, 1st ed. World Scientific Publishing Co. Pte. Ltd. 14. Dawkins Richard (1996). The Blind Watchmaker: Why the Evidence of Evolution Reveals a Universe Without Design. W.W. Norton. 15. De Gans O.B.(1981). "A computer timetabling system for secondary schools in the Netherlands". European Journal of Operations Research,7, 175-182. 16. Deb K. (2001). Multi-Objective Optimization using Evolutionary Algorithms. John Wiley & Sons Ltd, England. 17. Deb K., Agarwal S., Pratap A., & Meyarivan T. (2002). "A fast and elitist multi-objective genetic algorithm: NSGA-II." IEEE Transactions on Evolutionary Computation, 6(2), 182-197. 18. Eley M. (2006). "Ant Algorithms for the Exam Timetabling Problem." 6th International Conference on the Practice and Theory of Automated Timetabling, PATAT '06. 19. Fang H. L. (1994). "Genetic Algorithms in Timetabling Problems." PhD Thesis, University of Edinburgh. 20. Fernandes C. (2002). "Infected Genes Evolutionary Algorithm for School Timetabling." WSES International Conference. 21. Fleming Peter and R.C. Purshouse (2002). "Evolutionary algorithms in control systems engineering: a survey." Control Engineering Practice, 10, 1223-1241. 22. Forrest Stephanie (1993). "Genetic algorithms: principles of natural selection applied to computation." Journal of Science, 261, 872-878. 23. Gianoglio P (1990)."Application of neural networks to timetable construction." Presented at the 3rd International Workshop on Neural Network and Their Applications, Nimes, France. 24. Goldberg David (1989). Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley. 25. Gotlieb C.C. (1962). "The construction of class-teacher timetables." Proceedings of IFIP Congress, North-Holland Pub. Co., Amsterdam, 73-77. 26. Gröbner M., Wilke P (2002). "A General View on Timetabling Problems." 4th International Conference on the Practice and Theory of Automated Timetabling - PATAT '02. 27. Haupt Randy and Sue Ellen Haupt (1998). Practical Genetic Algorithms. John Wiley & Sons. 28. Holland, John (1975). Scheduling, Adaptation in Natural and Artificial Systems. The University of Michigan Press. 29. John Holland (1992). "Genetic algorithms." Scientific American, 66-72. 30. Jose Joaquim Moreira(2008) "A system for Automatic Construcion of Exam Timetable Using Genetic Algorithms" Journal of Algorithm and Computations 6(9), 1-18. 31. Kostuch P.A (2003), University of Oxford - University Course Timetabling. St. Anne 's College. 32. Koza John, Forest Bennett, David Andre and Martin Keane (1999). Genetic Programming III: Darwinian Invention and Problem Solving. Morgan Kaufmann Publishers. 33. Koza John, Martin Keane, Matthew Streeter, William Mydlowec, Jessen Yu and Guido Lanza(2003). Genetic Programming IV: Routine Human-Competitive Machine Intelligence. Kluwer Academic Publishers. 34. Lajos G (1995). "Complete university modular timetabling using constraint logic programming." Presented at the 1st International Conference on the Practice and Theory of Automated Timetabling, Scotland, UK. 35. Laudon C.K & Laudon J.P (2004), “Management Information Systems”, 6th Ed. Prentice Hall, New Jersey 36 37. Looi C. (1992). "Neural network methods in combinatorial optimization" Journal of Computers and Operations Research, 19(3/4), 191-208. 39. Mitchell Melanie (1996). An Introduction to Genetic Algorithms. MIT Press. 40. Ossam Chohan (2009). "University Scheduling using Genetic Algorithm." Master Thesis - Department of Computer Engineering, Dalarna University, 3-4. 41. Paechter B, Cumming A, Luchian H and Petriuc M (1994)." Two solutions to the general timetable problem using evolutionary methods." Presented at the 3rd World Conference on Evolutionary Computing. Florida, USA. 42. PATAT (1995). The International Series of Conferences on the Practice and Theory of Automated Timetabling (PATAT) - http://www.asap.cs.nott.ac.uk/patat/patat-index.shtml 43 44. Robertus Johannes Willemen(2002). School timetable construction-Algorithm and Complexity, 1st ed. Netherlands: University of Eindhoven Press 45 46. Srinivasan D., Seow T.H., & Xu J.X., (2002). "Automated time table generation using multiple context reasoning for university modules." In Proceedings of IEEE International Conference on Evolutionary Computation (CEC '02), 1751-1756. 47. Tripathy A. (1984). "School timetabling - A case in large binary integer linear programming." Management Science, 30(12), 1473-1489. 48. Whitten J. F et. al, (2004), “Systems Analysis and Design methods”, McGraw Hill Education New York. 49. Wright M (1996). "School timetabling using heuristic search." Journal of Operational Research Society, 47, 347-357.

You May Also Find These Documents Helpful

  • Satisfactory Essays

    Yardstick Report Essay

    • 700 Words
    • 3 Pages

    Often times I see associates arriving to work too early or too late and them being late can be traced back to the way our schedules are put together. Often times our names will be on more than one different schedule for different areas of the store. I have developed three different solutions for this problem that if implemented would address this issue. Here is a list of my ideas: Letting low level managers create their own schedules, having only one person create the schedule, or having a computer create the schedule based on availability.…

    • 700 Words
    • 3 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Wilco Supply Chain

    • 544 Words
    • 3 Pages

    My current project was to analyze our current delivery model and to give a solution to our loading dock area. Many deliveries recently have been clogging the loading dock and through my analysis, this can be avoided by using time schedules. These schedules are based upon unloading times that were calculated using a queuing system model.…

    • 544 Words
    • 3 Pages
    Satisfactory Essays
  • Powerful Essays

    Goldratt, E., 1988, Computerized shop floor scheduling. International Journal of Production Research, 26 (3) 443-455.…

    • 11337 Words
    • 46 Pages
    Powerful Essays
  • Good Essays

    of conflicting requirements and preferences. We develop an approach to scheduling problems that uses a combination of integer…

    • 5531 Words
    • 23 Pages
    Good Essays
  • Satisfactory Essays

    Time management becomes crucial to the students’ success. However, there is a difficulty in acclimating prior schedules to meet current demands. More so, students are…

    • 225 Words
    • 1 Page
    Satisfactory Essays
  • Powerful Essays

    syllabus

    • 1373 Words
    • 6 Pages

    Students must arrange their schedule to include computer time to complete and submit the work that is required for the course.…

    • 1373 Words
    • 6 Pages
    Powerful Essays
  • Powerful Essays

    Abstract—In this paper we present a multi-agent search technique to face the NP-hard single machine total weighted tardiness scheduling problem in presence of sequence-dependent…

    • 5478 Words
    • 22 Pages
    Powerful Essays
  • Better Essays

    Whole Foods Case Study

    • 1090 Words
    • 5 Pages

    Time management is one of the ways by which the organization can plan for the mental demands of a job (Michael, 2002). Thus by dividing the total time into smaller parts and allocation specific time to each of the tasks the employees can achieve the balance of the schedule of their job (“Time Management Balancing College and Work”, 2011).…

    • 1090 Words
    • 5 Pages
    Better Essays
  • Powerful Essays

    Linear Solution

    • 6098 Words
    • 25 Pages

    The Greenberg Motor example in this chapter is largest large problem in terms of the number of constraints, so it provides a good practice environment. An interesting feature to point out is that LP constraints are capable of tying one production period to the next.…

    • 6098 Words
    • 25 Pages
    Powerful Essays
  • Powerful Essays

    The algorithm begins with multi-population of randomly generated chromosomes. These chromosomes undergo the operations of selection, crossover and mutation. Crossover combines the information from two parent chromosomes to produce new individuals, exploiting the best of the current generation, while mutation or randomly changing some of the parameters allows exploration into other regions of the solution space. Natural selection via a problem specific cost function assures that only the best fit chromosomes remain in the population to mate and produce the next generation. Upon iteration, the genetic algorithm converges to a global solution.…

    • 5119 Words
    • 21 Pages
    Powerful Essays
  • Good Essays

    Genetic Algorithms are adaptive methods which may be used to solve search and optimization problems. They are based on the genetic processes of biological organisms. Over many generations, natural populations evolve according to the principles of natural selection and "survival of the fittest". By mimicking this process, genetic algorithms are able to "evolve" solutions to real world problems, if they have been suitably encoded.…

    • 4307 Words
    • 23 Pages
    Good Essays
  • Powerful Essays

    9 S. Kirkpatrick, Jr. C.D. Gelatt, and M.P. Vecchi. Optimization by simulated annealing. Science, 220:671…

    • 4322 Words
    • 20 Pages
    Powerful Essays
  • Better Essays

    A project proposal submitted in partial fulfillment of the degree of Bachelor of Science in Computer Science of Egerton University.…

    • 1282 Words
    • 6 Pages
    Better Essays
  • Good Essays

    NOTE: If you have difficulties to execute the application, you might not have .Net Framework 3.5 installed on your computer. You can download it here: www.microsoft.com/downloads/details.aspx?FamilyId=333325fd-ae52-4e35-b531508d977d32a6&displaylang=en Description: This is an application to generate all timetable matches for MMU students. You can filter both wanted and unwanted timeslot, and find out which matches fit you the best. With Timetable Zen, you could: 1) Filter unwanted subject’s section. 2) Filter unwanted timeslot. 3) Filter preferred timeslot. 4) Save / Load timetable source. 5) Generate timetable matches faster. Instruction: Step 1: Menus MMU ICEMS Website…

    • 562 Words
    • 3 Pages
    Good Essays
  • Powerful Essays

    As Dean of the College of Engineering, Technology and Computer Science, I have verified that this manuscript meets the College’s regulations governing the content and form of Research.…

    • 912 Words
    • 4 Pages
    Powerful Essays

Related Topics