Efficient hybrid algorithms to solve mixed discrete-continuous optimization problems

• Published in: Engineering computations Vol. 35; no. 2; pp. 979 - 1002
• Main Authors: Liu, Dianzi, Liu, Chengyang, Zhang, Chuanwei, Xu, Chao, Du, Ziliang, Wan, Zhiqiang
• Format: Journal Article
• Language: English
• Published: Bradford Emerald Publishing Limited 16.04.2018; Emerald Group Publishing Limited
• Subjects: Algorithms; Approximation; Design of experiments; Efficiency; Finite element method; Genetic algorithms; Methods; Multipoint approximation; Optimization; Rounding; Variables; Hybrid algorithms; Direct search; Multipoint approximation method; Discrete-continuous design optimization
• ISSN: 0264-4401; 1758-7077
• DOI: 10.1108/EC-03-2017-0103

Purpose In real-world cases, it is common to encounter mixed discrete-continuous problems where some or all of the variables may take only discrete values. To solve these non-linear optimization problems, the use of finite element methods is very time-consuming. The purpose of this study is to investigate the efficiency of the proposed hybrid algorithms for the mixed discrete-continuous optimization and compare it with the performance of genetic algorithms (GAs). Design/methodology/approach In this paper, the enhanced multipoint approximation method (MAM) is used to reduce the original nonlinear optimization problem to a sequence of approximations. Then, the sequential quadratic programing technique is applied to find the continuous solution. Following that, the implementation of discrete capability into the MAM is developed to solve the mixed discrete-continuous optimization problems. Findings The efficiency and rate of convergence of the developed hybrid algorithms outperforming GA are examined by six detailed case studies in the ten-bar planar truss problem, and the superiority of the Hooke–Jeeves assisted MAM algorithm over the other two hybrid algorithms and GAs is concluded. Originality/value The authors propose three efficient hybrid algorithms, the rounding-off, the coordinate search and the Hooke–Jeeves search-assisted MAMs, to solve nonlinear mixed discrete-continuous optimization problems. Implementations include the development of new procedures for sampling discrete points, the modification of the trust region adaptation strategy and strategies for solving mix optimization problems. To improve the efficiency and effectiveness of metamodel construction, regressors f defined in this paper can have the form in common with the empirical formulation of the problems in many engineering subjects.