RANCANG BANGUN APLIKASI PENJADWALAN PELAJARAN OTOMATIS MENGGUNAKAN METODE GABUNGAN SIMULATED ANNEALING DAN VERTEX GRAPH COLORING
Total View This Week0
Total View This Week0
Institusion
Universitas Muhammadiyah Malang
Author
Aprianto, Aprianto
Subject
LB1603 Secondary Education. High schools
Datestamp
2022-12-26 04:52:23
Abstract :
Applications made in this paper are the applications of the design of the course schedule automatically according to the schedule of lectures on the college of Information Engineering University Muhhamadiyah Malang. The methods used for preparation of the schedule are the incorporation of Simulated Annealing with Vertex Graph Coloring. Vertex Graph Coloring (VGC) is the method that using graph techniques, coloring graph means coloring the vertices or vertex coloring. Staining node could provides a different colour on each node that neighbors so there is no two points are neighbors are the same color. Simulated annealing (SA) is one of the heuristic method in search for optimal solutions. These algorithms solve optimization problems by simulating how the metal is cooled down to the crystal structure. Scheduling results obtained from combining these two methods are produce optimal scheduling constraints soft although some provisions are still violated.
Applications made in this paper are the applications of the design of the course schedule automatically according to the schedule of lectures on the college of Information Engineering University Muhhamadiyah Malang. The methods used for preparation of the schedule are the incorporation of Simulated Annealing with Vertex Graph Coloring. Vertex Graph Coloring (VGC) is the method that using graph techniques, coloring graph means coloring the vertices or vertex coloring. Staining node could provides a different colour on each node that neighbors so there is no two points are neighbors are the same color. Simulated annealing (SA) is one of the heuristic method in search for optimal solutions. These algorithms solve optimization problems by simulating how the metal is cooled down to the crystal structure. Scheduling results obtained from combining these two methods are produce optimal scheduling constraints soft although some provisions are still violated.
Download
book
BibTex
Latex, Jabref
cloud_download
Original Resource
url resource Institution
