mlsanityData to 14 Oct 2026

A Hybrid Evolutionary Approach to Solve University Course Allocation Problem

arXiv 2212.02230 ↗First posted 15 Nov 2022cs.NE cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

This paper discusses various types of constraints, difficulties and solutions to overcome the challenges regarding university course allocation problem. A hybrid evolutionary algorithm has been defined combining Local Repair Algorithm and Modified Genetic Algorithm to generate the best course assignment. After analyzing the collected dataset, all the necessary constraints were formulated. These constraints manage to cover the aspects needed to be kept in mind while preparing clash free and efficient class schedules for every faculty member. The goal is to generate an optimized solution which will fulfill those constraints while maintaining time efficiency and also reduce the workload of handling this task manually. The proposed algorithm was compared with some base level optimization algorithms to show the better efficiency in terms of accuracy and time.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 0 of its 14 references that are in the map. First posted on arXiv 15 Nov 2022.

Builds on

0 of 14 references.

No references here yet.

Built on by

Not cited yet.