Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/302666
Title: Hybrid Metaheuristic Algorithms for Highly Constrained Combinatorial Optimization Problems
Researcher: Sanjeev Kumar
Guide(s): Rakesh Pandey
Keywords: Computer Science
Engineering and Technology
Operations Research and Management Science
University: ICFAI University, Dehradun Uttarakhand
Completed Date: 2020
Abstract: In this thesis a study has been devoted in the field of Timetable Scheduling problems and more explicitly University Course Timetabling Problems (UCTP). The study exposed that these course timetabling problems are highly challenging and lie in NP class problems domain, therefore no algorithm or approach exists which can solve these problems in polynomial time span. An approach found to solve one type will not achieve the same success for another type and hence they are solved differently from each other. Further, for each of the problem types, this also extends to each problem instances can differ extremely in terms of dimensions and constraints. These combinatorial optimization problems are extensively studied and attracted the attention of scientific community from several disciplines such as Computer Science (CS), Operational Research (OR) and many other applied areas. The manual generation of timetables is very time-consuming and takes countless efforts. Furthermore, the resulting timetables are usually incompetent and expensive in terms of resources and money. They are defined as involving the allocation of events (meetings between groups of students and lecturers in a particular venue or between classes and teachers) to timetable periods while at the same time satisfying a set of hard constraints and minimizing a set of soft constraints violations. It necessitates the development of automated timetables which minimizes errors, reduces their time of creation and satisfies desirable objectives as much as possible. Introduction of the study work is discussed in Chapter 1, Literature review is covered in Chapter 2, Objectives and Research Methodologies are discussed in Chapter 3. In Chapter 4 AHP technique is proposed to solve a single section teacher course assignment problem. The teacher course allocation problem is a sub problem of UCTP, In general there is no standard procedure to schedule the courses to teacher. This assignment process in general done at mutual understanding and compromising basis.
Pagination: p. 132
URI: http://hdl.handle.net/10603/302666
Appears in Departments:Faculty of Science and Technology

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File229.5 kBAdobe PDFView/Open
03_certificatesall.pdf917.15 kBAdobe PDFView/Open
05_contents.pdf147.34 kBAdobe PDFView/Open
07_chapter1.pdf285.51 kBAdobe PDFView/Open
08_chapter2.pdf397.66 kBAdobe PDFView/Open
09_chapter3.pdf96.9 kBAdobe PDFView/Open
10_chapter4.pdf237.87 kBAdobe PDFView/Open
11_chapter5.pdf486.47 kBAdobe PDFView/Open
12_chapter6.pdf745.42 kBAdobe PDFView/Open
13_chapter7.pdf469.75 kBAdobe PDFView/Open
14_chapter8.pdf81.33 kBAdobe PDFView/Open
15_bibliography.pdf187.15 kBAdobe PDFView/Open
16_annexure.pdf65.76 kBAdobe PDFView/Open
80_recommendation.pdf89.3 kBAdobe PDFView/Open


Items in Shodhganga are protected by copyright, with all rights reserved, unless otherwise indicated.

Altmetric Badge: