Muhaddad, Risal Arsyad (2014) Pengembangan Algoritma Simulated Annealing Untuk Penyelesaian Permasalahan Alokasi Pada Closed Loop Supply Chain (CLSC). Undergraduate thesis, Institut Technology Sepuluh Nopember.
Preview |
Text
2510100127-Undergraduate Thesis.pdf - Published Version Download (1MB) | Preview |
Abstract
Dalam beberapa dekade ini, supply chain management menjadi sebuah kebutuhan mendasar bagi perusahaan. Di Indonesia sendiri, strategi mengenai supply chain management masih terus dikembangkan. Perkembangan supply chain management memunculkan model berupa Closed Loop Supply Chain (CLSC) yaitu penggabungan antara forward logistics dan reverse logistics yang memberikan dampak positif untuk perusahaan, salah satunya penghematan bahan baku. Namun untuk mencari solusi optimal dari alokasi CLSC yang continues dan kompleks menggunakan metode eksak akan memakan waktu yang banyak karena permasalahan CLSC termasuk dalam permasalahan NP-hard, sehingga dibutuhkan penyelesaian dengan metode metaheuristik. Metode metaheuristik yang dapat digunakan adalah Simulated Annealing. Simulated Annealing sendiri memiliki kelebihan yaitu waktu komputasi yang lebih cepat dan tidak mudah terjebak pada local optimal karena menggunakan probabilitas Boltzmann. Dalam penelitian tugas akhir ini akan dikembangkan model pada CLSC, algoritma Simulated Annealing dan Simulated Annealing-Tabu Search yang diterapkan untuk permasalahan alokasi pada CLSC, sehingga menghasilkan kode program untuk Simulated Annealing dan Simulated Annealing-Tabu Search dalam menyelesaikan permasalahan alokasi pada CLSC. Dalam penelitian ini terbukti bahwa Simulated Annealing-Tabu Search menghasilkan hasil yang lebih baik dibandingkan dengan Simulated Annealing.
==========================================================================================================
In the last coupe decades, supply chain management has become a fundamental managerial aspects need to be considered by a company to succeed. In Indonesia, studies related to supply chain management have been popular among scholars and researchers. One of developments emerged in this field is closed loop supply chain (CLSC), which is a combination of forward logistics and reverse logistics. Raw material reduction is one of positive impacts brought by the application of this concept, among many others. However, to find the optimal solution from continuous and complex allocation problem in CLSC, for instance, requires a tremendous amount of time due to its NP-Hard characteristic. Therefore, a metaheuristics method needs to be applied to solve this issue. While there are many methods available, Simulated Annealing has its own advantages among others to provide shorter computation time and its ability to hinder from local optimum as it uses Boltzmann probability in its procedure. In this study, Simulated Annealing and Simulated Annealing -Tabu Search model will be deployed on CLSC allocation problem. This will generate a sequence of codes capable to utilize Simulated Annealing and Simulated Annealing - Tabu Search algorithms to solve a CLSC allocation problem. The results suggest that Simulated Annealing - Tabu Search generates a better solution compared to Simulated Annealing.
| Item Type: | Thesis (Undergraduate) |
|---|---|
| Additional Information: | RSI 658.7 Muh p |
| Uncontrolled Keywords: | Alokasi, Closed Loop Supply Chain, Metaheuristik, Simulated Annealing. |
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Faculty of Industrial Technology > Industrial Engineering > 26201-(S1) Undergraduate Thesis |
| Depositing User: | Mr. Tondo Indra Nyata |
| Date Deposited: | 10 Jul 2019 03:03 |
| Last Modified: | 10 Jul 2019 03:05 |
| URI: | http://repository.its.ac.id/id/eprint/63783 |
Actions (login required)
 |
View Item |