Learn More
The proposed system presents a novel approach of solving University timetabling which is NP-hard problem using Genetic Algorithm. Genetic Algorithm is frequently deployed Meta heuristics algorithm which can be effectively used to difficult combinatorial optimization problems. Although, there has been an extensive research towards this field but majority of(More)
Due to increasing population, and human activities on land to meet various demands , land uses are being continuously changed without a clear and logical planning with any attention to their long term environmental impacts. Thus affecting the natural balance of the environment, in the form of global warming, soil degradation, loss of biodiversity, air and(More)
The graph partitioning problem has numerous applications in various scientific fields. It usually involves the effective partitioning of a graph into a number of disjoint sub-graphs/zones, and hence becomes a combinatorial optimization problem whose worst case complexity is NP-complete. The inadequacies of exact methods, like linear and integer programming(More)