Abstract
Abstract Arranging an optimal curriculum at universities is a difficult problem to be resolved with multiple constraints. The arrangement of the curriculum can be divided into two sub issues: curriculum evaluation and curriculum scheduling. Each sub issue is concerned with its own multiple parameters. Traditional linear programming methods do not obtain satisfactory results with this complex problem. This study developed a methodology by utilizing genetic algorithms, a promising tool for solving complex optimization problems to deal with multiple constraints. The results of this study indicated that the methodology was feasible and there was a significant reduction in the amount of time required for arranging the optimal curriculum.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
