Abstract: To solve large-scale and hard constraint satisfaction problems (CSPs), ant colony optimization (ACO) has been studied as one of the metaheuristics. Lévy ACO, which incorporates Lévy Flight ...
Abstract: University Course Timetabling Problem (UCTP) belongs to Constraint Satisfaction Problems (CSPs), which are the set of objects whose state must satisfy a number of constraints. The ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback