Meta-heuristic techniques are important as they are used to find solutions to computationally intractable problems. Simplistic methods such as exhaustive search become computationally expensive and unreliable as the solution space for search algorithms increase. As no method is g...
Open access
Research Article10.9734/jamcs/2021/v36i530366
Combinatorial problems which have been proven to be NP-hard are faced in Higher Education Institutions and researches have extensively investigated some of the well-known combinatorial problems such as the timetabling and student project allocation problems. However, NP-hard prob...
Open access
Research Article10.9734/jamcs/2020/v35i730304
Timetabling is a problem faced in all higher education institutions. The International Timetabling Competition (ITC) has published a dataset that can be used to test the quality of methods used to solve this problem. A number of meta-heuristic approaches have obtained good result...
Open access
Research Article10.9734/BJMCS/2016/23143