Two-Swim Operators in the Modified Bacterial Foraging Algorithm for the Optimal Synthesis of Four-Bar Mechanisms

被引:15
作者
Hernandez-Ocana, Betania [1 ]
Del Pilar Pozos-Parra, Ma. [1 ]
Mezura-Montes, Efren [2 ]
Alfredo Portilla-Flores, Edgar [3 ]
Vega-Alvarado, Eduardo [3 ]
Babara Calva-Yanez, Maria [3 ]
机构
[1] Univ Juarez Autonoma Tabasco, Div Acad Informat & Sistemas, Cunduacan 86690, Tab, Mexico
[2] Univ Veracruzana, Ctr Invest Inteligencia Artificial, Sebastian Camacho 5, Xalapa 91000, Veracruz, Mexico
[3] IPN, CIDETEC, Mexico City 07700, DF, Mexico
关键词
DIFFERENTIAL EVOLUTION; OPTIMIZATION; SYNERGY;
D O I
10.1155/2016/4525294
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
This paper presents two-swim operators to be added to the chemotaxis process of the modified bacterial foraging optimization algorithm to solve three instances of the synthesis of four-bar planar mechanisms. One swim favors exploration while the second one promotes fine movements in the neighborhood of each bacterium. The combined effect of the new operators looks to increase the production of better solutions during the search. As a consequence, the ability of the algorithm to escape from local optimum solutions is enhanced. The algorithm is tested through four experiments and its results are compared against two BFOA-based algorithms and also against a differential evolution algorithm designed for mechanical design problems. The overall results indicate that the proposed algorithm outperforms other BFOA-based approaches and finds highly competitive mechanisms, with a single set of parameter values and with less evaluations in the first synthesis problem, with respect to those mechanisms obtained by the differential evolution algorithm, which needed a parameter fine-tuning process for each optimization problem.
引用
收藏
页数:18
相关论文
共 45 条
[11]   Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art [J].
Coello, CAC .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2002, 191 (11-12) :1245-1287
[12]  
Corde G., 2009, NONPARAMETRIC STAT N
[13]   An efficient constraint handling method for genetic algorithms [J].
Deb, K .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2000, 186 (2-4) :311-338
[14]   Ant system: Optimization by a colony of cooperating agents [J].
Dorigo, M ;
Maniezzo, V ;
Colorni, A .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 1996, 26 (01) :29-41
[15]  
Eiben AE., 2003, NAT COMPUT, V2nd, DOI 10.1007/978-3-662-05094-1
[16]  
Eiben G, 2008, NAT COMPUT SER, P153, DOI 10.1007/978-3-540-72960-0_8
[17]  
Emdadi H., 2013, IJAIA, V4, P1
[18]  
Hernandez-Ocana B., 2016, Applied Mathematics and Information Sciences, V10, P607, DOI 10.18576/amis/100220
[19]   Stepsize Control on the Modified Bacterial Foraging Algorithm for Constrained Numerical Optimization [J].
Hernandez-Ocana, Betania ;
Del Pilar Pozos-Parra, Ma ;
Mezura-Montes, Efren .
GECCO'14: PROCEEDINGS OF THE 2014 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2014, :25-32
[20]  
Hernández-Ocaña B, 2013, 2013 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), P2695