Fachri Hidayah Maliki Saddam, - (2024) OPTIMISASI PENJADWALAN KERETA API JALUR GANDA MENGGUNAKAN MODEL JOB-SHOP DAN ALGORITMA SIMULATED ANNEALING. S1 thesis, Universitas Pendidikan Indonesia.
Abstract
Masalah penjadwalan kereta api merupakan kasus khusus dari masalah penjadwalan job-shop. Berdasarkan konsep penjadwalan job-shop, perjalanan kereta api dapat dianggap sebagai pekerjaan (job) yang akan dioperasikan pada suatu sumber daya (resource) yang berupa petak blok atau rel. Algortima Simulated Annealing diimplemetasikan untuk menyelesaikan masalah penjadwalan kereta api dengan rute Bandung – Padalarang. Langkah awal dari Algoritma Simulated Annealing adalah menghitung nilai objektif dari solusi awal yang dihasilkan dari data perjalanan kereta api rute Bandung – Padalarang. Selanjutnya Algoritma Simulated Annealing menghasilkan solusi tetangga dengan mengubah beberapa variabel pada solusi awal. Jika solusi tetangga memiliki nilai fungsi objektif yang lebih baik, maka solusi tersebut akan diterima sebagai solusi baru. Jika solusi tetangga memiliki nilai fungsi objektif yang lebih buruk, maka solusi tetangga masih dapat diterima dengan suatu probabilitas tertentu. Secara bertahap suhu akan diturunkan sampai diperoleh solusi optimal. Hasil implementasi menunjukkan bahwa Algoritma Simulated Annealing dapat menghasilkan jadwal perjalanan kereta api yang optimal dengan total waktu tempuh yang maksimum.
The train scheduling problem is a special case of job-shop scheduling problems. Based on the job-shop scheduling concept, train travel can be considered as the job that will be operated on some source power (resource) in the form of plot blocks or rails. This study aims to implement Simulated Annealing Algorithm in solving scheduling problems train on the Bandung – Padalarang routes. On the initial step. the algorithm will calculate objective value from the initial solution resulting from train travel data. The neighbor solution is generated by changing a number of variables from the initial solution. If the neighbor solution has a better objective value, then the solution will be accepted as new solution. If the neighbor solution objective functional value is not worse, then the neighbor solution still can be accepted with a certain probability. The temperature will be reduced gradually until the optimal solution is obtained. Th implementation results show that Simulated Annealing Algorithm can generate optimal for train schedule with the maximum total time travel.
![[thumbnail of S_MAT_2006263_TITLE.pdf]](http://repository.upi.edu/style/images/fileicons/text.png "S_MAT_2006263_TITLE.pdf") |
Text
S_MAT_2006263_TITLE.pdf Download (622kB) |
|
Text
S_MAT_2006263_Chapter1.pdf Download (230kB) |
|
Text
S_MAT_2006263_Chapter2.pdf Restricted to Staf Perpustakaan Download (285kB) | Request a copy |
|
Text
S_MAT_2006263_Chapter3.pdf Download (597kB) |
|
Text
S_MAT_2006263_Chapter4.pdf Restricted to Staf Perpustakaan Download (504kB) | Request a copy |
|
Text
S_MAT_2006263_Chapter5.pdf Download (175kB) |
|
Text
S_MAT_2006263_Appendix.pdf Restricted to Staf Perpustakaan Download (1MB) | Request a copy |
| Item Type: | Thesis (S1) |
|---|---|
| Additional Information: | https://scholar.google.com/citations?hl=en&user=p95wi_4AAAAJ ID SINTA Dosen Pembimbing: Khusnul Novianingsih: 258640 Sumanang Muhtar Gozali: 6121808 |
| Uncontrolled Keywords: | Penjadwalan kereta api, Optimisasi, job-shop, Simulated Annealing Train scheduling, Optimization, job-shop, Simulated Annealing |
| Subjects: | Q Science > Q Science (General) Q Science > QA Mathematics Q Science > QA Mathematics > QA76 Computer software |
| Divisions: | Fakultas Pendidikan Matematika dan Ilmu Pengetahuan Alam > Program Studi Matematika - S1 > Program Studi Matematika (non kependidikan) |
| Depositing User: | Fachri Hidayah Maliki Saddam |
| Date Deposited: | 20 Aug 2024 14:16 |
| Last Modified: | 20 Aug 2024 14:16 |
| URI: | http://repository.upi.edu/id/eprint/120453 |
Actions (login required)
 |
View Item |