Time Table Generation
|
|
- Stanley Smith
- 5 years ago
- Views:
Transcription
1 ISSN Time Table Generation #1 Vikas Gawade, #2 Kunal Deokar, #3 Prasanna Retherekar, #4 Shrinath Bhegade, #5 Prof A.D. Bhosale 1 gawadevikas13@gmail.com 2 kunaldeokar99@gmail.com 3 diprevprasanna@gmail.com 4 shrinath.bhegade@gmail.com 5 rajeabhaysinh1978@gmail.com #1234 Computer Enginering Department #5 Assistant Professor Computer Enginering Department, Pune University PVPIT Pune Maharashtra India ABSTRACT In this paper the proposed system presents a novel approach of solving School, College timetable scheduling using complex algorithms to design an effective model for scheduling with challenging constraints considerations. The objective of the research is to create a model using Genetic Algorithm, which can be effectively used to resolve difficult combinatorial optimization problems. Although, there has been an extensive research towards this field but majority of the research results are much in its nascent stage. The problem of timetable scheduling is described as a highly constrained NP-hard problem. Major issues of the hard and soft constraints required for scheduling are resolved rigorously, the scheduling solution presented in this paper is an adaptive one, with a primary aim of obtaining best the optimal solutions. ARTICLE INFO Article History Received :5 th May 2016 Received in revised form : 7 th May 2016 Accepted : 10 th May 2016 Published online : 12 th May 2016 Keywords:- Active Rules, Rule-Based agents, Genetic, Soft Constraints, Hard Constraints, Modules. I. INTRODUCTION Planning timetable is one of the most complex and error prone application. There are still serious problems like generation of high cost time table are occurring while scheduling and these problems are repeating frequently. Therefore there is a great requirement for an application distributing the course evenly and without collisions. The aim is here to develop a simple, easily understandable, efficient and portable application which could automatically generate good quality time table with in a second. The time table generation consist of main algorithm Genetic algorithm. Use of genetic techniques helps to produce a best schedule by regulating all the rules. II. LITERATURE SURVEY Paper name: Use of Active Rules and Genetic Algorithm to Generate the Automatic Time-Table.. This document proposes an optimized technique to automate time table generation system. Paper name: Automating class schedule generation in the context of university time tabling for information system.the thesis examine the university timetable generation problem. Paper Name: University Timetabling based on Hard Constraints using Genetic Algorithm. The proposed system presents a novel approach of solving University timetabling which is NP-hard problem using Genetic Algorithm. A Literature Review on Timetable generation algorithms based on Genetic Algorithm. The problem of timetable scheduling is described as a highly constrained NP-hard problem. III. PROPOSED SYSTEM In Genetic Algorithm: A population pool of chromosomes is maintained which is called strings. The chromosomes are strings of symbols or numbers. These are also called the genotype (the coding of the solution), whereas the solution itself is called the phenotype. These chromosomes need to 2015, IERJ All Rights Reserved Page 1
2 be evaluated for fitness. Poor solutions are ignored. After making small changes to remaining solutions "natural selection" is allowed to take its course. This helps evolve the gene pool so that better solutions are discovered. They have explained how Genetic algorithms (GA) work in a manner similar to Natural Selection. A population pool of chromosomes is maintained which is called strings. The chromosomes are strings of symbols or numbers. These are also called the genotype (the coding of the solution), whereas the solution itself is called the phenotype. These chromosomes need to be evaluated for fitness. Poor solutions are ignored. After making small changes to remaining solutions "natural selection" is allowed to take its course. This helps evolve the gene pool so that better solutions are discovered. Defining constraints and rules for generating standard efficient schedule: In this paper we have proposed an optimized technique to automate the time table generation. Set of constraints are defined which are divided into hard and soft constraints. Hard constraints constraints which need to be incorporated necessarily otherwise there is no guarantee of valid time tables generated. Soft constraints constraints that are obvious but fulfilling them is not so demanding. Solutions are considered to be better if these can be incorporated. Hard Constraints: 1.The system generates intermediate level as well many final reports including weekly time table, teacher timetable, room wise time table, student time table, department level time table etc. 2.User can set gap of the number of days among the lectures, it can dynamically be adjusted as well. 3.The time tabling algorithm tries to adjust courses to user customized slots according to specified time. 4.It depicts the progress of courses adjustment at intermediate report level and if clashes cannot be removed and impossible to adjust then displays that course and number of lectures, which cannot be adjusted. 5.No.of slots free, available are displayed. 6.Teacher must not clash in two different tables of a time table. 7.Certain lectures that may or may not appear at the same time in more than one class. 8.Classrooms must not be double booked. 9.Every class must be scheduled exactly once. 10.Classes of students must not have two bookings simultaneously. 11.A classroom must be large enough to hold each class booked to it. 12.Lecturers must not be double booked. 13.Each lecturer has their minimum and maximum limit of weekly working hours. Soft Constraints: 1.It prioritizes time slots according to customized priority. If lecture cannot be adjusted then it can be moved up in higher priority slot until adjusted accordingly. 2.All parameters are customized by the user. 3.Some classes require particular rooms. For example, experiments might be held in particular laboratories. 4.Some classes require classrooms to have particular equipment. For example audio visual equipment. 5.Some classes need to be held consecutively. Consider a six hour-long practical experiment. 6.System process for scheduling : The following system architecture shows working of the system: Fig 1: System Architecture. The paper shows module wise generation of time table. It includes: User Module. Database Module. Constraints Time table generation. structure of the automated time table generator : Parameters under consideration: 6 Branches Years in each Students in each Number Subjects of in 3 120/ , IERJ All Rights Reserved Page 2
3 each semester Number of Lecturers in each class rooms for each Laboratories for each Class capacity room Time duration for 1 Lecture Hour Working time 8: 30am- 3:30pm Lunch break 12:45pm- 1:30pm No Of 36 Faculties wise. Faculty Load 4-6 Syllabus work hours per subject 5-7 User Module: User module consist of User GUI. The GUI consists of Authorised User verification and input from the user. The authorized user should only be able to access the system. Much of the sensitive information as faculty work load, details shoud be known and have access to the authorized person. The valid user have authorities to accept or reject the generated time table. The input helps to generate schedule as per users need. The input accepted by the user is used to create a database of all the available data. The Inputs which will be needed by the system by users are: Detailed entries for no of faculties available. Faculty work load. Classrooms Details. Laboratory Details. Yearwise/ Semesterwise syllabus details. Work hours allotted in syllabus. Constraints and rules: The rule and constraints will be defined above given constraints will be used. The Hard constraints are the constraints which need to be incorporated necessarily otherwise there is no guarantee of valid time tables generated. Soft constraints are those that are obvious but fulfilling them is not so demanding. Solutions are considered to be better if these can be incorporated. The constraints will be verified by the system. System Module: The system module consists of : Database Handling. Rules Verification. Time table generation. Display generated schedules. Review/ Regenration. Database handling: Includes input details taken from the user. The details entries are used for creating a database and connectivity between system and database helps to smoothen our access. The database include Course database, Student Database, Lecture Database, Faculty Database, Rooms-Labs database. Rules verification: The rules and constraints defined are used for creating a valuable schedule which helps to cope up with the work load. Thus rules plays important role to generate optimized and user friendly schedule. So verifications of these rules are important to decide hard and soft constraints for generating schedule. Time table generation: Time table generation is the process of creating an efficient, bestfit, optimized, valuable, constraint satisfied schedule. In this paper, authors are using three combinatorial algorithm. The algorithms will be used generating schedule phase wise. Three algorithms will be used are genetic algorithm. The sequential use of algorithms helps to best optimized the results.the algorithm used will be a contributing to the schedule to outfit the best match. The main aim of these paper is to create a most effective, beneficial, estimable schedule that uses complex algortihm. Earlier paper had used single way approach for generating time table which included simulated annealing or else low moduled algorithm. The basic outline of a Genetic Algorithm is as follows: Initialize pool randomly for each generation { Select good solutions to breed new population Create new solutions from parents Evaluate new solutions for fitness Replace old population with new ones }The randomly assigned initial pool is presumably pretty poor. However, successive generations improve, for a number of reasons: Selection: During each successive generation, a proportion of the existing population is selected to breed a new generation. Individual solutions are selected through a fitness-based process, where fitter solutions (as measured by a fitness function) are typically more likely to be selected. Mutation: It allow the algorithm to avoid local minima by preventing the population of chromosomes from becoming too similar to each other, thus slowing or even stopping evolution. Crossover:It combines the genetic material from parents order to produce children, during breeding. Since only the good solutions are picked for breeding, during the selection procedure, the crossover operator mixes the genetic material, in order to produce children with even greater fitness. 2015, IERJ All Rights Reserved Page 3
4 Review / Re-edit / Regeneration: The optimized time table generated will be reviewed by the authorized user if not satisfied with respect to constraints defined, inputs give, database change etc. Again an efficient, best fit optimized new time table would be generated to fulfill user s requirements. Output: Finally the satisfied time table would be accepted by the user and printed. Fig 3: Classroom Wise TT. IV. RESULT ANALYSIS Correctness refers to the validity of the final result obtained or the outcome of the experiments performed using the proposed approach, on the same hardware and software platform as compared to the original or base approach. The correctness is checked by capability of algorithm to optimally generate highest score for the timetable, comparing the no of requirements satisfied for number of lectures, subject wise, laboratory allocations, faculty wise allocations. Fig 4: Faculty Wise TT Fig 2: Create and View TT Screen Fig 5: Course Wise TT The above figures show the correctness of the proposed algorithm. It can be seen that the algorithm produces optimized scheduled for the college. The algorithm generates and maintains highest scores as possible which guarantees optimization of requirements. Thus, it is proved that the algorithm maintains the correctness and validity of the final result and thus can be applied to all situations. 2015, IERJ All Rights Reserved Page 4
5 The project generates schedules course wise for each.it generates schedule for all the respective faculties, it generates schedule for room s, Laboratories. V. CONCLUSION The Study has presented an approach of automating timetable generation by applying a new technique like genetic algorithm. The survey commences successful implementation of genetic technique to obtain best fit optimal solution than those with earlier strategies. There is nothing to prevent this architecture from being a subset of a rich and powerful event/action language. This paper described how set of active rules can be used to express the knowledge of intelligent and how a genetic algorithm can be used to dynamically prioritize rules in the face of dynamically evolving environments. The paper illustrated the applicability of the above method by using into optimize the performance. The advantages of this approach to optimizing the solution for time table are apparent: distributed solution, load balancing and fault situations.. VI. FUTURE SCOPE The paper implements complex algorithms to generate automated time table generation. Though the authors are attempting to implement genetic algorithms to best fit the schedule to get optimized efficient results. The future work can be to create upgradable, evolutionable algorithms which would result to improve the performance. Another scope is to make a dynamic time table for the institute by applying interactions with the staff, head and students. Faculty leaves can be managed at 11 th hour to take over by another staff. By developing the architecture for mobile connectivity(android apps) where the teacher could share notes with students. By posting notifications about changes in lectures schedules, exam schedules to students. pages Springer Verlag, Berlin-Heidelberg, Germany, [6]Jean-François Cordeau, Brigitte Jaumard, Rodrigo Morales, Efficient Timetabling Solution with Tabu Search, International Timetable Competition, [7]S.Abdennadher and H. Schlenker. Nursescheduling using constraint logic programming. In B. McKay, X. Yao, C. S. Newton, J.-H. Kim, and T. Furuhashi, editors, Proceedings of the Sixteenth National Conference on Artifcial Intelligence and the Eleventh Innovative Applications of Artifcial Intelligence Conference,99, Orlando, Florida, July 1999, pages 838{843. AAAI Press/MIT Press, [8]U. Aickelin and K. A. Dowsland. An indirect genetic algorithm for a nurse scheduling problem. Computers and Operational Research, forthcoming. [9]N. Brauner, R. Echahed, G. Finke, F. Prost, and W. Serwe. Integration des methods de reecriture et de recherche operationnelle pour la modelisation et la resolution de contraintes : application a la plani_cation de personnel medical. In GISEH 003, Lyon, January [10] E. K. BURKE, P. D. CAUSMAECKER, AND G. V. BERGHE. A HYBRID TABU SEARCH ALGORITHM FOR THE NURSE ROSTERING PROBLEM. IN B. MCKAY, X. YAO, C. S. NEWTON, J.-H. KIM, AND T. FURUHASHI, EDITORS, SIMULATED EVOLUTION AND LEARNING, SECOND ASIA-PACI_C CONFERENCE ON SIMULATED EVOLUTION AND LEARNING, SEAL `98, CANBERRA, AUSTRALIA, NOVEMBER 24{ , SELECTED PAPERS, VOLUME REFRENCES [1]J. J. Grefenstette, editor. Proceedings of the First International Conference on Genetic Algorithms and their Applications.Practice and Theory of Automated Timetabling VI Proceedings of The 6th International Conference on the Practice and Theory of Automa. [2]N. R. Jennings.Coordination Techniques for Distributed Artificial Intelligence. University of London Mile End Rd.London E1 4NS UK, [3]Om Prakash Shukla, Amit Bahekar, Jaya Vijayvergiya, Effective Fault Diagnosis and Maintenance Optimization by Genetic Algorithm [4]Ender Özcan, Alpay Alkan, A Memetic Algorithm for Solving a Timetabling Problem: An Incremental Strategy, MISTA [5]Luca Di Gaspero, Andrea Schaerf, Tabu search techniques for examination timetabling. In E. Burke and W. Erben, editors, Practice and Theory of Automated Timetabling, Vol. 2079, Lecture Notes in Computer Science, 2015, IERJ All Rights Reserved Page 5
TIMETABLE SCHEDULING USING GENETIC ALGORITHM
Journal homepage: www.mjret.in TIMETABLE SCHEDULING USING GENETIC ALGORITHM Prof. R.V. Dagade 1, Sayyad Shaha Hassan 2, Pratik Devhare 3, Srujan Khilari 4, Swapnil Sarda 5 Computer Department Marathwada
More informationA COMPARATIVE STUDY OF EVOLUTIONARY ALGORITHMS FOR SCHOOL SCHEDULING PROBLEM
A COMPARATIVE STUDY OF EVOLUTIONARY ALGORITHMS FOR SCHOOL SCHEDULING PROBLEM 1 DANIEL NUGRAHA, 2 RAYMOND KOSALA 1 School of Computer Science, Bina Nusantara University, Jakarta, Indonesia 2 School of Computer
More informationGrouping Genetic Algorithm with Efficient Data Structures for the University Course Timetabling Problem
Grouping Genetic Algorithm with Efficient Data Structures for the University Course Timetabling Problem Felipe Arenales Santos Alexandre C. B. Delbem Keywords Grouping Genetic Algorithm Timetabling Problem
More informationFuzzy Inspired Hybrid Genetic Approach to Optimize Travelling Salesman Problem
Fuzzy Inspired Hybrid Genetic Approach to Optimize Travelling Salesman Problem Bindu Student, JMIT Radaur binduaahuja@gmail.com Mrs. Pinki Tanwar Asstt. Prof, CSE, JMIT Radaur pinki.tanwar@gmail.com Abstract
More informationA WEB-BASED SYSTEM FOR MULTI-AGENT INTERACTIVE TIMETABLING
A WEB-BASED SYSTEM FOR MULTI-AGENT INTERACTIVE TIMETABLING João Pedro Pedroso Nelma Moreira Rogério Reis DCC-FC & LIACC, Universidade do Porto R. do Campo Alegre 823, 4150-180 Porto, Portugal {jpp, nam,
More informationHYBRID GENETIC ALGORITHM AND GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE FOR SOLVING A NURSE SCHEDULING PROBLEM
HYBRID GENETIC ALGORITHM AND GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE FOR SOLVING A NURSE SCHEDULING PROBLEM 1 CHEBIHI FAYCAL, 2 MOHAMMED ESSAID RIFFI, 3 BELAID AHIOD 1 Research Scholar, Department
More informationGenetic Algorithms Based Solution To Maximum Clique Problem
Genetic Algorithms Based Solution To Maximum Clique Problem Harsh Bhasin computergrad.com Faridabad, India i_harsh_bhasin@yahoo.com Rohan Mahajan Lingaya s University Faridabad, India mahajanr28@gmail.com
More informationHybridization EVOLUTIONARY COMPUTING. Reasons for Hybridization - 1. Naming. Reasons for Hybridization - 3. Reasons for Hybridization - 2
Hybridization EVOLUTIONARY COMPUTING Hybrid Evolutionary Algorithms hybridization of an EA with local search techniques (commonly called memetic algorithms) EA+LS=MA constructive heuristics exact methods
More informationJob Shop Scheduling Problem (JSSP) Genetic Algorithms Critical Block and DG distance Neighbourhood Search
A JOB-SHOP SCHEDULING PROBLEM (JSSP) USING GENETIC ALGORITHM (GA) Mahanim Omar, Adam Baharum, Yahya Abu Hasan School of Mathematical Sciences, Universiti Sains Malaysia 11800 Penang, Malaysia Tel: (+)
More informationEvolving SQL Queries for Data Mining
Evolving SQL Queries for Data Mining Majid Salim and Xin Yao School of Computer Science, The University of Birmingham Edgbaston, Birmingham B15 2TT, UK {msc30mms,x.yao}@cs.bham.ac.uk Abstract. This paper
More informationCOLLEGE TIMETABLE SCHEDULING USING OPTIMISTIC HYBRID SCHEDULING ALGORITHM
COLLEGE TIMETABLE SCHEDULING USING OPTIMISTIC HYBRID SCHEDULING ALGORITHM. B.S.Yelure 1, Y.D.Chavhan 2 Assistant Professor, Information Tech Dept., G.C.E.Karad, India 1. Assistant Professor, Information
More informationA Modified Genetic Algorithm for Process Scheduling in Distributed System
A Modified Genetic Algorithm for Process Scheduling in Distributed System Vinay Harsora B.V.M. Engineering College Charatar Vidya Mandal Vallabh Vidyanagar, India Dr.Apurva Shah G.H.Patel College of Engineering
More informationDepartment of CSE, SDMIT Ujire, Karnataka, India. DOI: /ijarcsse/SV7I5/0234
DOI: 10.23956/ijarcsse/SV7I5/0234 Volume 7, Issue 5, May 2017 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at:
More informationAndroid Power Management & Ways to reduce the Power Consumption in an Android Smartphone
ISSN 2395-1621 Android Power Management & Ways to reduce the Power Consumption in an Android Smartphone #1 Shailendra Kumar Pandey, #2 Varsha Shinde, #3 Rani Magar #4 Prof. Gunjun K. Naigaonkar 1 pandey_shailendra.ghrcempcse@raisoni.net
More informationGenetic algorithm based on number of children and height task for multiprocessor task Scheduling
Genetic algorithm based on number of children and height task for multiprocessor task Scheduling Marjan Abdeyazdan 1,Vahid Arjmand 2,Amir masoud Rahmani 3, Hamid Raeis ghanavati 4 1 Department of Computer
More informationGENETIC ALGORITHM with Hands-On exercise
GENETIC ALGORITHM with Hands-On exercise Adopted From Lecture by Michael Negnevitsky, Electrical Engineering & Computer Science University of Tasmania 1 Objective To understand the processes ie. GAs Basic
More informationAn Improved Approach for Examination Time Tabling Problem Using Graph Coloring
International Journal of Engineering and Technical Research (IJETR) ISSN: 31-0869 (O) 454-4698 (P), Volume-7, Issue-5, May 017 An Improved Approach for Examination Time Tabling Problem Using Graph Coloring
More informationA Fitness Function to Find Feasible Sequences of Method Calls for Evolutionary Testing of Object-Oriented Programs
A Fitness Function to Find Feasible Sequences of Method Calls for Evolutionary Testing of Object-Oriented Programs Myoung Yee Kim and Yoonsik Cheon TR #7-57 November 7; revised January Keywords: fitness
More informationLiterature Review On Implementing Binary Knapsack problem
Literature Review On Implementing Binary Knapsack problem Ms. Niyati Raj, Prof. Jahnavi Vitthalpura PG student Department of Information Technology, L.D. College of Engineering, Ahmedabad, India Assistant
More informationA New Selection Operator - CSM in Genetic Algorithms for Solving the TSP
A New Selection Operator - CSM in Genetic Algorithms for Solving the TSP Wael Raef Alkhayri Fahed Al duwairi High School Aljabereyah, Kuwait Suhail Sami Owais Applied Science Private University Amman,
More informationA Steady-State Genetic Algorithm for Traveling Salesman Problem with Pickup and Delivery
A Steady-State Genetic Algorithm for Traveling Salesman Problem with Pickup and Delivery Monika Sharma 1, Deepak Sharma 2 1 Research Scholar Department of Computer Science and Engineering, NNSS SGI Samalkha,
More informationAn Extensible Modelling Framework for the Examination Timetabling Problem
An Extensible Modelling Framework for the Examination Timetabling Problem David Ranson 1 and Samad Ahmadi 2 1 Representational Systems Lab, Department of Informatics, University of Sussex, Falmer, UK d.j.ranson@sussex.ac.uk
More informationAn Application of Genetic Algorithms to University Timetabling
An Application of Genetic Algorithms to University Timetabling BSc (Hons) Computer Science Robert Gordon University, Aberdeen Author: Alexander Brownlee Project Supervisor: Dr. John McCall Date: 29/04/2005
More informationUsing Genetic Algorithms to optimize ACS-TSP
Using Genetic Algorithms to optimize ACS-TSP Marcin L. Pilat and Tony White School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, ON, K1S 5B6, Canada {mpilat,arpwhite}@scs.carleton.ca
More informationPreprocessing of Stream Data using Attribute Selection based on Survival of the Fittest
Preprocessing of Stream Data using Attribute Selection based on Survival of the Fittest Bhakti V. Gavali 1, Prof. Vivekanand Reddy 2 1 Department of Computer Science and Engineering, Visvesvaraya Technological
More informationHYBRID GENETIC ALGORITHM WITH GREAT DELUGE TO SOLVE CONSTRAINED OPTIMIZATION PROBLEMS
HYBRID GENETIC ALGORITHM WITH GREAT DELUGE TO SOLVE CONSTRAINED OPTIMIZATION PROBLEMS NABEEL AL-MILLI Financial and Business Administration and Computer Science Department Zarqa University College Al-Balqa'
More informationClassification and Optimization using RF and Genetic Algorithm
International Journal of Management, IT & Engineering Vol. 8 Issue 4, April 2018, ISSN: 2249-0558 Impact Factor: 7.119 Journal Homepage: Double-Blind Peer Reviewed Refereed Open Access International Journal
More informationKey words. space allocation, optimisation, heuristics, hill climbing.
A COMPUTER BASED SYSTEM FOR SPACE ALLOCATIO OPTIMISATIO E.K. Burke, P. Cowling, J.D. Landa Silva, B. McCollum, D. Varley Automated Scheduling, Optimisation and Planning Group Department of Computer Science,
More informationA New Exam Timetabling Algorithm
A New Exam Timetabling Algorithm K.J. Batenburg W.J. Palenstijn Leiden Institute of Advanced Computer Science (LIACS), Universiteit Leiden P.O. Box 9512, 2300 RA Leiden, The Netherlands {kbatenbu, wpalenst}@math.leidenuniv.nl
More informationA NOVEL APPROACH FOR PRIORTIZATION OF OPTIMIZED TEST CASES
A NOVEL APPROACH FOR PRIORTIZATION OF OPTIMIZED TEST CASES Abhishek Singhal Amity School of Engineering and Technology Amity University Noida, India asinghal1@amity.edu Swati Chandna Amity School of Engineering
More informationA Genetic Algorithm for Multiprocessor Task Scheduling
A Genetic Algorithm for Multiprocessor Task Scheduling Tashniba Kaiser, Olawale Jegede, Ken Ferens, Douglas Buchanan Dept. of Electrical and Computer Engineering, University of Manitoba, Winnipeg, MB,
More informationA Memetic Algorithm for Parallel Machine Scheduling
A Memetic Algorithm for Parallel Machine Scheduling Serafettin Alpay Eskişehir Osmangazi University, Industrial Engineering Department, Eskisehir, Turkiye Abstract - This paper focuses on the problem of
More informationHybrid of Genetic Algorithm and Continuous Ant Colony Optimization for Optimum Solution
International Journal of Computer Networs and Communications Security VOL.2, NO.1, JANUARY 2014, 1 6 Available online at: www.cncs.org ISSN 2308-9830 C N C S Hybrid of Genetic Algorithm and Continuous
More informationA Web-Based Evolutionary Algorithm Demonstration using the Traveling Salesman Problem
A Web-Based Evolutionary Algorithm Demonstration using the Traveling Salesman Problem Richard E. Mowe Department of Statistics St. Cloud State University mowe@stcloudstate.edu Bryant A. Julstrom Department
More informationGrid Scheduling Strategy using GA (GSSGA)
F Kurus Malai Selvi et al,int.j.computer Technology & Applications,Vol 3 (5), 8-86 ISSN:2229-693 Grid Scheduling Strategy using GA () Dr.D.I.George Amalarethinam Director-MCA & Associate Professor of Computer
More informationSolving ISP Problem by Using Genetic Algorithm
International Journal of Basic & Applied Sciences IJBAS-IJNS Vol:09 No:10 55 Solving ISP Problem by Using Genetic Algorithm Fozia Hanif Khan 1, Nasiruddin Khan 2, Syed Inayatulla 3, And Shaikh Tajuddin
More informationA Binary Model on the Basis of Cuckoo Search Algorithm in Order to Solve the Problem of Knapsack 1-0
22 International Conference on System Engineering and Modeling (ICSEM 22) IPCSIT vol. 34 (22) (22) IACSIT Press, Singapore A Binary Model on the Basis of Cuckoo Search Algorithm in Order to Solve the Problem
More informationGenetic Algorithms with Oracle for the Traveling Salesman Problem
PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY VOLUME 7 AUGUST 25 ISSN 17-884 Genetic Algorithms with Oracle for the Traveling Salesman Problem Robin Gremlich, Andreas Hamfelt, Héctor
More informationGenetic Algorithm for Network Design Problem-An Empirical Study of Crossover Operator with Generation and Population Variation
International Journal of Information Technology and Knowledge Management July-December 2010, Volume 2, No. 2, pp. 605-611 Genetic Algorithm for Network Design Problem-An Empirical Study of Crossover Operator
More informationDETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES
DETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES SHIHADEH ALQRAINY. Department of Software Engineering, Albalqa Applied University. E-mail:
More informationEscaping Local Optima: Genetic Algorithm
Artificial Intelligence Escaping Local Optima: Genetic Algorithm Dae-Won Kim School of Computer Science & Engineering Chung-Ang University We re trying to escape local optima To achieve this, we have learned
More informationA Genetic Algorithm Applied to Graph Problems Involving Subsets of Vertices
A Genetic Algorithm Applied to Graph Problems Involving Subsets of Vertices Yaser Alkhalifah Roger L. Wainwright Department of Mathematical Department of Mathematical and Computer Sciences and Computer
More informationADAPTATION METHODS IN CASE-BASED REASONING
ADAPTATION METHODS IN CASE-BASED REASONING Mikó Balázs 1, Szegh Imre 2, Kutrovácz Lajos 3 1. PhD Student, 2. PhD, Assosiate Professor, 3. Mechanical Engineer Technical University of Budapest, Department
More informationAutomatic Generation of Test Case based on GATS Algorithm *
Automatic Generation of Test Case based on GATS Algorithm * Xiajiong Shen and Qian Wang Institute of Data and Knowledge Engineering Henan University Kaifeng, Henan Province 475001, China shenxj@henu.edu.cn
More informationEvolutionary Non-linear Great Deluge for University Course Timetabling
Evolutionary Non-linear Great Deluge for University Course Timetabling Dario Landa-Silva and Joe Henry Obit Automated Scheduling, Optimisation and Planning Research Group School of Computer Science, The
More informationModified Order Crossover (OX) Operator
Modified Order Crossover (OX) Operator Ms. Monica Sehrawat 1 N.C. College of Engineering, Israna Panipat, Haryana, INDIA. Mr. Sukhvir Singh 2 N.C. College of Engineering, Israna Panipat, Haryana, INDIA.
More informationEvolutionary Computation Algorithms for Cryptanalysis: A Study
Evolutionary Computation Algorithms for Cryptanalysis: A Study Poonam Garg Information Technology and Management Dept. Institute of Management Technology Ghaziabad, India pgarg@imt.edu Abstract The cryptanalysis
More informationNetwork Load Balancing
ISSN 2395-1621 Network Load Balancing #1 Miss. Amruta S. Shinde, #2 Miss. Snehal R. Kumbhar, #3 Miss. Pallavi M. Patil, #4 Miss. Surabhi S. Khotkar, #5 Prof. D.V. Jadhav 1 ameeshinde@gmail.com 2 kumbharsnehal273@gmail.com
More informationA Comparative Study on AVL and Red-Black Trees Algorithm
A Comparative Study on AVL and Red-Black Trees Algorithm P.Sathya Research Scholar Department of Computer Science St.Joseph College (Autonomous) Trichy, India. sathyadhanya0@gmail.com N.Kirubakaran Assistant
More informationA Constructive Evolutionary Approach to School Timetabling
A Constructive Evolutionary Approach to School Timetabling Geraldo Ribeiro Filho 1, Luiz Antonio Nogueira Lorena 2 1 UMC/INPE - Av Francisco Rodrigues Filho, 399 8773-38 Mogi das Cruzes SP Brazil Phone:
More informationUniversity of Waterloo Department of Electrical and Computer Engineering ECE 457A: Cooperative and Adaptive Algorithms Midterm Examination
University of Waterloo Department of Electrical and Computer Engineering ECE 457A: Cooperative and Adaptive Algorithms Midterm Examination Exam Date/Time: Tuesday, June 13, 2017, 8:30-9:50 pm Exam Hall:
More informationC 1 Modified Genetic Algorithm to Solve Time-varying Lot Sizes Economic Lot Scheduling Problem
C 1 Modified Genetic Algorithm to Solve Time-varying Lot Sizes Economic Lot Scheduling Problem Bethany Elvira 1, Yudi Satria 2, dan Rahmi Rusin 3 1 Student in Department of Mathematics, University of Indonesia,
More informationTest Case Generation for Classes in Objects-Oriented Programming Using Grammatical Evolution
Test Case Generation for Classes in Objects-Oriented Programming Using Grammatical Evolution Jirawat Chaiareerat, Peraphon Sophatsathit and Chidchanok Lursinsap Abstract This paper proposes a dynamic test
More informationEvolutionary Non-Linear Great Deluge for University Course Timetabling
Evolutionary Non-Linear Great Deluge for University Course Timetabling Dario Landa-Silva and Joe Henry Obit Automated Scheduling, Optimisation and Planning Research Group School of Computer Science, The
More informationGenetic Algorithm for Finding Shortest Path in a Network
Intern. J. Fuzzy Mathematical Archive Vol. 2, 2013, 43-48 ISSN: 2320 3242 (P), 2320 3250 (online) Published on 26 August 2013 www.researchmathsci.org International Journal of Genetic Algorithm for Finding
More informationOn Using Graph Coloring to Create University Timetables with Essential and Preferential Conditions
On Using Graph Coloring to Create University Timetables with Essential and Preferential Conditions TIMOTHY A. REDL University of Houston-Downtown Department of Computer and Mathematical Sciences One Main
More informationRegression Test Case Prioritization using Genetic Algorithm
9International Journal of Current Trends in Engineering & Research (IJCTER) e-issn 2455 1392 Volume 2 Issue 8, August 2016 pp. 9 16 Scientific Journal Impact Factor : 3.468 http://www.ijcter.com Regression
More informationCHAPTER 4 GENETIC ALGORITHM
69 CHAPTER 4 GENETIC ALGORITHM 4.1 INTRODUCTION Genetic Algorithms (GAs) were first proposed by John Holland (Holland 1975) whose ideas were applied and expanded on by Goldberg (Goldberg 1989). GAs is
More informationThe Genetic Algorithm for finding the maxima of single-variable functions
Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 46-54 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.com The Genetic Algorithm for finding
More informationA Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2
Chapter 5 A Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2 Graph Matching has attracted the exploration of applying new computing paradigms because of the large number of applications
More informationGenetic Algorithms for Vision and Pattern Recognition
Genetic Algorithms for Vision and Pattern Recognition Faiz Ul Wahab 11/8/2014 1 Objective To solve for optimization of computer vision problems using genetic algorithms 11/8/2014 2 Timeline Problem: Computer
More informationA local search algorithm based on chromatic classes for university course timetabling problem
Research Article International Journal of Advanced Computer Research, Vol 7(28) ISSN (Print): 2249-7277 ISSN (Online): 2277-7970 http://dx.doi.org/10.19101/ijacr.2016.627011 A local search algorithm based
More informationARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS
ARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS Gabriela Ochoa http://www.cs.stir.ac.uk/~goc/ OUTLINE Optimisation problems Optimisation & search Two Examples The knapsack problem
More informationReducing Graphic Conflict In Scale Reduced Maps Using A Genetic Algorithm
Reducing Graphic Conflict In Scale Reduced Maps Using A Genetic Algorithm Dr. Ian D. Wilson School of Technology, University of Glamorgan, Pontypridd CF37 1DL, UK Dr. J. Mark Ware School of Computing,
More informationLecture Timetabling Using Genetic Algorithms
Undergraduate Thesis Bachelor of Computer Systems Engineering Lecture Timetabling Using Genetic Algorithms Author Leon Bambrick Supervisor Dr B Lovell Department of Electrical and Computer Engineering
More informationA Hybrid Genetic Algorithm for the Distributed Permutation Flowshop Scheduling Problem Yan Li 1, a*, Zhigang Chen 2, b
International Conference on Information Technology and Management Innovation (ICITMI 2015) A Hybrid Genetic Algorithm for the Distributed Permutation Flowshop Scheduling Problem Yan Li 1, a*, Zhigang Chen
More informationISSN: [Keswani* et al., 7(1): January, 2018] Impact Factor: 4.116
IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY AUTOMATIC TEST CASE GENERATION FOR PERFORMANCE ENHANCEMENT OF SOFTWARE THROUGH GENETIC ALGORITHM AND RANDOM TESTING Bright Keswani,
More informationOptimization Technique for Maximization Problem in Evolutionary Programming of Genetic Algorithm in Data Mining
Optimization Technique for Maximization Problem in Evolutionary Programming of Genetic Algorithm in Data Mining R. Karthick Assistant Professor, Dept. of MCA Karpagam Institute of Technology karthick2885@yahoo.com
More informationOptimization of fuzzy multi-company workers assignment problem with penalty using genetic algorithm
Optimization of fuzzy multi-company workers assignment problem with penalty using genetic algorithm N. Shahsavari Pour Department of Industrial Engineering, Science and Research Branch, Islamic Azad University,
More informationEnhanced Genetic Algorithm for Solving the School Timetabling Problem
Enhanced Genetic Algorithm for Solving the School Timetabling Problem Tan Lay Leng and I.A. Karimi Department of Chemical and Environment Engineering National University of Singapore 10 Kent Ridge Crescent
More informationGenetic Algorithm for Job Shop Scheduling
Genetic Algorithm for Job Shop Scheduling Mr.P.P.Bhosale Department Of Computer Science and Engineering, SVERI s College Of Engineering Pandharpur, Solapur University Solapur Mr.Y.R.Kalshetty Department
More informationKhushboo Arora, Samiksha Agarwal, Rohit Tanwar
International Journal of Scientific & Engineering Research, Volume 7, Issue 1, January-2016 1014 Solving TSP using Genetic Algorithm and Nearest Neighbour Algorithm and their Comparison Khushboo Arora,
More informationSOLVING THE JOB-SHOP SCHEDULING PROBLEM WITH A SIMPLE GENETIC ALGORITHM
ISSN 1726-4529 Int j simul model 8 (2009) 4, 197-205 Original scientific paper SOLVING THE JOB-SHOP SCHEDULING PROBLEM WITH A SIMPLE GENETIC ALGORITHM Lestan, Z.; Brezocnik, M.; Buchmeister, B.; Brezovnik,
More informationMetaheuristic Optimization with Evolver, Genocop and OptQuest
Metaheuristic Optimization with Evolver, Genocop and OptQuest MANUEL LAGUNA Graduate School of Business Administration University of Colorado, Boulder, CO 80309-0419 Manuel.Laguna@Colorado.EDU Last revision:
More informationA genetic algorithm approach for scheduling of resources in well-services companies
A genetic algorithm approach for scheduling of resources in well-services companies Adrian Brezulianu, Lucian Fira Gheorghe Asachi Technical University of Iasi and Greensoft Ltd. Iasi, Romania Monica Fira
More informationEvolutionary Art with Cartesian Genetic Programming
Evolutionary Art with Cartesian Genetic Programming Laurence Ashmore 1, and Julian Francis Miller 2 1 Department of Informatics, University of Sussex, Falmer, BN1 9QH, UK emoai@hotmail.com http://www.gaga.demon.co.uk/
More informationn Given: n set of resources/machines M := {M 1 n satisfies constraints n minimizes objective function n Single-Stage:
Scheduling Scheduling is the problem of allocating scarce resources to activities over time. [Baker 1974] Typically, planning is deciding what to do, and scheduling is deciding when to do it. Generally,
More informationGT HEURISTIC FOR SOLVING MULTI OBJECTIVE JOB SHOP SCHEDULING PROBLEMS
GT HEURISTIC FOR SOLVING MULTI OBJECTIVE JOB SHOP SCHEDULING PROBLEMS M. Chandrasekaran 1, D. Lakshmipathy 1 and P. Sriramya 2 1 Department of Mechanical Engineering, Vels University, Chennai, India 2
More informationLevel: M.Ed. Credit Hour: 3 (2+1) Semester: Second Teaching Hour: 80(32+48)
Course Title: Software Engineering Course No. : ICT Ed 528 Nature of course: Theoretical + Practical Level: M.Ed. Credit Hour: 3 (2+1) Semester: Second Teaching Hour: 80(32+48) 1. Course Description The
More informationCoalition formation in multi-agent systems an evolutionary approach
Proceedings of the International Multiconference on Computer Science and Information Technology pp. 30 ISBN 978-83-6080-4-9 ISSN 896-7094 Coalition formation in multi-agent systems an evolutionary approach
More informationResearch Incubator: Combinatorial Optimization. Dr. Lixin Tao December 9, 2003
Research Incubator: Combinatorial Optimization Dr. Lixin Tao December 9, 23 Content General Nature of Research on Combinatorial Optimization Problem Identification and Abstraction Problem Properties and
More informationMINIMAL EDGE-ORDERED SPANNING TREES USING A SELF-ADAPTING GENETIC ALGORITHM WITH MULTIPLE GENOMIC REPRESENTATIONS
Proceedings of Student/Faculty Research Day, CSIS, Pace University, May 5 th, 2006 MINIMAL EDGE-ORDERED SPANNING TREES USING A SELF-ADAPTING GENETIC ALGORITHM WITH MULTIPLE GENOMIC REPRESENTATIONS Richard
More informationKanban Scheduling System
Kanban Scheduling System Christian Colombo and John Abela Department of Artificial Intelligence, University of Malta Abstract. Nowadays manufacturing plants have adopted a demanddriven production control
More informationScheduling in Multiprocessor System Using Genetic Algorithms
Scheduling in Multiprocessor System Using Genetic Algorithms Keshav Dahal 1, Alamgir Hossain 1, Benzy Varghese 1, Ajith Abraham 2, Fatos Xhafa 3, Atanasi Daradoumis 4 1 University of Bradford, UK, {k.p.dahal;
More informationIncorporating Great Deluge with Kempe Chain Neighbourhood Structure for the Enrolment-Based Course Timetabling Problem
Incorporating Great Deluge with Kempe Chain Neighbourhood Structure for the Enrolment-Based Course Timetabling Problem Salwani Abdullah 1, Khalid Shaker 1, Barry McCollum 2, and Paul McMullan 2 1 Data
More informationTelecommunication and Informatics University of North Carolina, Technical University of Gdansk Charlotte, NC 28223, USA
A Decoder-based Evolutionary Algorithm for Constrained Parameter Optimization Problems S lawomir Kozie l 1 and Zbigniew Michalewicz 2 1 Department of Electronics, 2 Department of Computer Science, Telecommunication
More informationITIL Operational Support and Analysis Capability
ITIL Operational Support and Analysis Capability Certificate: ITIL OSA Capability Duration: 5 day Course Delivery: (Virtual) Classroom, Exam, ebook Course ID: ITL9333CL Language: English, Japanese, French
More informationHybridization of Genetic Algorithm and Linear Programming for Solving Cell Formation Problem with Alternative Process Routings
, October 24-26, 2012, San Francisco, USA Hybridization of Genetic Algorithm and Linear Programming for Solving Cell Formation Problem with Alternative Process Routings Shahrooz Shahparvari, Payam Chiniforooshan
More informationEvolutionary form design: the application of genetic algorithmic techniques to computer-aided product design
Loughborough University Institutional Repository Evolutionary form design: the application of genetic algorithmic techniques to computer-aided product design This item was submitted to Loughborough University's
More informationThe Automated Timetabling of University Exams using a Hybrid Genetic Algorithm
The Automated Timetabling of University Exams using a Hybrid Genetic Algorithm Edmund BURKE, Dave ELLIMAN and Rupert WEARE R.Weare@cs.nott.ac.uk Department of Computer Science University of Nottingham
More informationIntroduction to Evolutionary Computation
Introduction to Evolutionary Computation The Brought to you by (insert your name) The EvoNet Training Committee Some of the Slides for this lecture were taken from the Found at: www.cs.uh.edu/~ceick/ai/ec.ppt
More informationPhiladelphia University Faculty of Information Technology Department of Computer Science --- Semester, 2007/2008. Course Syllabus
Philadelphia University Faculty of Information Technology Department of Computer Science --- Semester, 2007/2008 Course Syllabus Course Title: Compiler Construction Course Level: 4 Lecture Time: Course
More informationIEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 5, NO. 1, FEBRUARY
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 5, NO. 1, FEBRUARY 2001 41 Brief Papers An Orthogonal Genetic Algorithm with Quantization for Global Numerical Optimization Yiu-Wing Leung, Senior Member,
More informationHierarchical Crossover in Genetic Algorithms
Hierarchical Crossover in Genetic Algorithms P. J. Bentley* & J. P. Wakefield Abstract This paper identifies the limitations of conventional crossover in genetic algorithms when operating on two chromosomes
More informationA GENETIC ALGORITHM FOR CLUSTERING ON VERY LARGE DATA SETS
A GENETIC ALGORITHM FOR CLUSTERING ON VERY LARGE DATA SETS Jim Gasvoda and Qin Ding Department of Computer Science, Pennsylvania State University at Harrisburg, Middletown, PA 17057, USA {jmg289, qding}@psu.edu
More informationA Hybrid Constraint Programming Approach to Nurse Rostering Problem
A Hybrid Constraint Programming Approach to Nurse Rostering Problem Fang He*, Dr. Rong Qu The Automated Scheduling, Optimisation and Planning (ASAP) research group School of Computer Science University
More informationMutations for Permutations
Mutations for Permutations Insert mutation: Pick two allele values at random Move the second to follow the first, shifting the rest along to accommodate Note: this preserves most of the order and adjacency
More informationWelcome to Blackboard
Welcome to Blackboard Logging In To access your course, go to http://online.dbu.edu. Click on Login, and enter your User Name and Password. This will be the same user name and password you use to check
More informationMarch 19, Heuristics for Optimization. Outline. Problem formulation. Genetic algorithms
Olga Galinina olga.galinina@tut.fi ELT-53656 Network Analysis and Dimensioning II Department of Electronics and Communications Engineering Tampere University of Technology, Tampere, Finland March 19, 2014
More informationA Duplication Based List Scheduling Genetic Algorithm for Scheduling Task on Parallel Processors
A Duplication Based List Scheduling Genetic Algorithm for Scheduling Task on Parallel Processors Dr. Gurvinder Singh Department of Computer Science & Engineering, Guru Nanak Dev University, Amritsar- 143001,
More information