•  Persian
    • Persian
    • English
  •   ورود
  • دانشگاه فردوسی مشهد
  • |
  • مرکز اطلاع‌رسانی و کتابخانه مرکزی
    • Persian
    • English
  • خانه
  • انواع منابع
    • مقاله مجله
    • کتاب الکترونیکی
    • مقاله همایش
    • استاندارد
    • پروتکل
    • پایان‌نامه
  • راهنمای استفاده
View Item 
  •   کتابخانه دیجیتال دانشگاه فردوسی مشهد
  • Fum
  • Articles
  • ProfDoc
  • View Item
  •   کتابخانه دیجیتال دانشگاه فردوسی مشهد
  • Fum
  • Articles
  • ProfDoc
  • View Item
  • همه
  • عنوان
  • نویسنده
  • سال
  • ناشر
  • موضوع
  • عنوان ناشر
  • ISSN
  • شناسه الکترونیک
  • شابک
جستجوی پیشرفته
JavaScript is disabled for your browser. Some features of this site may not work without it.

Memetic and scatter search metaheuristic algorithms for a multiobjective fortnightly university course timetabling problem: a case study

نویسنده:
نسیبه موحدفر
,
محمد رنجبر
,
مجید سالاری
,
سلیم رستمی
,
nasibeh movahhedfar
,
Mohammad Ranjbar
,
Majid Salari
,
Salim Rostami
سال
: 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.
یو آر آی: https://libsearch.um.ac.ir:443/fum/handle/fum/3350521
کلیدواژه(گان): Fortnightly timetabling problem,integer linear programming,memetic algorithm,scatter search
کالکشن :
  • ProfDoc
  • نمایش متادیتا پنهان کردن متادیتا
  • آمار بازدید

    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 authornasibeh movahhedfarfa
contributor authorMohammad Ranjbarfa
contributor authorMajid Salarifa
contributor authorSalim Rostamifa
date accessioned2020-06-06T13:19:55Z
date available2020-06-06T13:19:55Z
date issued2013
identifier urihttps://libsearch.um.ac.ir:443/fum/handle/fum/3350521
description abstractThis 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
languageEnglish
titleMemetic and scatter search metaheuristic algorithms for a multiobjective fortnightly university course timetabling problem: a case studyen
typeJournal Paper
contenttypeExternal Fulltext
subject keywordsFortnightly timetabling problemen
subject keywordsinteger linear programmingen
subject keywordsmemetic algorithmen
subject keywordsscatter searchen
journal titleJournal of Industrial and Systems Engineeringfa
pages249-271
journal volume6
journal issue4
identifier linkhttps://profdoc.um.ac.ir/paper-abstract-1042840.html
identifier articleid1042840
  • درباره ما
نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
DSpace software copyright © 2019-2022  DuraSpace