Journal of Applied Sciences1812-56541812-5662Asian Network for Scientific Information10.3923/jas.2013.919.923AyobMasri Ahmad NazriMohd Zakree FeiYang Xiao 62013136This study implements three basic local search heuristics:
hill climbing (i.e., random descent), simulated annealing and multi-start simulated
annealing. The aim is to investigate the performance of these heuristics compared
to the state of art literatures. To achieve this, this study used a common software
interface (the HyFlex frame work), that are designed to enable the development,
testing and comparison of iterative general-purpose heuristic search algorithms.
To evaluate the performance of these heuristics, the algorithms are tested on
one dimensional bin packing instances using simple move operator. Results demonstrated
that hill climbing heuristic outperforms other approaches in all tested instances.
This indicates that simple local search is more effective in solving one dimensional
bin packing problems when the searcher is allowed to run in a short time.]]>Blum, C., M.J.B. Aguilera, A. Roli and M. Samples,2008Cook, S.A.,1971Dorigo, M. and L.M. Gambardella,1997Dowsland, K.A., E. Soubeiga and E. Burke,2007Hyde, M., G. Ochoa, J.A. Vazquez-Rodriguez and T. Curtois,2010Martello, S. and P. Toth,1990Ochoa, G., M. Hyde, T. Curtois, J.A. Vazquez-Rodriguez and J. Walker et al.,2012Reeves, C.R. and J.E. Rowe,2002Schreiber, G.R. and O.C. Martin,1999Talbi, E.G.,2009Wolpert, D.H. and W.G. Macready,1997