Publication Search

The selection of a thesis topic that aligns with students’ interests and competencies often poses a challenge in academic environments. Inappropriate topic selection can lead to decreased motivation and delays in completing the final project. This study aims to develop a thesis topic recommendation system based on a genetic algorithm that considers students’ interests and academic abilities. The data used include grades from core courses, results of research interest questionnaires, and a list of thesis topics provided by academic supervisors. Each topic is represented as a chromosome, while the fitness function is calculated based on the level of compatibility between student attributes and topics. The selection process employs the roulette wheel method, with single-point crossover and random mutation to generate an optimal solution population. The test results show that the recommendation system based on the genetic algorithm achieves an accuracy rate of 86.7%, higher than the keyword-matching method, which only reaches 71.2%. Therefore, this approach is proven effective in assisting students to determine thesis topics that are suitable, objective, and efficient.

Labor scheduling is allocating human resources to work stations according to needs. To increase productivity, companies must schedule labor optimally. In allocating labor, the Hotel Menara Lexus company has implemented labor scheduling with 3 work shifts, namely morning, afternoon and night. Because scheduling is still made manually, it is possible for schedule "collisions" to occur and there is no fairness in the distribution of shifts to each employee. To solve this problem, an appropriate algorithm is needed so that the scheduling process can run optimally. The application of genetic algorithm methods in scheduling problems is able to produce good solutions using chromosome representation, determining objective function values, fitness evaluation, determining probability function values, selection process using Roulette Wheel, crossover method using one cut-point crossover, and mutation at the above level. 0.5 can then be generated. From parameter testing, the results obtained  

Travelling Salesman Problem (TSP) is a problem that is often encountered by a salesman who must travel exactly once to all consumers in a route and will return to the starting point of departure. Algorithm Genetic Algorithm is one way to find heuristic solutions based on the evolutionary ideas of natural selection and genetics. The aim is to find the optimal route for the distribution of bottled water products produced by PT. Mual Natio Maju Bersama. To find a solution, the chromosomes processed by the genetic algorithm are represented through the stages in the Genetic Algorithm individual initialization, fitness value, linear fitness ranking, roulette whell selection, crossover, and mutation. In order to achieve the optimum solution, namely The best path obtained is PT Mual Tio Maju Bersama –BUMDES Sait ni Huta - UD. Alvaro - UD. Lancelhot – UD. Alris – UD. Jamel – Toko Kelontong SRC Resi 2 – Toko Notra – UD. B Siringoringo – Toko Dahlia Siahaan – UD. Purba – UD. Cahaya – UD. Hutapea – UD. Gabe – UD. Setia II – UD. Larisma II – UD. Antoni – UD. Bona Siahaan – UD. Sederhana – Toko Manalu – UD. Setia I – Toko Ferdinan – UD. Alboy – Wisma Daun Mas – UD. Top Jaya – UD. Mega Silaban – BUMDES Silaitlait – UD. Rika – UD. Panamot – Piltik Coffee and Homestay Bandar Udara Silangit – UD. Rolas Boy – UD. Salamat Karya – UD. Simpang Jaya – UD. Lambok - Piltik Coffee and Homestay Siborongborong – UD. Bahagia – UD. Marlinca – UD. Heri Joel Pasaribu – UD. Ebenezer – UD. Mawar – UD. A Saudara – UD. SP Perdana – PDAM Mual Na Tio – UD. Rokkap - PT Mual Tio Maju Bersama. The best path length is 125.2700 cartesian units and the best fitness value is 0.008000.