期刊名称：International Journal of Advanced Computer Science and Applications(IJACSA)
印刷版ISSN：2158-107X
电子版ISSN：2156-5570
出版年度：2019
卷号：10
期号：9
DOI：10.14569/IJACSA.2019.0100955
出版社：Science and Information Society (SAI)
摘要：A noticeable objective of this work is to experiment and test an optimization problem through comparing hill-climbing method with a hybrid method combining hill-climbing and Latin-hyper-cube. These two methods are going to be tested operating the same data-set in order to get the comparison result for both methods. The result shows that the hybrid model has a better performance than hill-climbing. Based on the number of global optimum value occurrence, the hybrid model outperformed 7.6% better than hill-climbing, and produced more stable average global optimum value. However, the model has a little longer running time due to a genuine characteristic of the model itself.
