Preview

Timetable Case Study

Better Essays
Open Document
Open Document
1094 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Timetable Case Study
: Development of Timetable

4.1 Procedure
4.1.1 Data Collection
We have to develop a timetable using ACO variant MAX-MIN Ant System. For developing the timetable, firstly we need the timetable data of a university. So, we try to collect the data of DEI university. In DEI, there are two academic sessions: odd-semester and even semester in a year. Odd semester runs in the months of July to December and runs the classes of odd no semester, e.g.; first, third, fifth and seventh semesters. And even semester runs in the months of January to June and runs the classes of even no semester, e.g.; second, fourth, sixth and eighth semesters. Collecting the timetable data of whole DEI requires more time. So, because of less time, we collected the data
…show more content…
4.2 Technology Used
4.2.1 Matlab
Matlab is defined as a high level programming language which supports all kinds of operation like preprocessing of the data. Then based on the preprocessed information analysis of data takes place and the analyzed data can be represented either statistically or graphically easily. This language can be used in wide variety of applications and is easy to understand.
In our work, we have to work with many matrixes to construct the timetable. And matrices required many operation. So, we need a technology which supports matrixes and performs operations on it. Matlab is a good tool which supports matrixes very well.
We have done all of the programming in matlab and make the timetable in matlab.
4.2.2 Microsoft Excel
Microsoft Excel is easy to use and we can easily store and manipulate the data in it. To make the timetable, we need to store the data of a university courses and the rooms. So, to store the data of timetable, we use the Microsoft Excel.
4.3 Snapshots
4.3.1 Details of Courses

Figure 4.1: Course Details

4.3.2 Details of
…show more content…
The MAX-MIN Ant System (MMAS) algorithm has successfully generated the timetable of different sizes. The MMAS algorithm does not take more time for generating the timetable of small and medium size but it takes some time for generating the timetable of large size.
5.1 Parameter Tuning
We have determined the parameter values of the algorithm for different sizes of the UCTP problem experimentally by taking some test cases. By these parameter values in different UCTP problem instances, MMAS algorithm converges more rapidly with minimum no of soft violations and generates the timetable.
In the experiment, the most influence factor is the heuristic information (β) and the other influence factors are pheromone evaporation rate (ρ), pheromone weight (α) and no of ants (A) and no of iterations (I).

Figure 5.1: Parameters used in the different size of UCTP

Parameter Small Medium Large
Pheromone weight (α) 1 1

You May Also Find These Documents Helpful

  • Better Essays

    Acme

    • 1450 Words
    • 8 Pages

    Acme De Mexico’s Manager has requested assistance in developing a minimum cost daily assignment schedule for the customer service employees in their newly built store. Specifically, he wants to know the minimum total cost per day, which is the decision variable. He also wants to know the exact amount of part time and full time employees which will determine the total cost. The objective function is to minimize costs.…

    • 1450 Words
    • 8 Pages
    Better Essays
  • Good Essays

    This examination is designed to test your ability to calculate efficiently with the aid of MATLAB as…

    • 1357 Words
    • 17 Pages
    Good Essays
  • 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
  • Good Essays

    Database for Scheduling

    • 528 Words
    • 3 Pages

    There are many advantages of creating a database for scheduling purposes. Having a database will allow trainers to see what courses they have coming up and their supervisors will also see what their workload is. Being part of a corporation that is expanding needs to be able to adapt to changes and having a database for scheduling will help. First we will have to look at what is needed to create a scheduling database and all the information that needs to be fulfilled. Next we will look at the advantages and disadvantages compared to trainers manually scheduling their courses compared to a database that is maintained by the company.…

    • 528 Words
    • 3 Pages
    Good Essays
  • Powerful Essays

    Dragonfly case study

    • 1041 Words
    • 5 Pages

    3. The Earliest Start (ES) and Earliest Finish (EF) and Latest Start (LS) and Latest Finish (LF) times are calculated using Forward Pass and Backward Pass Algorithm.…

    • 1041 Words
    • 5 Pages
    Powerful Essays
  • Better Essays

    Hi-Ho Yo-Yo, Inc

    • 1077 Words
    • 5 Pages

    This process of scheduling is used for completion of work within the due date. This method emphasizes on processing with the job which takes the least time. The division of the work is done on the basis of input, processing time and the the due date for the completion of assignment. The flow time is calculated for the each part of the job, using the processing time, which helps us in determination of the overall time for the completion of work. This method is useful in single machine environment (Hochbaum, 1999).…

    • 1077 Words
    • 5 Pages
    Better Essays
  • Powerful Essays

    But, most students will have trouble finding a solution. The solution procedure suggested involves decomposing a larger problem into a series of smaller problems that are easier to solve. The case provides students with a good first look at the kinds of problems where management science is applied in practice. The problem is a real one that one of the authors was asked by the Head Professional at Royal Oak Country Club for help with. Solution: Scheduling problems such as this occur frequently, and are often difficult to solve.…

    • 4205 Words
    • 17 Pages
    Powerful Essays
  • Good Essays

    You need to ask yourself what exactly you need in your software. For instance a…

    • 518 Words
    • 3 Pages
    Good Essays
  • Good Essays

    Developing a plan requires several months of preparation time by a team of experienced service designers. The railroad industry is losing a significant amount of experienced employees due to retirement. Railroad companies are in need of software tools to decrease their dependence on people. Ravindra Ahuja, Krishna Jha, and Jian Liu created algorithms to solve the railroad blocking and train scheduling problems. Reducing railroad blocking is critical for the railroad industry in order to save cost.…

    • 598 Words
    • 3 Pages
    Good Essays
  • Good Essays

    Hi-Ho, YO-Yo, Inc.

    • 1985 Words
    • 11 Pages

    Sequencing is worried with determining the order in which jobs are administered. The orders also needs to be determined for handling jobs at work center and for work handled at each person’s work stations. The condition can become difficult when workers centers are heavily overloaded and long-lasting jobs are involved. However, in this case study, the main problem is to report how to meet the limitation such as delays, due dates, and to pleasing the customers so the orders will increase. The corporation experienced a delay because of the make-up day for flooding in the month of June so the production date of the order will move to July. So in the month of July, it is indicated in the given case that there are three Saturdays (July 9th, 16th, and 23rd) and the labors will continue to work. Also they will have one holiday on July 4th apart from the weekends. From the time allowed how will the operation manger choose the best scheduling from the given methods (First Come, First Serve (FCFS), Shortest Processing Time (SPT), Earliest Due Date (EDD), and Critical Ratio (CR) methods.…

    • 1985 Words
    • 11 Pages
    Good Essays
  • Powerful Essays

    Use, Design and Evolution of Process Scheduling and Planning Systems,” ISA Trans., 36(2), 81 (1997).…

    • 10858 Words
    • 44 Pages
    Powerful Essays
  • Good Essays

    Scilab Optimization

    • 1166 Words
    • 5 Pages

    Overview of the industrial-grade solvers available in Scilab and the type of optimization problems which can be solved by Scilab.…

    • 1166 Words
    • 5 Pages
    Good Essays
  • Good Essays

    Travelling Salesman Problem

    • 3162 Words
    • 13 Pages

    Rina Refianti dan A.Benny Mutiara Jurusan Teknik Informatika, Universitas Gunadarma Abstraksi Ant Colony System (ACS) adalah sebuah metodologi yang dihasilkan melalui pengamatan terhadap semut. Di dalam ACS terdapat sejumlah semut buatan, dinamai ants, yang berfungsi sebagai agent yang ditugaskan untuk mencari solusi terhadap suatu masalah optimisasi. ACS telah diterapkan dalam berbagai bidang, salah satunya adalah untuk mencari solusi optimal pada Traveling Salesman Problem (TSP). Dengan memberikan sejumlah n kota, TSP dapat didefinisikan sebagai suatu permasalahan dalam menemukan jalur terpendek dengan mengunjungi setiap kota yang ada hanya sekali. ACS telah diuji dan dibandingkan dengan metodologi yang lain untuk membuktikan keoptimalannya tersebut. Dan hal inilah yang menjadi dasar bagi penulis dalam melakukan penelitian terhadap ACS, yaitu untuk membuktikan keoptimalannya tersebut. Penelitian ini dilakukan dengan mengimplementasikan ACS ke dalam bentuk kode-kode program berbahasa Java. Kemudian dilakukan percobaan untuk membandingkan antara ACS dengan metodologi lainnya yang juga meng-implementasikan agent di dalamnya. Dari hasil percobaan diketahui bahwa secara garis besar ACS terbukti merupakan metodologi yang paling optimal dalam menemukan jalur terpendek. Dan penelitian ini telah berhasil membuktikan keoptimalan dari ACS dalam menemukan solusi terhadap TSP. Keyword: Genetic Algorithm, Ant System, Software Agent, Pheromone, state transition rule 1. Pengantar Salah rekayasa satu paradigma lunak baru dalam dapat dihindari akan dibutuhkannya lebih dari satu agent, seiring dengan semakin kompleksnya tugas yang dikerjakan oleh sistem tersebut. Paradigma pengembangan sistem di mana dalam suatu komunitas terdapat beberapa agent yang saling berinteraksi, bernegosiasi, dan berkoordinasi satu sama lain dalam menjalankan pekerjaan disebut dengan Multi Agent System (MAS) [Romi]. Colony M. Dan…

    • 3162 Words
    • 13 Pages
    Good Essays
  • Satisfactory Essays

    Airport

    • 600 Words
    • 3 Pages

    So that we need to be regulated by an airport traffic simulation program and algorithm, which guarantee timelines of departing and arriving flights with collisions for the sake of simplification. We have to make a program and implement the algorithm.…

    • 600 Words
    • 3 Pages
    Satisfactory Essays
  • Good Essays

    Scheduling

    • 338 Words
    • 2 Pages

    Program or plan that identifies the media channels used in an advertising campaign, and specifies insertion or broadcast dates, positions, and duration of the messages.…

    • 338 Words
    • 2 Pages
    Good Essays