├── Input └── coursedefinitions.xlsx ├── LICENSE ├── Output ├── Constraints.jpg ├── Thumbs.db ├── chromosome.jpg ├── classhours.jpg ├── courses.jpg ├── fitness.jpg ├── result.jpg ├── result.xlsx └── variables.jpg ├── README.md ├── dersAta.m ├── ders_programi_fitness.m ├── main.m └── myfitness.m /Input/coursedefinitions.xlsx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/balcilar/TimeTabling-GeneticAlgorithm/0d87419d0c674fdc3fa6ea7ff30f3da9e5f69183/Input/coursedefinitions.xlsx -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | Apache License 2 | Version 2.0, January 2004 3 | http://www.apache.org/licenses/ 4 | 5 | TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 6 | 7 | 1. Definitions. 8 | 9 | "License" shall mean the terms and conditions for use, reproduction, 10 | and distribution as defined by Sections 1 through 9 of this document. 11 | 12 | "Licensor" shall mean the copyright owner or entity authorized by 13 | the copyright owner that is granting the License. 14 | 15 | "Legal Entity" shall mean the union of the acting entity and all 16 | other entities that control, are controlled by, or are under common 17 | control with that entity. For the purposes of this definition, 18 | "control" means (i) the power, direct or indirect, to cause the 19 | direction or management of such entity, whether by contract or 20 | otherwise, or (ii) ownership of fifty percent (50%) or more of the 21 | outstanding shares, or (iii) beneficial ownership of such entity. 22 | 23 | "You" (or "Your") shall mean an individual or Legal Entity 24 | exercising permissions granted by this License. 25 | 26 | "Source" form shall mean the preferred form for making modifications, 27 | including but not limited to software source code, documentation 28 | source, and configuration files. 29 | 30 | "Object" form shall mean any form resulting from mechanical 31 | transformation or translation of a Source form, including but 32 | not limited to compiled object code, generated documentation, 33 | and conversions to other media types. 34 | 35 | "Work" shall mean the work of authorship, whether in Source or 36 | Object form, made available under the License, as indicated by a 37 | copyright notice that is included in or attached to the work 38 | (an example is provided in the Appendix below). 39 | 40 | "Derivative Works" shall mean any work, whether in Source or Object 41 | form, that is based on (or derived from) the Work and for which the 42 | editorial revisions, annotations, elaborations, or other modifications 43 | represent, as a whole, an original work of authorship. For the purposes 44 | of this License, Derivative Works shall not include works that remain 45 | separable from, or merely link (or bind by name) to the interfaces of, 46 | the Work and Derivative Works thereof. 47 | 48 | "Contribution" shall mean any work of authorship, including 49 | the original version of the Work and any modifications or additions 50 | to that Work or Derivative Works thereof, that is intentionally 51 | submitted to Licensor for inclusion in the Work by the copyright owner 52 | or by an individual or Legal Entity authorized to submit on behalf of 53 | the copyright owner. For the purposes of this definition, "submitted" 54 | means any form of electronic, verbal, or written communication sent 55 | to the Licensor or its representatives, including but not limited to 56 | communication on electronic mailing lists, source code control systems, 57 | and issue tracking systems that are managed by, or on behalf of, the 58 | Licensor for the purpose of discussing and improving the Work, but 59 | excluding communication that is conspicuously marked or otherwise 60 | designated in writing by the copyright owner as "Not a Contribution." 61 | 62 | "Contributor" shall mean Licensor and any individual or Legal Entity 63 | on behalf of whom a Contribution has been received by Licensor and 64 | subsequently incorporated within the Work. 65 | 66 | 2. Grant of Copyright License. Subject to the terms and conditions of 67 | this License, each Contributor hereby grants to You a perpetual, 68 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 69 | copyright license to reproduce, prepare Derivative Works of, 70 | publicly display, publicly perform, sublicense, and distribute the 71 | Work and such Derivative Works in Source or Object form. 72 | 73 | 3. Grant of Patent License. Subject to the terms and conditions of 74 | this License, each Contributor hereby grants to You a perpetual, 75 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 76 | (except as stated in this section) patent license to make, have made, 77 | use, offer to sell, sell, import, and otherwise transfer the Work, 78 | where such license applies only to those patent claims licensable 79 | by such Contributor that are necessarily infringed by their 80 | Contribution(s) alone or by combination of their Contribution(s) 81 | with the Work to which such Contribution(s) was submitted. If You 82 | institute patent litigation against any entity (including a 83 | cross-claim or counterclaim in a lawsuit) alleging that the Work 84 | or a Contribution incorporated within the Work constitutes direct 85 | or contributory patent infringement, then any patent licenses 86 | granted to You under this License for that Work shall terminate 87 | as of the date such litigation is filed. 88 | 89 | 4. Redistribution. You may reproduce and distribute copies of the 90 | Work or Derivative Works thereof in any medium, with or without 91 | modifications, and in Source or Object form, provided that You 92 | meet the following conditions: 93 | 94 | (a) You must give any other recipients of the Work or 95 | Derivative Works a copy of this License; and 96 | 97 | (b) You must cause any modified files to carry prominent notices 98 | stating that You changed the files; and 99 | 100 | (c) You must retain, in the Source form of any Derivative Works 101 | that You distribute, all copyright, patent, trademark, and 102 | attribution notices from the Source form of the Work, 103 | excluding those notices that do not pertain to any part of 104 | the Derivative Works; and 105 | 106 | (d) If the Work includes a "NOTICE" text file as part of its 107 | distribution, then any Derivative Works that You distribute must 108 | include a readable copy of the attribution notices contained 109 | within such NOTICE file, excluding those notices that do not 110 | pertain to any part of the Derivative Works, in at least one 111 | of the following places: within a NOTICE text file distributed 112 | as part of the Derivative Works; within the Source form or 113 | documentation, if provided along with the Derivative Works; or, 114 | within a display generated by the Derivative Works, if and 115 | wherever such third-party notices normally appear. The contents 116 | of the NOTICE file are for informational purposes only and 117 | do not modify the License. You may add Your own attribution 118 | notices within Derivative Works that You distribute, alongside 119 | or as an addendum to the NOTICE text from the Work, provided 120 | that such additional attribution notices cannot be construed 121 | as modifying the License. 122 | 123 | You may add Your own copyright statement to Your modifications and 124 | may provide additional or different license terms and conditions 125 | for use, reproduction, or distribution of Your modifications, or 126 | for any such Derivative Works as a whole, provided Your use, 127 | reproduction, and distribution of the Work otherwise complies with 128 | the conditions stated in this License. 129 | 130 | 5. Submission of Contributions. Unless You explicitly state otherwise, 131 | any Contribution intentionally submitted for inclusion in the Work 132 | by You to the Licensor shall be under the terms and conditions of 133 | this License, without any additional terms or conditions. 134 | Notwithstanding the above, nothing herein shall supersede or modify 135 | the terms of any separate license agreement you may have executed 136 | with Licensor regarding such Contributions. 137 | 138 | 6. Trademarks. This License does not grant permission to use the trade 139 | names, trademarks, service marks, or product names of the Licensor, 140 | except as required for reasonable and customary use in describing the 141 | origin of the Work and reproducing the content of the NOTICE file. 142 | 143 | 7. Disclaimer of Warranty. Unless required by applicable law or 144 | agreed to in writing, Licensor provides the Work (and each 145 | Contributor provides its Contributions) on an "AS IS" BASIS, 146 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 147 | implied, including, without limitation, any warranties or conditions 148 | of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A 149 | PARTICULAR PURPOSE. You are solely responsible for determining the 150 | appropriateness of using or redistributing the Work and assume any 151 | risks associated with Your exercise of permissions under this License. 152 | 153 | 8. Limitation of Liability. In no event and under no legal theory, 154 | whether in tort (including negligence), contract, or otherwise, 155 | unless required by applicable law (such as deliberate and grossly 156 | negligent acts) or agreed to in writing, shall any Contributor be 157 | liable to You for damages, including any direct, indirect, special, 158 | incidental, or consequential damages of any character arising as a 159 | result of this License or out of the use or inability to use the 160 | Work (including but not limited to damages for loss of goodwill, 161 | work stoppage, computer failure or malfunction, or any and all 162 | other commercial damages or losses), even if such Contributor 163 | has been advised of the possibility of such damages. 164 | 165 | 9. Accepting Warranty or Additional Liability. While redistributing 166 | the Work or Derivative Works thereof, You may choose to offer, 167 | and charge a fee for, acceptance of support, warranty, indemnity, 168 | or other liability obligations and/or rights consistent with this 169 | License. However, in accepting such obligations, You may act only 170 | on Your own behalf and on Your sole responsibility, not on behalf 171 | of any other Contributor, and only if You agree to indemnify, 172 | defend, and hold each Contributor harmless for any liability 173 | incurred by, or claims asserted against, such Contributor by reason 174 | of your accepting any such warranty or additional liability. 175 | 176 | END OF TERMS AND CONDITIONS 177 | 178 | APPENDIX: How to apply the Apache License to your work. 179 | 180 | To apply the Apache License to your work, attach the following 181 | boilerplate notice, with the fields enclosed by brackets "[]" 182 | replaced with your own identifying information. (Don't include 183 | the brackets!) The text should be enclosed in the appropriate 184 | comment syntax for the file format. We also recommend that a 185 | file or class name and description of purpose be included on the 186 | same "printed page" as the copyright notice for easier 187 | identification within third-party archives. 188 | 189 | Copyright [yyyy] [name of copyright owner] 190 | 191 | Licensed under the Apache License, Version 2.0 (the "License"); 192 | you may not use this file except in compliance with the License. 193 | You may obtain a copy of the License at 194 | 195 | http://www.apache.org/licenses/LICENSE-2.0 196 | 197 | Unless required by applicable law or agreed to in writing, software 198 | distributed under the License is distributed on an "AS IS" BASIS, 199 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 200 | See the License for the specific language governing permissions and 201 | limitations under the License. 202 | -------------------------------------------------------------------------------- /Output/Constraints.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/balcilar/TimeTabling-GeneticAlgorithm/0d87419d0c674fdc3fa6ea7ff30f3da9e5f69183/Output/Constraints.jpg -------------------------------------------------------------------------------- /Output/Thumbs.db: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/balcilar/TimeTabling-GeneticAlgorithm/0d87419d0c674fdc3fa6ea7ff30f3da9e5f69183/Output/Thumbs.db -------------------------------------------------------------------------------- /Output/chromosome.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/balcilar/TimeTabling-GeneticAlgorithm/0d87419d0c674fdc3fa6ea7ff30f3da9e5f69183/Output/chromosome.jpg -------------------------------------------------------------------------------- /Output/classhours.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/balcilar/TimeTabling-GeneticAlgorithm/0d87419d0c674fdc3fa6ea7ff30f3da9e5f69183/Output/classhours.jpg -------------------------------------------------------------------------------- /Output/courses.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/balcilar/TimeTabling-GeneticAlgorithm/0d87419d0c674fdc3fa6ea7ff30f3da9e5f69183/Output/courses.jpg -------------------------------------------------------------------------------- /Output/fitness.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/balcilar/TimeTabling-GeneticAlgorithm/0d87419d0c674fdc3fa6ea7ff30f3da9e5f69183/Output/fitness.jpg -------------------------------------------------------------------------------- /Output/result.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/balcilar/TimeTabling-GeneticAlgorithm/0d87419d0c674fdc3fa6ea7ff30f3da9e5f69183/Output/result.jpg -------------------------------------------------------------------------------- /Output/result.xlsx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/balcilar/TimeTabling-GeneticAlgorithm/0d87419d0c674fdc3fa6ea7ff30f3da9e5f69183/Output/result.xlsx -------------------------------------------------------------------------------- /Output/variables.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/balcilar/TimeTabling-GeneticAlgorithm/0d87419d0c674fdc3fa6ea7ff30f3da9e5f69183/Output/variables.jpg -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # A Genetic Algorithm Solution for Weekly Course Timetabling Problem 2 | 3 | Genetic Algorithms are the method for finding enough good solutions for the problems which cannot be solved by a standard method named NP-Hard problems. Although it does not guaranty the best solution, we can find relatively enough good solutions for most engineering problems within that method [1]. 4 | 5 | Educational institutes such as high schools universities use weekly course timetabling to use all sources in an optimum way. To make an optimum weekly timetable is such an example of NP-Hard problem which cannot be solved in any brutal force method which checks every single probability. In this repository, we provided a solution to that problem using Genetic Algorithm which tries to minimize determined fitness function which that function is a sort of measurement of how the timetable is optimum [2]. 6 | 7 | ## Inputs 8 | 9 | Our method needs the inputs in 3 different excel sheet table. The first table should include the year, course code, course hour, lecturer name and number of student registered that course are mandatory fields. In addition to that fields, you can write any courses preferred day, classroom and starting hour too. In the following figure, you can find one example of provided inputs for table1. 10 | 11 | ![Sample image](Output/courses.jpg?raw=true "Title") 12 | 13 | According to that table, the second-row course and 11th-row course have some selection. Second-row course's preferred classroom id is 1, the preferred day is 0 which means there is no day selection, the preferred session is zero means there is no session selection. That means we wanted to assign that course in classroom 1, but we have no any other selection. If the algorithm assigns that course on that classroom it gains 0.9 points per student who registered that course. For 11th row course, it preferred to be in clasroom4, it preferred to be in 3th day which means Wednesday, and it preferred to be in session1. That the effect of this selection is 0.5. 14 | 15 | In the following figure, you can find table2 and table3 simultaneously. Table2 is for sessions for each day and their penalty values per student if we assign any course at the certain session. In the given table, we do not prefer to assign a course to the first and last session. The first sessions penalty is 1 but the last sessions penalty is 0.5 per student. The third table is for classrooms and their capacities. 16 | 17 | ![Sample image](Output/classhours.jpg?raw=true "Title") 18 | 19 | ## Symbols and Meanings. 20 | 21 | ![Sample image](Output/variables.jpg?raw=true "Title") 22 | 23 | ## Constraints 24 | 25 | ![Sample image](Output/Constraints.jpg?raw=true "Title") 26 | 27 | ## Fitness Function 28 | 29 | We should reach those 3 objections. 30 | * All course must be on the preferred day, session and hours as high as possible 31 | * We should avoid assigning a course on unwanted time 32 | * We should assign course on a classroom as big as possible. 33 | 34 | If we suppose our problem as the minimization problem, the first objective should be negative, the second objection should be positive and the third one is again negative. Here is our fitness function. 35 | 36 | ![Sample image](Output/fitness.jpg?raw=true "Title") 37 | 38 | ## Heuristic 39 | 40 | We need a heuristic assignment algorithm to assign every course with meet all constraints. In that project, we implemented a heuristic algorithm which calculates the possible assignment for each course with meeting all constraints. The genetic algorithm is for selecting in which possible assignment has to be selected. Our heuristic steps are shown below steps. 41 | 42 | * Take next course in course table. 43 | * List all possible day, session classroom for that course which meets the constraints. 44 | * If there is no possibility than make the fitness value as positive infinite value and break the loop. 45 | * In that list, use the certain chromosome of the genetic algorithm which is in range of [0 1]. If the gene is 0 means select the first possibility if the gene is 1 means select the last possibility. the other selections are linearly distributed in the range of [0 1]. 46 | * Assign that course in the selection possibility by the Genetic algorithm. 47 | * If all course is assigned than calculate the total fitness value and return unless go to step1. 48 | 49 | ## Genetic Algorithm 50 | 51 | Our genetic Algorithm consists of the chromosome which is equal to the number of courses to be scheduled. For instance, in our example case, there is 49 number of course, So our gene has 49 chromosomes too. Here is a sample of one chromosome. 52 | 53 | ![Sample image](Output/chromosome.jpg?raw=true "Title") 54 | 55 | According to the above chromosome, let's suppose for the first course we have 400 different possibilities to assign. Since the chromosome value is 0.452335503, we need to select 400x0.452335503=180,98≈181th possibility. We apply that rule for each chromosome step by step to the end. We used 500 for population size, uniform random initial population creation, %5 elitism rate, 200 maximum iteration. We used a hybrid search by pattern search. 56 | 57 | ## Result 58 | 59 | In our test on the provided problem case, we reach -9899.2 fitness value. According to that fitness value, you can find the result of the final timetable on the following figure. 60 | 61 | ![Sample image](Output/result.jpg?raw=true "Title") 62 | 63 | ## References 64 | [1] Reeves, Colin. "Genetic algorithms." Handbook of metaheuristics. Springer US, 2003. 55-82. 65 | 66 | [2] Erben, R.W. & Kepler, J., 1995. A genetic Algorithm Solving a Weekly Course Timetabling Problem, Proc. Of the First Int. Conf. on the Practice and Theory of Automated Timetabling (ICPTAT), pp. 21-32, Napier University, Edinburgh. 67 | 68 | -------------------------------------------------------------------------------- /dersAta.m: -------------------------------------------------------------------------------- 1 | function [Atama DersAtanabilir sonuc]=dersAta(ders,derssaat,dersmevcut,secme,Atama,DersAtanabilir,Cakisma,Derslik) 2 | %% written by Muhammet Balcilar, France 3 | % All rights reserved 4 | 5 | sonuc=1; 6 | Gunsaat=size(Atama,1)/5; 7 | Toplam=Atama(1:end-derssaat+1,:); 8 | toplam=DersAtanabilir(1:end-derssaat+1,ders); 9 | for i=1:derssaat-1 10 | Toplam=Toplam+Atama(i+1:end-derssaat+1+i,:); 11 | toplam=toplam+DersAtanabilir(i+1:end-derssaat+1+i,ders); 12 | end 13 | 14 | for i=1:4 15 | Toplam(i*Gunsaat+2-derssaat:i*Gunsaat,:)=1; 16 | end 17 | 18 | Toplam=Toplam+repmat(toplam,[1 size(Toplam,2)]); 19 | 20 | 21 | I=double(Derslik-dersmevcut<0)'; 22 | Toplam=Toplam+repmat(I,[size(Toplam,1) 1]); 23 | 24 | I=find(Toplam'==0); 25 | if (length(I)==0) 26 | sonuc=0; 27 | return; 28 | end 29 | 30 | s=ceil(secme*length(I)); 31 | if s==0 32 | s=1; 33 | end 34 | saat=ceil(I(s)/size(Toplam,2)); 35 | sinif=I(s)-(saat-1)*size(Toplam,2); 36 | Atama(saat:saat-1+derssaat,sinif)=ders; 37 | DersAtanabilir(saat:saat-1+derssaat,find(Cakisma(ders,:)==1))=1; 38 | 39 | 40 | -------------------------------------------------------------------------------- /ders_programi_fitness.m: -------------------------------------------------------------------------------- 1 | function scores = ders_programi_fitness(x,Cakisma,Derslik,Gunsaat,DersSaat,DersMevcut,Ceza,tercih) 2 | %% written by Muhammet Balcilar, France 3 | % All rights reserved 4 | 5 | scores = zeros(size(x,1),1); 6 | for j = 1:size(x,1) 7 | %[f Atama]=myfitness(x{j},Cakisma,Derslik,Gunsaat,DersSaat,DersMevcut,Ceza,tercih); 8 | [f Atama]=myfitness(x(j,:),Cakisma,Derslik,Gunsaat,DersSaat,DersMevcut,Ceza,tercih); 9 | scores(j) = f; 10 | end 11 | -------------------------------------------------------------------------------- /main.m: -------------------------------------------------------------------------------- 1 | %% written by Muhammet Balcilar, France 2 | % All rights reserved 3 | 4 | clear all 5 | clc 6 | 7 | dosya='Input/coursedefinitions.xlsx'; 8 | 9 | 10 | [A B]=xlsread(dosya,1); 11 | nders=size(A,1); 12 | Cakisma=zeros(nders,nders); 13 | for i=1:nders 14 | for j=1:nders 15 | if i~=j && ((~isequal(B{i+1,5},B{j+1,5}) && A(i,1)==A(j,1)) || isequal(B{i+1,12},B{j+1,12})) 16 | Cakisma(i,j)=1; 17 | end 18 | end 19 | end 20 | DersSaat=A(:,6); 21 | DersMevcut=A(:,11); 22 | if (size(A,2)>11) 23 | tercih=A(:,12:15); 24 | else 25 | tercih=nan(size(A,1),4); 26 | end 27 | 28 | [C D]=xlsread(dosya,2); 29 | Gunsaat=size(C,1); 30 | Ceza=C(:,3:7); 31 | Ceza=Ceza(:); 32 | 33 | [E F]=xlsread(dosya,3); 34 | Derslik=E; 35 | 36 | 37 | 38 | 39 | 40 | FitnessFcn = @(x) ders_programi_fitness(x,Cakisma,Derslik,Gunsaat,DersSaat,DersMevcut,Ceza,tercih); 41 | options = optimoptions(@ga,'MaxGenerations',200,'PopulationSize',500, ... 42 | 'PlotFcn', @gaplotbestf, ... 43 | 'HybridFcn',@patternsearch, ... 44 | 'MutationFcn', {@mutationuniform, 0.1}, ... 45 | 'MaxStallGenerations',50,'UseVectorized',true); 46 | [x,fval,reason,output] = ga(FitnessFcn,nders,[],[],[],[],zeros(nders,1),ones(nders,1),[],options); 47 | 48 | 49 | 50 | 51 | 52 | 53 | 54 | [f Atama]=myfitness(x,Cakisma,Derslik,Gunsaat,DersSaat,DersMevcut,Ceza,tercih); 55 | 56 | for i=1:size(Atama,1) 57 | q=[];qs=1; 58 | for j=1:size(Atama,2) 59 | d=Atama(i,j); 60 | if (d>0) 61 | q=[q B{d+1,5} '-' B{d+1,4} '-' B{d+1,11} ' ' B{d+1,12} '-' F{j+1,1} char(10)]; 62 | qs=qs+1; 63 | end 64 | end 65 | q=q(1:end-1); 66 | 67 | gun=ceil(i/Gunsaat); 68 | saat=i- (gun-1)*Gunsaat; 69 | D{saat+1,gun+1}=q; 70 | end 71 | 72 | 73 | xlswrite('Output/result.xlsx',D); 74 | 75 | hExcel = actxserver('Excel.Application'); 76 | hWorkbook = hExcel.Workbooks.Open([cd '\Output/result.xlsx']); 77 | hWorksheet = hWorkbook.Sheets.Item(1); 78 | hWorksheet.Columns.Item(1).columnWidth = 15; 79 | hWorksheet.Columns.Item(2).columnWidth = 40; 80 | hWorksheet.Columns.Item(3).columnWidth = 40; 81 | hWorksheet.Columns.Item(4).columnWidth = 40; 82 | hWorksheet.Columns.Item(5).columnWidth = 40; 83 | hWorksheet.Columns.Item(6).columnWidth = 40; 84 | hWorkbook.Save; 85 | hWorkbook.Close; 86 | hExcel.Quit; 87 | -------------------------------------------------------------------------------- /myfitness.m: -------------------------------------------------------------------------------- 1 | function [f Atama]=myfitness(x,Cakisma,Derslik,Gunsaat,DersSaat,DersMevcut,Ceza,tercih) 2 | %% written by Muhammet Balcilar, France 3 | % All rights reserved 4 | f=0; 5 | % nders=length(x)/2; 6 | % p=x(1:nders); 7 | % r=x(nders+1:end); 8 | 9 | nders=length(x); 10 | p=1:nders; 11 | r=x(1:nders); 12 | 13 | Atama=zeros(Gunsaat * 5 , length(Derslik)); 14 | DersAtanabilir=zeros(Gunsaat * 5,nders); 15 | 16 | for i=1:length(DersSaat) 17 | [Atama DersAtanabilir sonuc]=dersAta(p(i),DersSaat(p(i)),DersMevcut(p(i)),r(i),Atama,DersAtanabilir,Cakisma,Derslik); 18 | if (sonuc==0) 19 | f=inf; 20 | break; 21 | end 22 | end 23 | A=Atama; 24 | I=find(A>0); 25 | A(I)=DersMevcut(A(I)); 26 | 27 | 28 | % erken yada gec dersler icin ogrenci basina ceza hesaplaniyor 29 | f1=sum(sum(A.*repmat(Ceza,[1 size(A,2)]))); 30 | 31 | 32 | % buyuk siniflari secmek adina bos kalan yerler kadar mukafat veriliyor 33 | derslik=repmat(Derslik',[size(A,1) 1]); 34 | bosyer=derslik-A; 35 | f2=sum(sum(bosyer(I))); 36 | 37 | % tercih uyuyorsa dersi alan ogrenci sayisinca tercih etkisi kadar mukafat 38 | % verilir. 39 | J=find(~isnan(tercih(:,1))); 40 | 41 | f3=0; 42 | for i=1:length(J) 43 | 44 | mask_sinif=zeros(1,size(Atama,2)); 45 | if tercih(J(i),1)==0 46 | mask_sinif=ones(1,size(Atama,2)); 47 | else 48 | mask_sinif(tercih(J(i),1))=1; 49 | end 50 | mask_gun=zeros(1,5); 51 | if tercih(J(i),2)==0 52 | mask_gun=ones(1,5); 53 | else 54 | mask_gun(tercih(J(i),2))=1; 55 | end 56 | mask_saat=zeros(Gunsaat,1); 57 | if tercih(J(i),3)==0 58 | mask_saat=ones(Gunsaat,1); 59 | else 60 | mask_saat(tercih(J(i),3):min(Gunsaat,tercih(J(i),3)-1+DersSaat(J(i))))=1; 61 | end 62 | mask_ts=[]; 63 | for j=1:length(mask_gun) 64 | if mask_gun(j)==1 65 | mask_ts=[mask_ts;mask_saat]; 66 | else 67 | mask_ts=[mask_ts;zeros(length(mask_saat),1)]; 68 | end 69 | end 70 | mask=[]; 71 | for j=1:length(mask_sinif) 72 | if mask_sinif(j)==1 73 | mask=[mask mask_ts]; 74 | else 75 | mask=[mask zeros(length(mask_ts),1)]; 76 | end 77 | end 78 | f3=f3+sum(sum((Atama==J(i)).*A.*mask*tercih(J(i),4))); 79 | end 80 | 81 | f=f1-f2-f3; 82 | 83 | 84 | 85 | 86 | 87 | 88 | --------------------------------------------------------------------------------