scholarly journals Algoritma Genetika dengan Mutasi Terbatas untuk Penjadwalan Perkuliahan

2021 ◽  
Vol 21 (2) ◽  
pp. 229-242
Author(s):  
Sisferi Hikmawan
Keyword(s):  
Data Mining ◽  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Service Satisfaction ◽  
Mutation Operator ◽  
Manual Method ◽  
Academic Year

Abstract   In University, lecture scheduling is the most important factor in service satisfaction for students. UNISMA Bekasi still uses the manual method in scheduling lectures. Genetic Algorithms can solve scheduling with different constraints. In the proposed Genetic Algorithm, the mutation operator is changed to be a limited individual mutation and a selection feature that is adjusted to the constraints in the problem to be solved. And Genetic Algorithms with limited mutations are proven to have advantages in accommodating the constraints found in UNISMA Bekasi. The result of testing in experiments conducted on curriculum data for the Odd Semester of the Academic Year 2020/2021 using a Genetic Algorithm with mutation_individu_terbatas, namely minimum load = 0 with iterations = 10 and population = 500.   Keywords: Data Mining, Genetic Algorithm, Schedule, Mutation   Abstrak   Dalam perkuliahan, penjadwalan perkuliahan merupakan faktor paling penting dalam kepuasan pelayanan terhadap mahasiswa. UNISMA Bekasi masih menggunakan cara manual dalam penjadwalan perkuliahan. Algoritma Genetika dapat memecahkan penjadwalan dengan constraint berbeda-beda. Pada Algoritma Genetika yang diajukan, dilakukan pengubahan operator mutasi menjadi mutasi individu terbatas  dan fitur seleksi yang disesuaikan dengan constraint dalam permasalahan yang ingin dipecahkan. Dan Algoritma Genetika dengan mutasi terbatas terbukti memiliki kelebihan dalam mengakomodir permasalahan constraint yang terdapat di UNISMA Bekasi. Dihasilkan Pengujian dalam percobaan yang dilakukan terhadap data kurikulum untuk Semester Ganjil Tahun Akademik 2020/2021 dengan menggunakan Algoritma Genetika dengan mutasi_individu_terbatas yaitu beban minimum = 0 dengan iterasi = 10 dengan populasi = 500.   Kata kunci: Data Mining, Algoritma Genetika, Mutasi, Jadwal Perkuliahan

Formulation of Colors Using a Genetic Algorithm

2012 ◽  
Vol 17 (4) ◽  
pp. 241-244
Author(s):  
Cezary Draus ◽  
Grzegorz Nowak ◽  
Maciej Nowak ◽  
Marcin Tokarski
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Production Process ◽  
Computer Technology ◽  
Manual Method ◽  
Apply Genetic ◽  
Computer Aided ◽  
Multiple Samples ◽  
Plastics Industry

Abstract The possibility to obtain a desired color of the product and to ensure its repeatability in the production process is highly desired in many industries such as printing, automobile, dyeing, textile, cosmetics or plastics industry. So far, most companies have traditionally used the "manual" method, relying on intuition and experience of a colorist. However, the manual preparation of multiple samples and their correction can be very time consuming and expensive. The computer technology has allowed the development of software to support the process of matching colors. Nowadays, formulation of colors is done with appropriate equipment (colorimeters, spectrophotometers, computers) and dedicated software. Computer-aided formulation is much faster and cheaper than manual formulation, because fewer corrective iterations have to be carried out, to achieve the desired result. Moreover, the colors are analyzed with regard to the metamerism, and the best recipe can be chosen, according to the specific criteria (price, quantity, availability). Optimaization problem of color formulation can be solved in many diferent ways. Authors decided to apply genetic algorithms in this domain.

Application of genetic algorithms to construction scheduling with or without resource constraints

2002 ◽  
Vol 29 (3) ◽  
pp. 421-429 ◽  
Author(s):  
Y Cengiz Toklu
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Construction Management ◽  
Construction Projects ◽  
Resource Constraints ◽  
Fitness Function ◽  
Computer Application ◽  
Mutation Operator ◽  
Construction Problem ◽  
Construction Scheduling

The difficulties encountered in scheduling construction projects with resource constraints are highlighted by means of a simplified bridge construction problem. A genetic algorithm applicable to projects with or without resource constraints is described. In this application, chromosomes are formed by genes consisting of the start days of the activities. This choice necessitated introducing two mathematical operators (datum operator and left compression operator) and emphasizing one genetic operator (fine mutation operator). A generalized evaluation of the fitness function is conducted. The algorithm is applied to the example problem. The results and the effects of some of the parameters are discussed.Key words: scheduling, genetic algorithms, construction management, computer application.

scholarly journals Analyzing the Performance of the Multiple-Searching Genetic Algorithm to Generate Test Cases

2020 ◽  
Vol 10 (20) ◽  
pp. 7264
Author(s):  
Wanida Khamprapai ◽  
Cheng-Fa Tsai ◽  
Paohsi Wang
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Execution Time ◽  
Multicast Routing ◽  
Test Case ◽  
Test Cases ◽  
Mutation Operator ◽  
Optimal Solutions ◽  
Crossover Operator ◽  
Network Systems

Software testing using traditional genetic algorithms (GAs) minimizes the required number of test cases and reduces the execution time. Currently, GAs are adapted to enhance performance when finding optimal solutions. The multiple-searching genetic algorithm (MSGA) has improved upon current GAs and is used to find the optimal multicast routing in network systems. This paper presents an analysis of the optimization of test case generations using the MSGA by defining suitable values of MSGA parameters, including population size, crossover operator, and mutation operator. Moreover, in this study, we compare the performance of the MSGA with a traditional GA and hybrid GA (HGA). The experimental results demonstrate that MSGA reaches the maximum executed branch statements in the lowest execution time and the smallest number of test cases compared to the GA and HGA.

Machine Learning Accelerated Genetic Algorithms for Computational Materials Search

2018 ◽  
Author(s):  
Steen Lysgaard ◽  
Paul C. Jennings ◽  
Jens Strabo Hummelshøj ◽  
Thomas Bligaard ◽  
Tejs Vegge
Keyword(s):  
Machine Learning ◽  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Au Nanoparticles ◽  
Learning Model ◽  
Energy Calculations ◽  
Atomic Distribution ◽  
Machine Learning Model ◽  
Fold Reduction ◽  
Computational Materials

A machine learning model is used as a surrogate fitness evaluator in a genetic algorithm (GA) optimization of the atomic distribution of Pt-Au nanoparticles. The machine learning accelerated genetic algorithm (MLaGA) yields a 50-fold reduction of required energy calculations compared to a traditional GA.

A Survey on Data Mining using Genetic Algorithm

2019 ◽  
Vol 7 (6) ◽  
pp. 888-891
Author(s):  
Mariya Khatoon ◽  
Abhay Kumar Agarwal
Keyword(s):  
Data Mining ◽  
Genetic Algorithm

Implementasi Data Mining dengan Algoritma C4.5 untuk Memprediksi Tingkat Kelulusan Mahasiswa

2014 ◽  
Vol 6 (1) ◽  
pp. 15-20 ◽  
Author(s):  
David Hartanto Kamagi ◽  
Seng Hansun
Keyword(s):  
Data Mining ◽  
Drop Out ◽  
Time Pass ◽  
Academic Fields ◽  
C4.5 Algorithm ◽  
Index Terms ◽  
Using Data ◽  
Academic Year ◽  
Source Of Information ◽  
Test Result

Graduation Information is important for Universitas Multimedia Nusantara  which engaged in education. The data of graduated students from each academic year is an important part as a source of information to make a decision for BAAK (Bureau of Academic and Student Administration). With this information, a prediction can be made for students who are still active whether they can graduate on time, fast, late or drop out with the implementation of data mining. The purpose of this study is to make a prediction of students’ graduation with C4.5 algorithm as a reference for making policies and actions of academic fields (BAAK) in reducing students who graduated late and did not pass. From the research, the category of IPS semester one to semester six, gender, origin of high school, and number of credits, can predict the graduation of students with conditions quickly pass, pass on time, pass late and drop out, using data mining with C4.5 algorithm. Category of semester six is the highly influential on the predicted outcome of graduation. With the application test result, accuracy of the graduation prediction acquired is 87.5%. Index Terms-Data mining, C4.5 algorithm, Universitas Multimedia Nusantara, prediction.

scholarly journals Application of Genetic Algorithm Elements to Modelling of Rotation Processes in Motion Transmission Including a Long Shaft

Energies ◽  
2020 ◽  
Vol 14 (1) ◽  
pp. 115
Author(s):  
Andriy Chaban ◽  
Marek Lis ◽  
Andrzej Szafraniec ◽  
Radoslaw Jedynak
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Fitness Function ◽  
Least Square ◽  
Distributed Parameter ◽  
Parameter Method ◽  
Analytical Mechanics ◽  
Parameter System ◽  
Rotational Systems ◽  
Elastic Elements

Genetic algorithms are used to parameter identification of the model of oscillatory processes in complicated motion transmission of electric drives containing long elastic shafts as systems of distributed mechanical parameters. Shaft equations are generated on the basis of a modified Hamilton–Ostrogradski principle, which serves as the foundation to analyse the lumped parameter system and distributed parameter system. They serve to compute basic functions of analytical mechanics of velocity continuum and rotational angles of shaft elements. It is demonstrated that the application of the distributed parameter method to multi-mass rotational systems, that contain long elastic elements and complicated control systems, is not always possible. The genetic algorithm is applied to determine the coefficients of approximation the system of Rotational Transmission with Elastic Shaft by equivalent differential equations. The fitness function is determined as least-square error. The obtained results confirm that application of the genetic algorithms allow one to replace the use of a complicated distributed parameter model of mechanical system by a considerably simpler model, and to eliminate sophisticated calculation procedures and identification of boundary conditions for wave motion equations of long elastic elements.

Minimization of total trim loss occurring in pipe cutting in shipbuilding with genetic algorithm

2021 ◽  
pp. 147509022199169
Author(s):  
Abdullah Türk ◽  
Dursun Saral ◽  
Murat Özkök ◽  
Ercan Köse
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Search Space ◽  
Cutting Process ◽  
Genetic Operators ◽  
Critical Stage ◽  
Different Types ◽  
Trim Loss ◽  
Pipe Systems

Outfitting is a critical stage in the shipbuilding process. Within the outfitting, the construction of pipe systems is a phase that has a significant effect on time and cost. While cutting the pipes required for the pipe systems in shipyards, the cutting process is usually performed randomly. This can result in large amounts of trim losses. In this paper, we present an approach to minimize these losses. With the proposed method it is aimed to base the pipe cutting process on a specific systematic. To solve this problem, Genetic Algorithms (GA), which gives successful results in solving many problems in the literature, have been used. Different types of genetic operators have been used to investigate the search space of the problem well. The results obtained have proven the effectiveness of the proposed approach.

Sign in / Sign up

Export Citation Format

Share Document