Alireza Ariyazand; Hamed Soleimani; Farhad Etebari; Esmaeil Mehdizadeh
Abstract
Scheduling and timetabling for university system have been a source of attention and an important challenge for the people in charge of administrations. The regulations and infrastructures are very diverse between universities, making it impossible to come up with a universal model for all. We, in this ...
Read More
Scheduling and timetabling for university system have been a source of attention and an important challenge for the people in charge of administrations. The regulations and infrastructures are very diverse between universities, making it impossible to come up with a universal model for all. We, in this research, focused on coming up with an algorithm to help with timetabling of class courses for Islamic Azad university of Robat Karim. Our goal was to define an algorithm that could improve teacher satisfaction, and overall efficiency of the university timetabling. Instead, we managed to come up with an efficient algorithm.This research considers different factors such as teacher satisfaction, knowledge and skillset, categorizes students based on undergraduate versus post graduate degree, their research background, their scores and finally student satisfaction as well. This multi-objective mathematic model accounts for all the rules, regulations, and limitations of the university setting while following challenging confinements that guarantee the feasibility of the solution. Using metaheuristic algorithm of Whale and Genetic, while avoiding any breach of the soft limitations, we managed to come up with a system that provides the most satisfaction between the teachers and students. In our research, we compared Whale and Genetic algorithm with 4 other metaheuristic algorithms. We concluded that the results of Whale and Genetic algorithm are superior to other algorithms in regards to: Improved function goals, less run time, more Pareto front averages, more efficient solutions and results.
R. Hassanzadeh; I. Mahdavi; N. Mahdavi-Amiri
Volume 2, Issue 1 , June 2015, , Pages 41-60
Abstract
Here, a collection of base functions and sub-functions configure the nodes of a web-based (digital)network representing functionalities. Each arc in the network is to be assigned as the link between two nodes. The aim is to find an optimal tree of functionalities in the network adding value to the ...
Read More
Here, a collection of base functions and sub-functions configure the nodes of a web-based (digital)network representing functionalities. Each arc in the network is to be assigned as the link between two nodes. The aim is to find an optimal tree of functionalities in the network adding value to the product in the web environment. First, a purification process is performed in the product network to assign the links among bases and sub-functions. Then, numerical values as benefits and costs are determined for arcs and nodes, respectively. To handle the bi-objective Steiner tree, a particle swarm optimization algorithm is adapted to find the optimal tree determining the value adding sub-functions to bases in a convergent product. An example is worked out to illustrate the applicability of the proposed approach.