A memetic algorithm based on MOEA/D for the examination timetabling problem

被引：9

作者：

Lei, Yu ^{[1
]}

Shi, Jiao ^{[1
]}

Yan, Zhen ^{[2
]}

机构：

[1] Northwestern Polytech Univ, Sch Elect & Informat, Xian 710072, Shaanxi, Peoples R China

[2] China Univ Geosci, Sch Comp Sci, Wuhan 430074, Hubei, Peoples R China

来源：

SOFT COMPUTING | 2018年 / 22卷 / 05期

基金：

中国国家自然科学基金; 中国博士后科学基金;

关键词：

Uncapacitated examination timetabling problem; Multiobjective optimization; MOEA/D; Local search; MATCHING-BASED SELECTION; EVOLUTIONARY ALGORITHM;

D O I：

10.1007/s00500-017-2886-y

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

A memetic algorithm based on MOEA/D is presented to deal with the uncapacitated multiobjective examination timetabling problem in this paper. The examination timetabling problem is considered as a two-objective optimization problem in this paper, while it is modeled as a single-objective optimization problem generally. The framework of a multiobjective evolutionary algorithm with decomposition (MOEA/D) is first employed to guide the evolutionary process. Two special local search operators are designed to find better individuals. The proposed algorithm is tested on 11 benchmark examination timetabling instances. Experimental results prove that the proposed algorithm can produce a promising set of nondominated solutions for each examination timetabling instance.

引用

页码：1511 / 1523

页数：13

共 50 条

[11] MOEA/D-GLS: a multiobjective memetic algorithm using decomposition and guided local search [J].

Ahmad Alhindi ;

Abrar Alhindi ;

Atif Alhejali ;

Abdullah Alsheddy ;

Nasser Tairan ;

Hosam Alhakami .

Soft Computing, 2019, 23 :9605-9615

[12] A Novel Memetic Algorithm Based on Decomposition for Multiobjective Flexible Job Shop Scheduling Problem [J].

Wang, Chun ;

Ji, Zhicheng ;

Wang, Yan .

MATHEMATICAL PROBLEMS IN ENGINEERING, 2017, 2017

[13] MOEA/D with opposition-based learning for multiobjective optimization problem [J].

Ma, Xiaoliang ;

Liu, Fang ;

Qi, Yutao ;

Gong, Maoguo ;

Yin, Minglei ;

Li, Lingling ;

Jiao, Licheng ;

Wu, Jianshe .

NEUROCOMPUTING, 2014, 146 :48-64

[14] Success-History Based Parameter Adaptation in MOEA/D Algorithm [J].

Akhmedova, Shakhnaz ;

Stanovov, Vladimir .

ADVANCES IN SWARM INTELLIGENCE, ICSI 2020, 2020, 12145 :455-462

[15] Solving University Examination Timetabling Problem Using Intelligent Water Drops Algorithm [J].

Aldeeb, Bashar A. ;

Norwawi, Norita Md ;

Al-Betar, Mohammed A. ;

Bin Jali, Mohd Zalisham .

SWARM, EVOLUTIONARY, AND MEMETIC COMPUTING, SEMCCO 2014, 2015, 8947 :187-200

[16] Genetic Algorithm for Solving Multi-Objective Optimization in Examination Timetabling Problem [J].

Son Ngo Tung ;

Jaafar, Jafreezal B. ;

Aziz, Izzatdin Abdul ;

Hoang Giang Nguyen ;

Anh Ngoc Bui .

INTERNATIONAL JOURNAL OF EMERGING TECHNOLOGIES IN LEARNING, 2021, 16 (11) :4-24

[17] A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows [J].

Qi, Yutao ;

Hou, Zhanting ;

Li, He ;

Huang, Jianbin ;

Li, Xiaodong .

COMPUTERS & OPERATIONS RESEARCH, 2015, 62 :61-77

[18] Improving neighborhood exploration into MOEA/D framework to solve a bi-objective routing problem [J].

Legrand, Clement ;

Cattaruzza, Diego ;

Jourdan, Laetitia ;

Kessaci, Marie-Eleonore .

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2025, 32 (01) :117-143

[19] Decomposition-Based Memetic Algorithm for Multiobjective Capacitated Arc Routing Problem [J].

Mei, Yi ;

Tang, Ke ;

Yao, Xin .

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2011, 15 (02) :151-165

[20] A Decomposition based Memetic Multi-objective Algorithm for Continuous Multi-objective Optimization Problem [J].

Wang, Na ;

Wang, Hongfeng ;

Fu, Yaping ;

Wang, Lingwei .

2015 27TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2015, :896-900

← 1 2 3 4 5 →