Hybrid teaching-learning-based optimization algorithms for the Quadratic Assignment Problem

被引:67
作者
Dokeroglu, Tansel [1 ]
机构
[1] Turkish Educ Assoc Univ, Dept Comp Engn, Ankara, Turkey
关键词
Teaching-learning; Hybrid algorithm; Robust tabu; Quadratic assignment; Stagnation; TABU SEARCH ALGORITHM; FACILITY LAYOUT PROBLEM; GENETIC ALGORITHM; DIVERSIFICATION;
D O I
10.1016/j.cie.2015.03.001
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Teaching-Learning-Based Optimization (TLBO) is a novel swarm intelligence metaheuristic that is reported as an efficient solution method for many optimization problems. It consists of two phases where all individuals are trained by a teacher in the first phase and interact with classmates to improve their knowledge level in the second phase. In this study, we propose a set of TLBO-based hybrid algorithms to solve the challenging combinatorial optimization problem, Quadratic Assignment. Individuals are trained with recombination operators and later a Robust Tabu Search engine processes them. The performances of sequential and parallel TLBO-based hybrid algorithms are compared with those of state-of-the-art metaheuristics in terms of the best solution and computational effort. It is shown experimentally that the performance of the proposed algorithms are competitive with the best reported algorithms for the solution of the Quadratic Assignment Problem with which many real life problems can be modeled. (C) 2015 Elsevier Ltd. All rights reserved.
引用
收藏
页码:86 / 101
页数:16
相关论文
共 75 条
[1]   A new ant colony optimization based algorithm for data allocation problem in distributed databases [J].
Adl, Rosa Karimi ;
Rankoohi, Seyed Mohammad Taghi Rouhani .
KNOWLEDGE AND INFORMATION SYSTEMS, 2009, 20 (03) :349-373
[2]   Grenade Explosion Method-A novel tool for optimization of multimodal functions [J].
Ahrari, Ali ;
Atai, Ali A. .
APPLIED SOFT COMPUTING, 2010, 10 (04) :1132-1140
[3]   A greedy genetic algorithm for the quadratic assignment problem [J].
Ahuja, RK ;
Orlin, JB ;
Tiwari, A .
COMPUTERS & OPERATIONS RESEARCH, 2000, 27 (10) :917-934
[4]   Solving large quadratic assignment problems on computational grids [J].
Anstreicher, K ;
Brixius, N ;
Goux, JP ;
Linderoth, J .
MATHEMATICAL PROGRAMMING, 2002, 91 (03) :563-588
[5]   THE HOPFIELD NEURAL-NETWORK APPLIED TO THE QUADRATIC ASSIGNMENT PROBLEM [J].
BOUSONOCALZON, C ;
MANNING, MRW .
NEURAL COMPUTING & APPLICATIONS, 1995, 3 (02) :64-72
[6]   QAPLIB-A QUADRATIC ASSIGNMENT PROBLEM LIBRARY [J].
BURKARD, RE ;
KARISCH, S ;
RENDL, F .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1991, 55 (01) :115-119
[7]   A NEW LOWER BOUND FOR THE QUADRATIC ASSIGNMENT PROBLEM [J].
CARRARESI, P ;
MALUCELLI, F .
OPERATIONS RESEARCH, 1992, 40 :S22-S27
[8]   A CONNECTIONIST APPROACH TO THE QUADRATIC ASSIGNMENT PROBLEM [J].
CHAKRAPANI, J ;
SKORINKAPOV, J .
COMPUTERS & OPERATIONS RESEARCH, 1992, 19 (3-4) :287-295
[9]   Solving large quadratic assignment problems in parallel [J].
Clausen, J ;
Perregaard, M .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 1997, 8 (02) :111-127
[10]   AN IMPROVED ANNEALING SCHEME FOR THE QAP [J].
CONNOLLY, DT .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 46 (01) :93-100