scholarly journals Modifikasi Algoritma Genetika untuk Penyelesaian Permasalahan Penjadwalan Pelajaran Sekolah

2014 ◽  
Vol 10 (1) ◽  
pp. 111
Author(s):  
Rahman Erama ◽  
Retantyo Wardoyo
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Effective Algorithm ◽  
Scheduling Problems ◽  
The Core ◽  
Alternative Algorithm ◽  
Crossover Phase ◽  
School Scheduling ◽  
Core Problem ◽  
Standard Genetic Algorithm

AbstrakModifikasi Algoritma Genetika pada penelitian ini dilakukan berdasarkan temuan-temuan para peneliti sebelumnya tentang kelemahan Algoritma Genetika. Temuan-temuan yang dimakasud terkait proses crossover sebagai salah satu tahapan terpenting dalam Algoritma Genetika dinilai tidak menjamin solusi yang lebih baik oleh beberapa peneliti. Berdasarkan temuan-temuan oleh beberapa peneliti sebelumnya, maka penelitian ini akan mencoba memodifikasi Algoritma Genetika dengan mengeliminasi proses crossover yang menjadi inti permasalahan dari beberapa peneliti tersebut. Eliminasi proses crossover ini diharapkan melahirkan algoritma yang lebih efektif sebagai alternative untuk penyelesaian permasalahan khususnya penjadwalan pelajaran sekolah.Tujuan dari penelitian ini adalah Memodifikasi Algoritma Genetika menjadi algoritma alternatif untuk menyelesaikan permasalahan penjadwalan sekolah, sehingga diharapkan terciptanya algoritma alternatif ini bisa menjadi tambahan referensi bagi para peneliti untuk menyelesaikan permasalahan penjadwalan lainnya.Algoritma hasil modifikasi yang mengeliminasi tahapan crossover pada algoritma genetika ini mampu memberikan performa 3,06% lebih baik dibandingkan algoritma genetika sederhana dalam menyelesaikan permasalahan penjadwalan sekolah. Kata kunci—algoritma genetika, penjadwalan sekolah, eliminasi crossover  AbstractModified Genetic Algorithm in this study was based on the findings of previous researchers about the weakness of Genetic Algorithms. crossover as one of the most important stages in the Genetic Algorithms considered not guarantee a better solution by several researchers. Based on the findings by previous researchers, this research will try to modify the genetic algorithm by eliminating crossover2 which is the core problem of several researchers. Elimination crossover is expected to create a more effective algorithm as an alternative to the settlement issue in particular scheduling school.This study is intended to modify the genetic algorithm into an algorithm that is more effective as an alternative to solve the problems of school scheduling. So expect the creation of this alternative algorithm could be an additional resource for researchers to solve other scheduling problems.Modified algorithm that eliminates the crossover phase of the genetic algorithm is able to provide 2,30% better performance than standard genetic algorithm in solving scheduling problems school. Keywords—Genetic Algorithm, timetabling school, eliminate crossover

scholarly journals Utilizing Model Knowledge for Design Developed Genetic Algorithm to Solving Problem

2018 ◽  
Vol 3 (2) ◽  
pp. 172
Author(s):  
Hamidreza Salmani mojaveri
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Parallel Machines ◽  
Job Shop ◽  
Optimization Problems ◽  
Premature Convergence ◽  
Local Optimum ◽  
Scheduling Problems ◽  
Algorithm Implementation

One of the discussed topics in scheduling problems is Dynamic Flexible Job Shop with Parallel Machines (FDJSPM). Surveys show that this problem because of its concave and nonlinear nature usually has several local optimums. Some of the scheduling problems researchers think that genetic algorithms (GA) are appropriate approach to solve optimization problems of this kind. But researches show that one of the disadvantages of classical genetic algorithms is premature convergence and the probability of trap into the local optimum. Considering these facts, in present research, represented a developed genetic algorithm that its controlling parameters change during algorithm implementation and optimization process. This approach decreases the probability of premature convergence and trap into the local optimum. The several experiments were done show that the priority of proposed procedure of solving in field of the quality of obtained solution and convergence speed toward other present procedure.

scholarly journals Lecture Scheduling Automation Using Genetic Algorithm

2019 ◽  
Vol 8 (5C) ◽  
pp. 1444-1447
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Test Results ◽  
Scheduling Problems ◽  
Scheduling System ◽  
Parameter Values

This paper aims produce an academic scheduling system using Genetic Algorithm (GA) to solve the academic schedule. Factors to consider in academic scheduling are the lecture to be held, the available room, the lecturers and the time of the lecturer, the suitability of the credits with the time of the lecture, and perhaps also the time of Friday prayers, and so forth. Genetic Algorithms can provide the best solution for some solutions in dealing with scheduling problems. Based on the test results, the resulting system can automate the scheduling of lectures properly. Determination of parameter values in Genetic Algorithm also gives effect in producing the solution of lecture schedule

scholarly journals A Genetic Algorithm-Based Approach for Composite Metamorphic Relations Construction

Information ◽  
2019 ◽  
Vol 10 (12) ◽  
pp. 392
Author(s):  
Zhenglong Xiang ◽  
Hongrun Wu ◽  
Fei Yu
Keyword(s):  
Genetic Algorithm ◽  
Empirical Studies ◽  
High Quality ◽  
Testing Technique ◽  
Metamorphic Testing ◽  
The Core ◽  
Test Oracle ◽  
Detection Capabilities ◽  
Optimal Set ◽  
Core Problem

The test oracle problem exists widely in modern complex software testing, and metamorphic testing (MT) has become a promising testing technique to alleviate this problem. The inference of efficient metamorphic relations (MRs) is the core problem of metamorphic testing. Studies have proven that the combination of simple metamorphic relations can construct more efficient metamorphic relations. In most previous studies, metamorphic relations have been mainly manually inferred by experts with professional knowledge, which is an inefficient technique and hinders the application. In this paper, a genetic algorithm-based approach is proposed to construct composite metamorphic relations automatically for the program to be tested. We use a set of relation sequences to represent a particular class of MRs and turn the problem of inferring composite MRs into a problem of searching for suitable sequences. We then dynamically implement multiple executions of the program and use a genetic algorithm to search for the optimal set of relation sequences. We conducted empirical studies to evaluate our approach using scientific functions in the GNU scientific library (abbreviated as GSL). From the empirical results, our approach can automatically infer high-quality composite MRs, on average, five times more than basic MRs. More importantly, the inferred composite MRs can increase the fault detection capabilities by at least 30 % more than the original metamorphic relations.

Penjadwalan Produksi Dengan Algoritma Genetik Untuk Meniminisasi Makespan di PT AAA

2019 ◽  
Vol 2 (2) ◽  
Author(s):  
M. Ghassan Fattah ◽  
Rosnani Ginting
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Natural Selection ◽  
Machine Scheduling ◽  
Optimal Timing ◽  
Scheduling Problems ◽  
Fitness Value ◽  
Genetic Algorithm Method

PT. AAA dari bulan Januari sampai Desember mendapat total 88 order dengan jumlah keterlambatan 12 order maka persentase keterlembatan adalah 13,63%. Tujuan penelitian ini adalah untuk merancangan penerapan algoritma genetik yang dapat menghindari keterlambatan order yaitu untuk mengukur makespan produk dan merancang urutan penjadwalan mesin. Penyelesaian masalah penjadwakan dengan algoritma genetik. Algoritma genetik merupakan teknik search stochastic yang berdasarkan mekanisme seleksi alam dan genetika natural dengan melakukan proses inisialisasi awal lalu dicari nilai fitness dari setiap individu, yang akan menjadi induk adalah yang memiliki nilai fitness terbaik lalu dilakukan proses penyilangan dan mutasi dan pemilihan waktu optimal. Dari hasil perhitungan dengan menggunakan metode Algoritma Genetika diperoleh urutan penjadwalan mesin terbaik dan dengan nilai makespan terkecil.   PT. AAA from January to December received a total of 88 orders with the number of delays of 12 orders, the percentage of bridges was 13.63%. The purpose of this study is to design the application of a genetic algorithm that can avoid delay in order to measure product makespan and design the order of machine scheduling. Resolving scheduling problems with genetic algorithms. Genetic algorithm is a search stochastic technique that is based on the mechanism of natural selection and natural genetics by carrying out the initial initialization process and then looks for the fitness value of each individual, who will be the parent who has the best fitness value and then the process of crossing and mutation and optimal timing. From the results of calculations using the Genetic Algorithm method, the best sequence of machine scheduling is obtained and with the smallest makespan value.

A Genetic Engineering Approach to Genetic Algorithms

2001 ◽  
Vol 9 (1) ◽  
pp. 71-92 ◽  
Author(s):  
John S. Gero ◽  
Vladimir Kazakov
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Genetic Engineering ◽  
Genetic Material ◽  
Evolutionary Process ◽  
Automatic Generation ◽  
Engineering Approach ◽  
Standard Genetic Algorithm

We present an extension to the standard genetic algorithm (GA), which is based on concepts of genetic engineering. The motivation is to discover useful and harmful genetic materials and then execute an evolutionary process in such a way that the population becomes increasingly composed of useful genetic material and increasingly free of the harmful genetic material. Compared to the standard GA, it provides some computational advantages as well as a tool for automatic generation of hierarchical genetic representations specifically tailored to suit certain classes of problems.

scholarly journals SCHEDULING USING GENETIC ALGORITHM AND ROULETTE WHEEL SELECTION METHOD CONSIDERING LECTURER TIME

2019 ◽  
Vol 2 (1) ◽  
pp. 24
Author(s):  
Herman Herman ◽  
Lukman Syafie ◽  
Irawati Irawati ◽  
Lilis Nur Hayati ◽  
Harlinda Harlinda
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Computer Science ◽  
Selection Method ◽  
Scheduling Problems ◽  
Scheduling System ◽  
Roulette Wheel Selection ◽  
Roulette Wheel

Scheduling lectures is not something easy, considering many factors that must be considered. The factors that must be considered are the courses that will be held, the space available, the lecturers, the suitability of the credits with the duration of courses, the availability of lecturers' time, and so on. One algorithm in the field of computer science that can be used in lecture scheduling automation is Genetic Algorithms. Genetic Algorithms can provide the best solution from several solutions in handling scheduling problems and the selksi method used is roulette wheel. This study produces a scheduling system that can work automatically or independently which can produce optimal lecture schedules by applying Genetic Algorithms. Based on the results of testing, the resulting system can schedule lectures correctly and consider the time of lecturers. In this study, the roulette wheel selection method was more effective in producing the best individuals than the rank selection method.

SYMBIOTIC EVOLUTIONARY ALGORITHM, A REMEDY FOR LINKAGE PROBLEM

2009 ◽  
Vol 08 (03) ◽  
pp. 237-252 ◽  
Author(s):  
RAMIN HALAVATI ◽  
SAEED BAGHERI SHOURAKI
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Combinatorial Optimization ◽  
Domain Knowledge ◽  
Evolutionary Adaptation ◽  
Success Rates ◽  
Sexual Recombination ◽  
Standard Genetic Algorithm ◽  
Adaptation Model ◽  
Symbiotic Evolutionary Algorithm

Recombination in Genetic Algorithms (GA) is supposed to extract the component characteristics from two parents and reassemble them in different combinations, hopefully producing an offspring that has the good characteristics of both parents, and this requires explicit chromosome and recombination, operator by design. This paper presents a novel evolutionary approach based on symbiogenesis which uses symbiotic combination instead of sexual recombination, and by using this operator, it requires no domain knowledge for chromosome or combination operator design. The algorithm is benchmarked on three problem sets: combinatorial optimization category, deceptive problems, and fully deceptive problems. The results, compared with that of standard genetic algorithm and symbiotic evolutionary adaptation model, show higher success rates and faster results.

scholarly journals Penyelesaian Masalah Penjadwalan Job-Majemuk dengan Pemakaian Sumberdaya- Majemuk Menggunakan Algoritma Genetika

2012 ◽  
Vol 1 (2) ◽  
pp. 77
Author(s):  
Taufiq Aji
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Production Planning ◽  
Optimization Problem ◽  
Hospital Management ◽  
Scheduling Problems ◽  
Lagrange Relaxation ◽  
Wide Range ◽  
Different Types ◽  
Reservation System

Scheduling problems with regard to the problem of determining the order to carry out a number of tasks. This issue covers a wide range of areas such as manufacturing, installation project, production planning, hospital management and reservation system. This problem can be seen as an optimization problem of dealing with a number of constraints. An increase in the complexity of the problem requires the existence of an efficient and effective techniques. This study addresses the issue of scheduling multiple job-where there are several different types of resources that are working on an operation or activity simultaneously. Genetic algorithms are developed to solve these problems. Genetic algorithm testing performed against a number of hipotetik example. The output agoritma of genetics compared against optimal technique of the output and the output algorithm based on Lagrange relaxation on the same issue. The results of the comparison with optimal techniques and algorithms based on Lagrange relaxation indicates a significant improvement of computing efficiency, but nevertheless occur a little decrease in effectiveness.

Optimization of Genetic Operators for Scheduling Problems

2007 ◽  
Vol 11 (9) ◽  
pp. 1092-1098 ◽  
Author(s):  
António Ferrolho ◽  
◽  
Manuel Crisóstomo ◽  
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Job Scheduling ◽  
Software Tool ◽  
Scheduling Problems ◽  
Genetic Operators ◽  
Mutation Operators ◽  
Crossover And Mutation

Genetic algorithms (GA) can provide good solutions for scheduling problems. But, when a GA is applied to scheduling problems various crossovers and mutations operators can be applicable. This paper presents and examines a new concept of genetic operators for scheduling problems. A software tool called hybrid and flexible genetic algorithm (HybFlexGA) was developed to examine the performance of various crossover and mutation operators by computing simulations of job scheduling problems.

GENETIC ALGORITHMS, FLOATING POINT NUMBERS AND APPLICATIONS

2005 ◽  
Vol 16 (11) ◽  
pp. 1811-1816 ◽  
Author(s):  
YORICK HARDY ◽  
WILLI-HANS STEEB ◽  
RUEDI STOOP
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Linear Equations ◽  
Floating Point ◽  
The Core ◽  
Point Number ◽  
Floating Point Number ◽  
Roots Of Polynomials ◽  
Bitwise Operations ◽  
Floating Point Numbers

The core in most genetic algorithms is the bitwise manipulations of bit strings. We show that one can directly manipulate the bits in floating point numbers. This means the main bitwise operations in genetic algorithm mutations and crossings are directly done inside the floating point number. Thus the interval under consideration does not need to be known in advance. For applications, we consider the roots of polynomials and finding solutions of linear equations.

Sign in / Sign up

Export Citation Format

Share Document