Submit Manuscript

Journal of Applied Sciences

Year: 2013 | Volume: 13 | Issue: 6 | Page No.: 919-923
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Article Trend

Total views 514

Search

Authors

Masri Ayob

Mohd Zakree Ahmad Nazri

Yang Xiao Fei

Keywords

Research Article

Local Search Heuristics for the One Dimensional Bin Packing Problems

Masri Ayob, Mohd Zakree Ahmad Nazri and Yang Xiao Fei
This 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.
PDF Fulltext XML References Citation

Leave a Comment

Your email address will not be published. Required fields are marked *