Ilahi, Sarah Maghfiroh (2019) Kontrol Optimal Model Penyebaran Rumor Dengan Optimalisasi Prmbobot Menggunakan Artificial Bee Colony. Masters thesis, Institut Teknologi Sepuluh Nopember.
|
Text
06111750012005-Master_Thesis.pdf Restricted to Repository staff only Download (2MB) | Request a copy |
Abstract
Rumor dideskripsikan sebagai penjelasan yang tidak terkonfirmasi kebenarannya dari hal-hal yang menarik publik, kejadian, atau masalah yang tersebar melalui berbagai media. Kepanikan yang dapat mengganggu stabilitas sosial dapat ditimbulkan oleh rumor. Model matematika penyebaran rumor berdasarkan perilaku individu terhadap rumor digunakan dalam tesis ini. Variabel kontrol berupa iklan layanan masyarakat dan informasi resmi ditambahkan dalam model tersebut. Pada model tanpa kontrol diperoleh dua titik kesetimbangan, yaitu rumor-free equlibrium (E_0) dan rumor-existence equilibrium (E_1). Berdasarkan kestabilan Routh-Hurwitz, titik E_0 dan E_1 stabil. Prinsip Minimum Pontryagin digunakan untuk memperoleh variabel kontrol u_1(t) dan u_2(t) yang optimal. Algoritma Artificial Bee Colony digunakan dalam pemilihan kombinasi konstanta pembobot agar diperoleh fungsi objektif yang optimal dengan cepat, karena pada umumnya pemilihan pembobot diperoleh melalui trial and error. Berdasarkan simulasi numerik, banyaknya individu penyebar rumor dapat diminimumkan dengan biaya yang dikeluarkan minimum melalui penambahan variabel kontrol. Iklan layanan masyarakat dan informasi resmi harus diberikan secara intensif dalam waktu yang lama untuk mendapatkan hasil yang efektif berdasarkan simulasi numerik. Informasi resmi lebih efektif daripada iklan layanan masyarakat dalam mengendalikan penyebar rumor karena informasi resmi dapat mengakibatkan penyebar rumor mengetahui kebenaran rumor.
=================================================================================================================================
Rumors are described as unconfirmed explanations of things that attract the public, events, or problems that are spread in various media. Panic that can disrupt social stability can be created by rumor. The mathematical model of rumors spreading based on individual attitudes towards rumors was used in this thesis. Control variables in the form of public service announcements and official information were added to the model. Two equilibrium points are obtained from the model without controller, namely rumor-free equlibrium (E_0) and rumor-existence equilibrium (E_1). Based on Routh-hurwitz stability, E_0 and E_1 are stable. Pontryagin Minimum Principle is used to obtain the optimal control variables u_1(t) and u_2(t). Artificial Bee Colony algorithm is used in selecting the combination of weights constant in order to obtain optimal objective function quickly, because in general the weight selection is obtained by trial and error. From numerical simulations, the amount of affected individuals can be minimized with minimum costs by adding control variables. Public service announcements must be given continuously for a long time in order to obtain effective results based on numerical simulations. Official information is more effective than public service announcement in controlling the spreaders of rumor because official information can make them to know the truth about the rumor.
| Item Type: | Thesis (Masters) |
|---|---|
| Uncontrolled Keywords: | Rumor, Model Matematika, Routh-Hurwitz, Prinsip Minimum Pontryagin, Algoritma Artificial Bee Colony |
| Subjects: | Q Science > QA Mathematics Q Science > QA Mathematics > QA278.3 Structural equation modeling. Q Science > QA Mathematics > QA402 System analysis. Q Science > QA Mathematics > QA76.9 Computer algorithms. Virtual Reality. Computer simulation. Q Science > QA Mathematics > QA9.58 Algorithms |
| Divisions: | Faculty of Mathematics and Science > Mathematics > 44101-(S2) Master Thesis |
| Depositing User: | Ilahi Sarah Maghfiroh |
| Date Deposited: | 23 Jul 2026 01:27 |
| Last Modified: | 23 Jul 2026 01:27 |
| URI: | http://repository.its.ac.id/id/eprint/67688 |
Actions (login required)
![]() |
View Item |
