How to Deal with Mixed-Variable Optimization Problems: An Overview of Algorithms and Formulations

Abstract

Real world engineering optimization problems often involve discrete variables (e.g., categorical variables) characterizing choices such as the type of material to be used or the presence of certain system components. From an analytical perspective, these particular variables determine the definition of the objective and constraint functions, as well as the number and type of parameters that characterize the problem. Furthermore, due to the inherent discrete and potentially non-numerical nature of these variables, the concept of metrics is usually not definable within their domain, thus resulting in an unordered set of possible choices. Most modern optimization algorithms were developed with the purpose of solving design problems essentially characterized by integer and continuous variables and by consequence the introduction of these discrete variables raises a number of new challenges. For instance, in case an order can not be defined within the variables domain, it is unfeasible to use optimization algorithms relying on measures of distances, such as Particle Swarm Optimization. Furthermore, their presence results in non-differentiable objective and constraint functions, thus limiting the use of gradient-based optimization techniques. Finally, as previously mentioned, the search space of the problem and the definition of the objective and constraint functions vary dynamically during the optimization process as a function of the discrete variables values.