scholarly journals Optimasi Penjadwalan Ujian Tugas Akhir Dengan Menggunakan Algoritma Genetika

2021 ◽  
Vol 5 (1) ◽  
pp. 40-48
Author(s):  
Adi Panca Saputra Iskandar
Keyword(s):  
Roulette Wheel

Tugas Akhir merupakan salah satu persyaratan bagi mahasiswa STMIK STIKOM Indonesia untuk menyelesaikan studinya. Tugas Akhir memiliki dua tahapan yaitu proses seminar proposal dan sidang tugas akhir, untuk menyelesaikan tahapan tersebut tentunya pihak program studi harus membuat jadwal berlangsungnya tahapan tersebut. Permasalahan yang sering terjadi dalam kegiatan penjadwalan adalah terjadinya bentrok antara jadwal yang satu dengan yang lain, jadwal bentrok dengan kegiatan mengajar dosen sebagai pembimbing dan penguji . dan adanya permintaan waktu larangan dosen untuk menguji. Salah satu metode untuk menyelesaikan permasalahan tersebut dengan menggunakan algoritma genetika yang bekerja melalui seleksi alam dan genetika. Terdapat 8 prosedur algoritma genetika, Prosedur teknik pengkodean, populasi awal dan kromosom secara acak (random), fungsi fitness untuk meminimalkan jumlah bentrok antar jadwal, metode seleksi roulette-wheel, pindah silang, mutasi genetik, elitisme dan kondisi selesai bila iterasi maksimum telah tercapai. Hasil output dari sistem berupa susunan penjadwalan perkuliahan dan ujian akhir semester dalam format file PDF

Roulette Wheel Selection based Heuristic Algorithm for the Orienteering Problem

2014 ◽  
Vol 13 (1) ◽  
pp. 4127-4145
Author(s):  
Madhushi Verma ◽  
Mukul Gupta ◽  
Bijeeta Pal ◽  
Prof. K. K. Shukla
Keyword(s):  
Triangle Inequality ◽  
Time Budget ◽  
Control Point ◽  
Hamiltonian Path ◽  
Real Life ◽  
Tourism Industry ◽  
Orienteering Problem ◽  
Complete Graphs ◽  
Roulette Wheel Selection ◽  
Roulette Wheel

Orienteering problem (OP) is an NP-Hard graph problem. The nodes of the graph are associated with scores or rewards and the edges with time delays. The goal is to obtain a Hamiltonian path connecting the two necessary check points, i.e. the source and the target along with a set of control points such that the total collected score is maximized within a specified time limit. OP finds application in several fields like logistics, transportation networks, tourism industry, etc. Most of the existing algorithms for OP can only be applied on complete graphs that satisfy the triangle inequality. Real-life scenario does not guarantee that there exists a direct link between all control point pairs or the triangle inequality is satisfied. To provide a more practical solution, we propose a stochastic greedy algorithm (RWS_OP) that uses the roulette wheel selectionmethod, does not require that the triangle inequality condition is satisfied and is capable of handling both complete as well as incomplete graphs. Based on several experiments on standard benchmark data we show that RWS_OP is faster, more efficient in terms of time budget utilization and achieves a better performance in terms of the total collected score ascompared to a recently reported algorithm for incomplete graphs.

Self-adaptively Commensal Learning-based Jaya Algorithm with Multi-populations and its Application

2021 ◽  
Author(s):  
Zuanjia Xie ◽  
Chunliang Zhang ◽  
Haibin Ouyang ◽  
Steven Li ◽  
Liqun Gao
Keyword(s):  
Learning Strategy ◽  
Optimization Problems ◽  
State Of The Art ◽  
Global Optimum ◽  
Benchmark Problems ◽  
Series System ◽  
Jaya Algorithm ◽  
Roulette Wheel Selection ◽  
Roulette Wheel ◽  
Distribution Scheme

Abstract Jaya algorithm is an advanced optimization algorithm, which has been applied to many real-world optimization problems. Jaya algorithm has better performance in some optimization field. However, Jaya algorithm exploration capability is not better. In order to enhance exploration capability of the Jaya algorithm, a self-adaptively commensal learning-based Jaya algorithm with multi-populations (Jaya-SCLMP) is presented in this paper. In Jaya-SCLMP, a commensal learning strategy is used to increase the probability of finding the global optimum, in which the person history best and worst information is used to explore new solution area. Moreover, a multi-populations strategy based on Gaussian distribution scheme and learning dictionary is utilized to enhance the exploration capability, meanwhile every sub-population employed three Gaussian distributions at each generation, roulette wheel selection is employed to choose a scheme based on learning dictionary. The performance of Jaya-SCLMP is evaluated based on 28 CEC 2013 unconstrained benchmark problems. In addition, three reliability problems, i.e. complex (bridge) system, series system and series-parallel system are selected. Compared with several Jaya variants and several state-of-the-art other algorithms, the experimental results reveal that Jaya-SCLMP is effective.

scholarly journals An Improved Genetic Fuzzy Logic Control Method to Reduce the Enlargement of Coal Floor Deformation in Shearer Memory Cutting Process

2016 ◽  
Vol 2016 ◽  
pp. 1-14 ◽  
Author(s):  
Chao Tan ◽  
Rongxin Xu ◽  
Zhongbin Wang ◽  
Lei Si ◽  
Xinhua Liu
Keyword(s):  
Fuzzy Logic ◽  
Fuzzy Logic Control ◽  
Control Method ◽  
Improved Genetic Algorithm ◽  
Roulette Wheel Selection ◽  
Logic Control ◽  
Roulette Wheel ◽  
Manual Adjustment ◽  
Tangent Function ◽  
Memory Cutting

In order to reduce the enlargement of coal floor deformation and the manual adjustment frequency of rocker arms, an improved approach through integration of improved genetic algorithm and fuzzy logic control (GFLC) method is proposed. The enlargement of coal floor deformation is analyzed and a model is built. Then, the framework of proposed approach is built. Moreover, the constituents of GA such as tangent function roulette wheel selection (Tan-RWS) selection, uniform crossover, and nonuniform mutation are employed to enhance the performance of GFLC. Finally, two simulation examples and an industrial application example are carried out and the results indicate that the proposed method is feasible and efficient.

Sign in / Sign up

Export Citation Format

Share Document