Pengembangan Algoritma Genetika dengan Pendekatan Repetitive Random untuk Penjadwalan Ujian Pendadaran Proyek Tugas Akhir
(1) Universitas Teknologi Yogyakarta
(2) Universitas Teknologi Yogyakarta
(3) Universitas Teknologi Yogyakarta
(*) Corresponding Author
Abstrak
Kata Kunci
Teks Lengkap:
PDFReferensi
[1] O. I. Obaid, M. Ahmad, S. a Mostafa, and M. A. Mohammed, “Comparing Performance of Genetic Algorithm with Varying Crossover in Solving Examination Timetabling Problem,” J. Emerg. Trends Comput. Inf. Sci., vol. 3, no. 10, pp. 1427–1434, 2012.
[2] E. Suhartono, “OPTIMASI PENJADWALAN MATAKULIAH DENGAN ALGORITMA GENETIKA ( Studi Kasus di AMIK JTC Semarang ),” Infokam, vol. 11, no. 5, pp. 132–146, 2015.
[3] I. G. A. D. Saryanti and I. K. Wijanegara, “PENERAPAN METODE ALGORITMA GENETIKA UNTUK PENJADWALAN MENGAJAR,” J. SIMETRIS, vol. 8, no. 1, pp. 53–60, 2017.
[4] W. A. Puspaningrum, A. Djunaidy, and R. A. Vinarti, “Penjadwalan Mata Kuliah Menggunakan Algoritma Genetika di Jurusan Sistem Informasi ITS,” J. Tek. Pomits, vol. 2, no. 1, pp. 127–131, 2013.
[5] A. P. Wibowo and D. Avianto, “Penjadwalan Ujian Pendadaran Proyek Tugas Akhir Menggunakan Algoritme Genetika Dengan Repetitive Random Approach Final Project Examination Scheduling Using Genetic Algorithm with Repetitive Random Approach,” Pros. Semin. Ilm. Ilmu Komput. 2018 Mach. Learn. Agric. 4.0, pp. 61–70, 2018.
[6] K. Borna and V. H. Hashemi, “An Improved Genetic Algorithm With A Local Optimization Strategy and an Extra Mutation Level for Solving Traveling Salesman Problem,” Int. J. Comput. Sci. Eng. Inf. Technol., vol. 4, no. 4, pp. 47–53, 2014.
[7] O. S. Taiwo, O. O. Mayowa, and K. B. Ruka, “Application of Genetic Algorithm to Solve Traveling Salesman Problem,” Int. J. Adv. Res. IJOAR, vol. 1, no. 4, pp. 27–46, 2013.
[8] S. Szénási and Z. Vámossy, “Implementation of a distributed genetic algorithm for parameter optimization in a cell nuclei detection project,” Acta Polytech. Hungarica, vol. 10, no. 4, pp. 59–86, 2013.
[9] A. Sharma, R. Patani, and A. Aggarwal, “Software Testing Using Genetic Algorithms,” Int. J. Comput. Sci. Eng. Surv., vol. 7, no. 2, pp. 21–33, 2016.
[10]G. D. Mateescu, “On the Implementation and Use of a Genetic Algorithm with Genetic Acquisitions,” Rom. J. Econ. Forecast., vol. 13, no. 2, pp. 223–230, 2010.
[11]A. Brezulianu, L. Fira, and M. Fira, “A genetic algorithm approach for scheduling of resources in well-services companies,” IJARAI - Int. J. Adv. Res. Artif. Intell., vol. 1, no. 5, pp. 1–6, 2012.
[12]A. Johar, S. S. Jain, and P. K. Garg, “Transit network design and scheduling using genetic algorithm – a review,” An Int. J. Optim. Control Theor. Appl., vol. 6, no. 1, pp. 9–22, 2016.
[13]S. Kim, Y. Ko, S. Uhmn, and J. Kim, “A Strategy to Improve Performance of Genetic Algorithm for Nurse Scheduling Problem,” Int. J. Softw. Eng. Its Appl., vol. 8, no. 1, pp. 53–62, 2014.
[14]Y. Li and Y. Chen, “A genetic algorithm for job-shop scheduling,” J. Softw., vol. 5, no. 3, pp. 269–274, 2010.
[15]H. Nazif, “A Genetic Algorithm for Solving Scheduling Problem,” J. Math. Comput. Sci., vol. 5, no. 2, pp. 91–96, 2012.
[16]Z. Zukhri, Algoritma Genetika, Metode Komputasi Evolusioner untuk Menyelesaikan Masalah Optimasi. Yogyakarta: ANDI Publisher, 2014.
[17]Suyanto, Evolutionary Computation (komputasi Berbasis Evolusi Dan Genetika). Bandung, Indonesia: Informatika, 2012.
[18]E. K. Burke and S. Petrovic, “Recent Research Directions in Automated Timetabling,” Eur. J. Oper. Res., vol. 140, no. 2, pp. 266–280, 2002.
[19]N. K. Mawaddah and W. F. Mahmudy, “Optimasi Penjadwalan Perawat Menggunakan Algoritma Genetika,” Univ. Brawijaya, vol. 2, no. 2, pp. 1–8, 2006.
Artikel Statistik
PDF telah dilihat : 600 kali
Refbacks
- Saat ini tidak ada refbacks.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Alamat Redaksi : Departemen Sistem Informasi, Fakultas Teknologi Informasi Universitas Andalas Kampus Limau Manis, Padang 25163, Sumatera Barat email: teknosi@fti.unand.ac.id |
Jumlah Pengunjung :
This work by JSI-Unand and licensed under a CC BY-SA 4.0 International License.