LocalSearchImplementation/GeneticAlgorithm.java at master · rezaramadhan/LocalSearchImplementation · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
import java.util.List;
import java.util.Random;

class GeneticAlgorithm {
	private List<Kelas> matkul;
	private List<Ruangan> ruang;
	private String[] population;
	private int nPopulation;

	public GeneticAlgorithm(List<Kelas> k, List<Ruangan> r) {
		matkul = k;
		ruang = r;
	}

	//generate String random, representasi satu individu
	public String generateRandom() {
		int totalGenerate = matkul.size();
		String str = "";

		String tmp;
		int max, min;
		int idx, hari, mulai, selesai;
		Random rand = new Random();
		//format: <idxruang><Hari><mulai><selesai>
		for (int i = 0; i < totalGenerate; i++) {
			tmp = "";

			//generate idxruang
			//TODO -> Cek barangkali kelasnya ga bisa di ruang yg diambil
			idx = rand.nextInt(ruang.size());
			tmp = tmp+idx;

			//generate hari
			hari = rand.nextInt(5) + 1;
			tmp = tmp + hari;

			min = Math.min(matkul.get[i].awal, ruang.get[idx].buka);
			max = Math.max(matkul.get[i].selesai, ruang.get[idx].tutup) - matkul.get[i].durasi;

			//generate mulai
			mulai = rand.nextInt(max-min + 1) + min;
			tmp = tmp + mulai;

			//generate selesai
			selesai = mulai + matkul.get[i].durasi;
			tmp = tmp + selesai;

			str = str + tmp;
		}
		return str;
	}

	public int fitnessFunction(String in) {

	}

	public String mutation (String in) {

	}

	public String crossover(String s1, String s2) {

	}

	public void fullProcess(){

	}
}