Hybrid Simulated Annealing with Meta-Heuristic Methods to Solve UCT Problem


  •  Issam AlHadid    
  •  Khalid Kaabneh    
  •  Hassan Tarawneh    

Abstract

Simulated Annealing (SA) is a common meta-heuristic algorithm that has been widely used to solve complex optimization problems. This work proposes a hybrid SA with EMC to divert the search effectively to another promising region. Moreover, a Tabu list memory applied to avoid cycling. Experimental results showed that the solution quality has enhanced using SA-EMCQ by escaping the search space from local optimum to another promising region space. In addition, the results showed that our proposed technique has outperformed the standard SA and gave comparable results to other approaches in the literature when tested on ITC2007-Track3 university course timetabling datasets.


This work is licensed under a Creative Commons Attribution 4.0 License.
  • ISSN(Print): 1913-1844
  • ISSN(Online): 1913-1852
  • Started: 2007
  • Frequency: monthly

Journal Metrics

(The data was calculated based on Google Scholar Citations)

h-index (January 2018): 30

i10-index (January 2018): 163

h5-index (January 2018): 19

h5-median(January 2018): 25

Contact