Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 2

Genetic Algorithm for lecturing schedule optimization

IJCCS (Indonesian Journal of Computing and Cybernetics Systems) · Vol. 13 No. 1 (2019) · pp. 83–94

DOI
10.22146/ijccs.43038
ISSN
2460-7258, 1978-1520
Published
2019-01-31
Publisher
IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.
Language
eng
License
creativecommons.org/licenses/by-sa/4.0

Abstract

Scheduling is a classic problem in lecturing. Rooms, lecturers, times and scheduling constraints must be managed well to get an optimal schedule. University of Boyolali (UBY) also encounter the same scheduling problems. The problem was tried to be solved by building a library based on Genetic Algorithm (GA). GA is a computation method which inspired by natural selection. The computation consists of some operators i.e. Tournament Selection, Uniform Crossover, Weak Parent Replacement and two mutation operators (Interchanging Mutation and Violated Directed Mutation (VDM)). The two mutation method are compared to find which better mutation operator. The library was planned to have a capability to define custom constraints (scheduling requirements that were not accommodated by the library) without core program modifications. The test results show that VDM is more promising for optimal solutions than Interchanging Mutation. In UBY cases, optimal solution (fitness value=1) is reached in 12 minutes 41 second with adding 6 new room and inactivated 2 constraint i.e. lecturing begins at 14.00 except for 3rd semester of science law study program with morning class and lecturing participants must not over classroom capacity.

Keywords

Collaboration network of the authors

4 authors · 3 co-authorship links · 2 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Sekolah Tinggi Multi Media "MMTC" Yogyakarta
  • Universitas Gadjah Mada
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Khabib MustofaUniversitas Gadjah Mada1
Arum MarwatiSekolah Tinggi Multi Media "MMTC" Yogyakarta1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://journal.ugm.ac.id/ijccs/oai, first harvested 26 Okt 2026, last seen 26 Okt 2026.
Original metadata (oai_dc) 
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Genetic Algorithm for lecturing schedule optimization</dc:title>
	<dc:creator>Kristiadi, David</dc:creator>
	<dc:creator>Hartanto, Rudy</dc:creator>
	<dc:subject xml:lang="en-US">computer Science</dc:subject>
	<dc:subject xml:lang="en-US">Genetic algorithm;Violated Directed Mutation;VDM vs Interchanging Mutation</dc:subject>
	<dc:description xml:lang="en-US">Scheduling is a classic problem in lecturing. Rooms, lecturers, times and scheduling constraints must be managed well to get an optimal schedule. University of Boyolali (UBY) also encounter the same scheduling problems. The problem was tried to be solved by building a library based on Genetic Algorithm (GA). GA is a computation method which inspired by natural selection. The computation consists of some operators i.e. Tournament Selection, Uniform Crossover, Weak Parent Replacement and two mutation operators (Interchanging Mutation and Violated Directed Mutation (VDM)). The two mutation method are compared to find which better mutation operator. The library was planned to have a capability to define custom constraints (scheduling requirements that were not accommodated by the library) without core program modifications. The test results show that VDM is more promising for optimal solutions than Interchanging Mutation. In UBY cases, optimal solution (fitness value=1) is reached in 12 minutes 41 second with adding 6 new room and inactivated 2 constraint i.e. lecturing begins at 14.00 except for 3rd semester of science law study program with morning class and lecturing participants must not over classroom capacity.</dc:description>
	<dc:publisher xml:lang="en-US">IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2019-01-31</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US"></dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journal.ugm.ac.id/ijccs/article/view/43038</dc:identifier>
	<dc:identifier>10.22146/ijccs.43038</dc:identifier>
	<dc:source xml:lang="en-US">IJCCS (Indonesian Journal of Computing and Cybernetics Systems); Vol 13, No 1 (2019): January; 83-94</dc:source>
	<dc:source>2460-7258</dc:source>
	<dc:source>1978-1520</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journal.ugm.ac.id/ijccs/article/view/43038/23722</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2019 IJCCS (Indonesian Journal of Computing and Cybernetics Systems)</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>