Abstract: The basic gravitational search algorithm (GSA) could fall into local optima solution easily, and thus we proposed a hybrid gravitational search algorithm (HGSA) in order to overcome the ...
Abstract: The timetabling problem, a well-known NP-Hard optimization challenge, spans multiple domains such as education, healthcare, sports, and transportation. Due to its computational complexity, ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results