Memetic and scatter search metaheuristic algorithms for a multiobjective fortnightly university course timetabling problem: a case study
نویسنده:
, , , , , , ,سال
: 2013
چکیده: This paper studies a multi-objective fortnightly university course timetabling problem. In this research, the Industrial Engineering Department of the Ferdowsi University of Mashhad is considered as the case study for investigation. Essentially, four objectives should be optimized where we used the Lp-metric method to aggregate them into a single objective. An integer linear programming model and two metaheuristic algorithms, i.e. memetic and scatter search, have been developed for the studied problem. Comparing the proposed algorithms with the results obtained by CPLEX, indicates the superiority of the scatter search algorithm. In particular, high quality solutions are achieved in a reasonable CPU time.
کلیدواژه(گان): Fortnightly timetabling problem,integer linear programming,memetic algorithm,scatter search
کالکشن
:
-
آمار بازدید
Memetic and scatter search metaheuristic algorithms for a multiobjective fortnightly university course timetabling problem: a case study
Show full item record
contributor author | نسیبه موحدفر | en |
contributor author | محمد رنجبر | en |
contributor author | مجید سالاری | en |
contributor author | سلیم رستمی | en |
contributor author | nasibeh movahhedfar | fa |
contributor author | Mohammad Ranjbar | fa |
contributor author | Majid Salari | fa |
contributor author | Salim Rostami | fa |
date accessioned | 2020-06-06T13:19:55Z | |
date available | 2020-06-06T13:19:55Z | |
date issued | 2013 | |
identifier uri | https://libsearch.um.ac.ir:443/fum/handle/fum/3350521 | |
description abstract | This paper studies a multi-objective fortnightly university course timetabling problem. In this research, the Industrial Engineering Department of the Ferdowsi University of Mashhad is considered as the case study for investigation. Essentially, four objectives should be optimized where we used the Lp-metric method to aggregate them into a single objective. An integer linear programming model and two metaheuristic algorithms, i.e. memetic and scatter search, have been developed for the studied problem. Comparing the proposed algorithms with the results obtained by CPLEX, indicates the superiority of the scatter search algorithm. In particular, high quality solutions are achieved in a reasonable CPU time. | en |
language | English | |
title | Memetic and scatter search metaheuristic algorithms for a multiobjective fortnightly university course timetabling problem: a case study | en |
type | Journal Paper | |
contenttype | External Fulltext | |
subject keywords | Fortnightly timetabling problem | en |
subject keywords | integer linear programming | en |
subject keywords | memetic algorithm | en |
subject keywords | scatter search | en |
journal title | Journal of Industrial and Systems Engineering | fa |
pages | 249-271 | |
journal volume | 6 | |
journal issue | 4 | |
identifier link | https://profdoc.um.ac.ir/paper-abstract-1042840.html | |
identifier articleid | 1042840 |