Migrating Birds Optimization: A new metaheuristic approach and its performance on quadratic assignment problem

被引:206
作者
Duman, Ekrem [1 ]
Uysal, Mitat [2 ]
Alkaya, Ali Fuat [3 ]
机构
[1] Ozyegin Univ, Dept Ind Engn, Istanbul, Turkey
[2] Dogus Univ, Dept Comp Engn, Istanbul, Turkey
[3] Marmara Univ, Dept Comp Engn, Istanbul, Turkey
关键词
Metaheuristics; Optimization; Birds' migration; V-shape topology; Benefit mechanism; HYBRID GENETIC ALGORITHMS; FORMATION FLIGHT; DIFFERENTIAL EVOLUTION; ENERGY SAVINGS; SEARCH; FORMULATION;
D O I
10.1016/j.ins.2012.06.032
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We propose a new nature inspired metaheuristic approach based on the V flight formation of the migrating birds which is proven to be an effective formation in energy saving. Its performance is tested on quadratic assignment problem instances arising from a real life problem and very good results are obtained. The quality of the solutions we report are better than simulated annealing, tabu search, genetic algorithm, scatter search, particle swarm optimization, differential evolution and guided evolutionary simulated annealing approaches. The proposed method is also tested on a number of benchmark problems obtained from the QAPLIB and in most cases it was able to obtain the best known solutions. These results indicate that our new metaheuristic approach could be an important player in metaheuristic based optimization. (C) 2012 Elsevier Inc. All rights reserved.
引用
收藏
页码:65 / 77
页数:13
相关论文
共 54 条
[31]   A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan [J].
Lian, Zhigang ;
Gu, Xingsheng ;
Jiao, Bin .
APPLIED MATHEMATICS AND COMPUTATION, 2006, 175 (01) :773-785
[32]   FORMATION FLIGHT OF BIRDS [J].
LISSAMAN, PB ;
SHOLLENBERGER, CA .
SCIENCE, 1970, 168 (3934) :1003-+
[33]   A survey for the quadratic assignment problem [J].
Loiola, Eliane Maria ;
de Abreu, Nair Maria Maia ;
Boaventura-Netto, Paulo Oswaldo ;
Hahn, Peter ;
Querido, Tania .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 176 (02) :657-690
[34]   A genetic algorithm approach for regrouping service sites [J].
Mansour, N ;
Tabbara, H ;
Dana, T .
COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (08) :1317-1333
[35]   Honey Bees Mating Optimization algorithm for financial classification problems [J].
Marinaki, Magdalene ;
Marinakis, Yannis ;
Zopounidis, Constantin .
APPLIED SOFT COMPUTING, 2010, 10 (03) :806-812
[36]  
Misevicius A, 2009, INFORMATICA-LITHUAN, V20, P255
[37]  
Mucherino A, 2007, AIP CONF PROC, V953, P162, DOI 10.1063/1.2817338
[38]   A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem [J].
Pan, Quan-Ke ;
Tasgetiren, M. Fatih ;
Liang, Yun-Chia .
COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (09) :2807-2839
[39]   A discrete differential evolution algorithm for the permutation flowshop scheduling problem [J].
Pan, Quan-Ke ;
Tasgetiren, Mehmet Fatih ;
Liang, Yun-Chia .
COMPUTERS & INDUSTRIAL ENGINEERING, 2008, 55 (04) :795-816
[40]   An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems [J].
Paul, G. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 209 (03) :215-218