<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"><channel><title>Scientia Research Library</title><link>http://www.scientiaresearchlibrary.com</link><description>Scientia Research Library make easy to publish research articles or research papers, which is a great opportunity for everyone to fulfill their requirements. Different varieties of journals related to science and technology which are scientifically same can be published here. The Scientia Research  Library  is having an  open - access and peer review policy  to permit  and  understand  use with  required  acceptance  of   the  original . Our   aim is to provide researchers from various diverse fields like engineering, applied chemistry, applied science and research etc., a unique way to give light to their findings.</description><article><ArtTitle>
	SOLVING UNIVERSITY TIMETABLING PROBLEMS BASED ON A MULTI-CONSTRAINT ENVIRONMENT
</ArtTitle><PubName>Scientia Research Library</PubName><JournalName>Journal of Engineering and Technology Research</JournalName><EISSN>2348 - 0424</EISSN><year>2017</year><volume>5</volume><issue>5</issue><AuthorName>
	FERNANDO S. VIRAY JR.
	Page No. 1-14
</AuthorName><PageNo>1</PageNo><Abstract>
	The key to finding an optimum solution for a gargantuan problem such as the University Timetabling Problem (UTP) which is considered an NP-hard problem is to implement a divide and conquer mechanism. In this research, the sub-problems of UTP are considered and input data, factors, and parameters were classified and organized to model several stages or phases of the solution process. Meta-heuristic approaches were implemented in finding an overall feasible solution to the UTP by initiating a specific AI-based local search and optimization algorithm with little human intervention in every phase of the solution process. Algorithms to be utilized as a part of the meta-heuristics include Tabu Search, Greedy Algorithm, Integer Linear Programming, and Bi-Partite Graph Approach. Simulation results revealed that the proposed multi-stage solution process model, by incorporating multi-constraint inputs, is a promising model when paired with any of the subject algorithms as it significantly aids in finding an optimum solution faster in terms of elapsed time and computation resources.
	Keywords: Timetabling Problem (TP), University Class Scheduling Problem (UCSP), local search and optimization techniques
</Abstract><URLs><abstract>http://www.scientiaresearchlibrary.com/archive-abs.php?arc=796</abstract><Fulltext><pdf>http://www.scientiaresearchlibrary.com/archive/JETR-2017_5_5_1_14_BD.pdf</pdf></Fulltext></URLs></article></channel></rss>
