A memetic algorithm based on Artificial Bee Colony for optimal synthesis of mechanisms

被引:2
作者
Vega-Alvarado, Eduardo [1 ]
Portilla-Flores, E. A. [1 ]
Ardul Munoz-Hernandez, German [2 ]
Mezura-Montes, E. [3 ]
Sepulveda-Cervantes, G. [1 ]
Bautista-Camino, P. [1 ]
机构
[1] Inst Politecn Nacl, CIDETEC, Mexico City, DF, Mexico
[2] Inst Tecnol Puebla, Puebla, Mexico
[3] Univ Veracruzana, Ctr Invest Inteligencia Artificial, Xalapa, Veracruz, Mexico
来源
REVISTA INTERNACIONAL DE METODOS NUMERICOS PARA CALCULO Y DISENO EN INGENIERIA | 2018年 / 34卷 / 01期
关键词
ABC; dimnesional syntehsis; memetic algorithms; metaheuristics; optimization Resumen; OPTIMIZATION; DESIGN;
D O I
10.23967/j.rimni.2017.5.002
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this paper a novel proposal of a modular hybrid algorithm as a tool for solving real-world engineering problems is presented. A memetic algorithm, MemMABC, is implemented with this approach and applied to solve two case studies of mechanism design, in order to evaluate its efficiency and performance. Because of its modularity, the proposed algorithm is simple and flexible; these features make it quite reusable to be applied on different optimization problems, with a wide scope. The solutions of the optimization problems are also modular, following a scheme of structured programming that includes the use of global variables for configuration, and subroutines for the objective function and the restrictions. Memetic algorithms are a good option to solve hard optimization problems, because of the synergy derived from the combination of their components: a global search population-based metaheuristic and a local refinement method. The quality of simulation results suggests that MemMABC can be successfully applied to solve hard problems in engineering design.
引用
收藏
页数:10
相关论文
共 32 条
[1]  
Adriaensen S, 2014, 2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), P2969, DOI 10.1109/CEC.2014.6900575
[2]  
Alvarez-Gallegos J, 2005, LECT NOTES ARTIF INT, V3789, P1093
[3]  
[Anonymous], 2005, 2005005 NAN TU
[4]  
[Anonymous], 2014, INT J COMPUT APPL, DOI DOI 10.5120/15582-4406
[5]   A Memetic Algorithm for the Traveling Salesman Problem [J].
Arango, M. D. ;
Serna, C. A. .
IEEE LATIN AMERICA TRANSACTIONS, 2015, 13 (08) :2674-2679
[6]   A survey on optimization metaheuristics [J].
Boussaid, Ilhern ;
Lepagnot, Julien ;
Siarry, Patrick .
INFORMATION SCIENCES, 2013, 237 :82-117
[7]  
de Oca MAM, 2012, STUD COMPUT INTELL, V379, P29
[8]  
de Silva C.W., 2005, Mechatronics: An Integrated Approach
[9]   An efficient constraint handling method for genetic algorithms [J].
Deb, K .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2000, 186 (2-4) :311-338
[10]  
Domínguez-Isidro S, 2013, 2013 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), P2996