Algoritma Berkebarangkalian dalam Pengoptimuman

Siska Candra Ningsih, Yosza Dasril, Ismail Mohd

Abstract



Makalah ini akan membincangkan keberkesanan algoritma berkebarangkalian dalam menentukan titik optimum masalah pengoptimuman sejagat. Ujian kerawakan dan kenormalan telah digunakan untuk mengesahkan bahawa masalah pengoptimuman yang dipertimbangkan adalah satu proses Wiener. Selanjutnya, diberikan dua contoh berangka dengan nilai gamma yang berbeza untuk melihat keberkesanan algoritma tersebut.

This article discusses the efficiency of the probabilistic algorithm for determining the optimal point of global optimization problems. Randomness and normality tests were conducted to verify that the optimization problem constitutes a Wiener process. Furthermore, two numerical examples are given with different gamma values to illustrate the efficiency of the algorithm.

keywords: Optimization; Wiener process; probabilistic

Full Text:

PDF


DOI: https://doi.org/10.11113/matematika.v21.n.523

Refbacks

  • There are currently no refbacks.


UTM Logo

Copyright © 2016 Penerbit UTM Press, Universiti Teknologi Malaysia

Disclaimer: This website has been updated to the best of our knowledge to be accurate. However, Universiti Teknologi Malaysia shall not be liable for any loss or damage caused by the usage of any information obtained from this web site.

Best viewed: Mozilla Firefox 4.0 & Google Chrome at 1024 × 768 resolution.