Efficient hybrid algorithms to solve mixed discrete-continuous optimization problems

Abstract

Abstract: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, it is very time-consuming in use of finite element methods. The purpose of this paper is to study the efficiency of the proposed hybrid algorithms for the mixed discrete-continuous optimization, and compares it with the performance of Genetic Algorithms (GA).Design/methodology/approach -In this paper, the enhanced multipoint approximation method (MAM) is utilized to reduce the original nonlinear optimization problem to a sequence of approximations. Then, the Sequential Quadratic Programming (SQP) 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 φ defined in this paper can have the form in common with the empirical formulation of the problems in many engineering subjects.

Development of Automated Processes for Three-Dimensional Numerical Simulation of Compressor Performance Characteristics

“…Jeeves, this algorithm is a pattern search technique that does not require gradient information, which makes it suitable for problems where derivatives are not readily available or are difficult to compute. It is apt for both linear and nonlinear design spaces and has been applied to many real-life optimization problems [33][34][35]. Specifically, the size of variable perturbations is established by the relative step size, with a value of 0.5.…”

Harnessing Spectral Singularities in Non- Hermitian Cylindrical Structures

“…With a view toward a practical implementation, a library featuring a discrete set of dispersive material models should be considered upfront, also taking into account fabrication-compatibility constraints. The resulting mixed discrete-continuous optimization problem could be addressed via hybrid (e.g., enhanced multipoint approximation) or genetic-algorithm-based approaches [67].…”

Machine Coded Compact Genetic Algorithms for Real Parameter Optimization Problems

“…used a hybridization method based on the statistical filtering Satman and Akadal (2016). applied ARIMA forecasting to predict offspring using the historical chromosome data of parents in earlier generations as a hybridization tool Liu et al (2018),Long and Wu (2014),Kang et al (2011). andSatman (2015) hybridized many evolutionary optimization algorithms with the Hooke and Jeeves local optimizer for improving the quality and the precision of the solutions.…”