scholarly journals Kajian Algoritma Optimasi Penjadwalan Mata Kuliah

Petir ◽  
2020 ◽  
Vol 13 (2) ◽  
pp. 212-222
Author(s):  
Tri Handayani ◽  
Dhomas Hatta Fudholi ◽  
Septia Rani
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Google Scholar ◽  
School Scheduling ◽  
Timetable Problem

Penjadwalan mata kuliah merupakan hal penting yang dilakukan pada awal semester akademik. Proses penyusunan jadwal kuliah secara manual seringkali mengalami kesulitan karena terdapat beberapa konstrain sehingga membutuhkan waktu yang lama. Penelitian ini bertujuan mengkaji algoritma-algoritma yang sesuai dengan masalah penjadwalan mata kuliah. Pencarian dan analisis dilakukan terhadap literatur yang berkaitan dengan optimasi penjadwalan. Proses pencarian literatur dilakukan pada Google Scholar dan Science Direct dengan memasukkan kata kunci utama “course timetable”, “university timetable problem”, “school scheduling”, dan “algoritma penjadwalan”. Hasil analisis literatur meliputi sebaran domain, analisis algoritma serta gap dari penelitian sebelumnya. Pada penelitian sebelumnya terdapat kekurangan seperti algoritma yang tidak dapat menghasilkan solusi optimal. Hasil sebaran domain yang diperoleh ialah universitas dan sekolah dengan persentase 88% dan 12% dari keseluruhan makalah. Adanya temuan 14 sebaran algoritma dapat diklasifikasikan menjadi 3 metode, yaitu heuristic, metaheuristic, dan hyper-heuristic. Berdasarkan hasil analisis, dapat diberikan beberapa rekomendasi. Untuk optimasi yang cepat, Simulated Annealing (SA) dapat menjadi solusi karena mampu menghasilkan solusi dengan waktu 0.481-10.102s. Untuk solusi waktu dan nilai fitness terbaik, Genetic Algorithm (GA) dapat menjadi solusi karena mampu menghasilkan solusi dengan waktu 0.964-73.461s dan nilai fitness 1.

scholarly journals Multi-user Remote Lab: Timetable Scheduling Using Simplex Nondominated Sorting Genetic Algorithm

2021 ◽  
Vol 2 (2) ◽  
pp. 1-13
Author(s):  
Seid Miad Zandavi ◽  
Vera Chung ◽  
Ali Anaissi
Keyword(s):  
Genetic Algorithm ◽  
Optimization Algorithm ◽  
Heuristic Algorithms ◽  
Simplex Algorithm ◽  
Local Optimum ◽  
Hybrid Optimization Algorithm ◽  
Multimodal Function ◽  
Remote Laboratories ◽  
Remote Lab ◽  
Timetable Problem

The scheduling of multi-user remote laboratories is modeled as a multimodal function for the proposed optimization algorithm. The hybrid optimization algorithm, hybridization of the Nelder-Mead Simplex algorithm, and Non-dominated Sorting Genetic Algorithm (NSGA), named Simplex Non-dominated Sorting Genetic Algorithm (SNSGA), is proposed to optimize the timetable problem for the remote laboratories to coordinate shared access. The proposed algorithm utilizes the Simplex algorithm in terms of exploration and NSGA for sorting local optimum points with consideration of potential areas. SNSGA is applied to difficult nonlinear continuous multimodal functions, and its performance is compared with hybrid Simplex Particle Swarm Optimization, Simplex Genetic Algorithm, and other heuristic algorithms. The results show that SNSGA has a competitive performance to address timetable problems.

Parallel recombinative simulated annealing: A genetic algorithm

1995 ◽  
Vol 21 (1) ◽  
pp. 1-28 ◽  
Author(s):  
Samir W. Mahfoud ◽  
David E. Goldberg
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing

Memetic Algorithm Approach to Two-Stage Hybrid Flow Shop Scheduling Problem with Identical Parallel Machines

2013 ◽  
Vol 651 ◽  
pp. 548-552
Author(s):  
Parinya Kaweegitbundit
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Parallel Machines ◽  
Flow Shop ◽  
Memetic Algorithm ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Scheduling Problems ◽  
Two Stage ◽  
Hybrid Flow Shop Scheduling

This paper considers two stage hybrid flow shop (HFS) with identical parallel machine. The objectives is to determine makespan have been minimized. This paper presented memetic algorithm procedure to solve two stage HFS problems. To evaluated performance of propose method, the results have been compared with two meta-heuristic, genetic algorithm, simulated annealing. The experimental results show that propose method is more effective and efficient than genetic algorithm and simulated annealing to solve two stage HFS scheduling problems.

Short Term Electric Load Forecasting with Back Propagation Neural Network and Simulated Annealing Genetic Algorithm

2015 ◽  
Vol 785 ◽  
pp. 14-18 ◽  
Author(s):  
Badar ul Islam ◽  
Zuhairi Baharudin ◽  
Perumal Nallagownden
Keyword(s):  
Neural Network ◽  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Hybrid Approach ◽  
Back Propagation ◽  
Forecast Accuracy ◽  
Back Propagation Neural Network ◽  
Search Performance ◽  
Training Algorithm ◽  
Short Term

Although, Back Propagation Neural Network are frequently implemented to forecast short-term electricity load, however, this training algorithm is criticized for its slow and improper convergence and poor generalization. There is a great need to explore the techniques that can overcome the above mentioned limitations to improve the forecast accuracy. In this paper, an improved BP neural network training algorithm is proposed that hybridizes simulated annealing and genetic algorithm (SA-GA). This hybrid approach leads to the integration of powerful local search capability of simulated annealing and near accurate global search performance of genetic algorithm. The proposed technique has shown better results in terms of load forecast accuracy and faster convergence. ISO New England data for the period of five years is employed to develop a case study that validates the efficacy of the proposed technique.

Sign in / Sign up

Export Citation Format

Share Document