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 条

[31] A multi-objective evolutionary algorithm for examination timetabling [J].

C. Y. Cheong ;

K. C. Tan ;

B. Veeravalli .

Journal of Scheduling, 2009, 12 :121-146

[32] A Hybrid Multiobjective Memetic Algorithm for Multiobjective Periodic Vehicle Routing Problem With Time Windows [J].

Wang, Jiahai ;

Ren, Wenbin ;

Zhang, Zizhen ;

Huang, Han ;

Zhou, Yuren .

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2020, 50 (11) :4732-4745

[33] Solving the Flexible Job Shop Scheduling Problem Based on Memetic Algorithm [J].

Zhang, Guohui .

ADVANCES IN PRODUCT DEVELOPMENT AND RELIABILITY III, 2012, 544 :1-5

[34] A threshold search based memetic algorithm for the disjunctively constrained knapsack problem [J].

Wei, Zequn ;

Hao, Jin-Kao .

COMPUTERS & OPERATIONS RESEARCH, 2021, 136

[35] MOEA3D: a MOEA based on dominance and decomposition with probability distribution model [J].

Ziyu Hu ;

Jingming Yang ;

Huihui Cui ;

Lixin Wei ;

Rui Fan .

Soft Computing, 2019, 23 :1219-1237

[36] MOEA3D: a MOEA based on dominance and decomposition with probability distribution model [J].

Hu, Ziyu ;

Yang, Jingming ;

Cui, Huihui ;

Wei, Lixin ;

Fan, Rui .

SOFT COMPUTING, 2019, 23 (04) :1219-1237

[37] A MOEA/D based Approach for Solving Robust Double Row Layout Problem [J].

Tang, Lingling ;

Zuo, Xingquan ;

Wang, Chunlu ;

Zhao, Xinchao .

2015 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2015, :1966-1973

[38] Solving Multi-Objective Portfolio Optimization Problem Based on MOEA/D [J].

Zhao, Pengxiang ;

Gao, Shang ;

Yang, Nachuan .

2020 12TH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTATIONAL INTELLIGENCE (ICACI), 2020, :30-37

[39] A Multiobjectivised Memetic Algorithm for the Frequency Assignment Problem [J].

Segredo, Eduardo ;

Segura, Carlos ;

Leon, Coromoto .

2011 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2011, :1132-1139

[40] A memetic algorithm for the generalized traveling salesman problem [J].

Gregory Gutin ;

Daniel Karapetyan .

Natural Computing, 2010, 9 :47-60

← 1 2 3 4 5 →