Metaheuristics for (Variable-Size) Mixed Optimization Problems: A Unified Taxonomy and Survey

• URL: http://arxiv.org/abs/2401.03880v1
• Date: Mon, 8 Jan 2024 13:24:55 GMT
• Title: Metaheuristics for (Variable-Size) Mixed Optimization Problems: A Unified Taxonomy and Survey
• Abstract summary: Mixed-variable optimization problems (MVOPs) involve both continuous and discrete variables. variable-size MVOPs (VMVOPs) are difficult to solve and raise a number of scientific challenges in the design of metaheuristics. This paper presents a unified taxonomy for metaheuristic solutions for solving (V)MVOPs.
• Score: 0.0
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: Many real world optimization problems are formulated as mixed-variable optimization problems (MVOPs) which involve both continuous and discrete variables. MVOPs including dimensional variables are characterized by a variable-size search space. Depending on the values of dimensional variables, the number and type of the variables of the problem can vary dynamically. MVOPs and variable-size MVOPs (VMVOPs) are difficult to solve and raise a number of scientific challenges in the design of metaheuristics. Standard metaheuristics have been first designed to address continuous or discrete optimization problems, and are not able to tackle (V)MVOPs in an efficient way. The development of metaheuristics for solving such problems has attracted the attention of many researchers and is increasingly popular. However, to our knowledge there is no well established taxonomy and comprehensive survey for handling this important family of optimization problems. This paper presents a unified taxonomy for metaheuristic solutions for solving (V)MVOPs in an attempt to provide a common terminology and classification mechanisms. It provides a general mathematical formulation and concepts of (V)MVOPs, and identifies the various solving methodologies than can be applied in metaheuristics. The advantages, the weaknesses and the limitations of the presented methodologies are discussed. The proposed taxonomy also allows to identify some open research issues which needs further in-depth investigations.

Related papers

• ID-PaS : Identity-Aware Predict-and-Search for General Mixed-Integer Linear Programs [21.379306770292136]
  This work extends the Predict-and-Search (PaS) framework to parametric MIPs.<n>It introduces ID-PaS, an identity-aware learning framework that enables the ML model to handle heterogeneous variables more effectively.
  arXiv  Detail & Related papers  (2025-12-11T01:58:28Z)
• EHOP: A Dataset of Everyday NP-Hard Optimization Problems [66.41749917354159]
  Everyday Hard Optimization Problems (EHOP) is a collection of NP-hard optimization problems expressed in natural language. EHOP includes problem formulations that could be found in computer science textbooks, versions that are dressed up as problems that could arise in real life, and variants of well-known problems with inverted rules. We find that state-of-the-art LLMs, across multiple prompting strategies, systematically solve textbook problems more accurately than their real-life and inverted counterparts.
  arXiv  Detail & Related papers  (2025-02-19T14:39:59Z)
• Unraveling the Versatility and Impact of Multi-Objective Optimization: Algorithms, Applications, and Trends for Solving Complex Real-World Problems [4.023511716339818]
  Multi-Objective Optimization (MOO) techniques have become increasingly popular in recent years. This paper examines recently developed MOO-based algorithms. In real-world case studies, MOO algorithms address complicated decision-making challenges.
  arXiv  Detail & Related papers  (2024-06-29T15:19:46Z)
• Towards Multi-Objective High-Dimensional Feature Selection via Evolutionary Multitasking [63.91518180604101]
  This paper develops a novel EMT framework for high-dimensional feature selection problems, namely MO-FSEMT. A task-specific knowledge transfer mechanism is designed to leverage the advantage information of each task, enabling the discovery and effective transmission of high-quality solutions.
  arXiv  Detail & Related papers  (2024-01-03T06:34:39Z)
• Pre-Evolved Model for Complex Multi-objective Optimization Problems [3.784829029016233]
  Multi-objective optimization problems (MOPs) necessitate the simultaneous optimization of multiple objectives. This paper proposes the concept of pre-evolving for MOEAs to generate high-quality populations for diverse complex MOPs.
  arXiv  Detail & Related papers  (2023-12-11T05:16:58Z)
• A Fitness-assignment Method for Evolutionary Constrained Multi-objective Optimization [5.757908778750608]
  We propose an effective single-population fitness assignment-based CMOEA referred to as IcSDE+. IcSDE+ is an efficient fusion of constraint violation (c), Shift-based Density Estimation (SDE), and sum of objectives (+) The performance of IcSDE+ is favorably compared against 9 state-of-the-art CMOEAs on 6 different benchmark suites with diverse characteristics.
  arXiv  Detail & Related papers  (2023-05-30T04:19:01Z)
• Numerical Methods for Convex Multistage Stochastic Optimization [86.45244607927732]
  We focus on optimisation programming (SP), Optimal Control (SOC) and Decision Processes (MDP) Recent progress in solving convex multistage Markov problems is based on cutting planes approximations of the cost-to-go functions of dynamic programming equations. Cutting plane type methods can handle multistage problems with a large number of stages, but a relatively smaller number of state (decision) variables.
  arXiv  Detail & Related papers  (2023-03-28T01:30:40Z)
• Multi-Objective Constrained Optimization for Energy Applications via Tree Ensembles [55.23285485923913]
  Energy systems optimization problems are complex due to strongly non-linear system behavior and multiple competing objectives. In some cases, proposed optimal solutions need to obey explicit input constraints related to physical properties or safety-critical operating conditions. This paper proposes a novel data-driven strategy using tree ensembles for constrained multi-objective optimization of black-box problems.
  arXiv  Detail & Related papers  (2021-11-04T20:18:55Z)
• Result Diversification by Multi-objective Evolutionary Algorithms with Theoretical Guarantees [94.72461292387146]
  We propose to reformulate the result diversification problem as a bi-objective search problem, and solve it by a multi-objective evolutionary algorithm (EA) We theoretically prove that the GSEMO can achieve the optimal-time approximation ratio, $1/2$. When the objective function changes dynamically, the GSEMO can maintain this approximation ratio in running time, addressing the open question proposed by Borodin et al.
  arXiv  Detail & Related papers  (2021-10-18T14:00:22Z)
• Solving Large-Scale Multi-Objective Optimization via Probabilistic Prediction Model [10.916384208006157]
  An efficient LSMOP algorithm should have the ability to escape the local optimal solution from the huge search space. Maintaining the diversity of the population is one of the effective ways to improve search efficiency. We propose a probabilistic prediction model based on trend prediction model and generating-filtering strategy, called LT-PPM, to tackle the LSMOP.
  arXiv  Detail & Related papers  (2021-07-16T09:43:35Z)
• Efficient Model-Based Multi-Agent Mean-Field Reinforcement Learning [89.31889875864599]
  We propose an efficient model-based reinforcement learning algorithm for learning in multi-agent systems. Our main theoretical contributions are the first general regret bounds for model-based reinforcement learning for MFC. We provide a practical parametrization of the core optimization problem.
  arXiv  Detail & Related papers  (2021-07-08T18:01:02Z)
• Multi-Space Evolutionary Search for Large-Scale Optimization [31.592330078642828]
  This paper proposes a new search paradigm, namely the multi-space evolutionary search, to enhance the existing evolutionary search methods for solving large-scale optimization problems. The proposed paradigm makes no assumptions about the large-scale optimization problem of interest, such as that the problem is decomposable or that a certain relationship exists among the decision variables.
  arXiv  Detail & Related papers  (2021-02-23T13:50:09Z)
• Offline Model-Based Optimization via Normalized Maximum Likelihood Estimation [101.22379613810881]
  We consider data-driven optimization problems where one must maximize a function given only queries at a fixed set of points. This problem setting emerges in many domains where function evaluation is a complex and expensive process. We propose a tractable approximation that allows us to scale our method to high-capacity neural network models.
  arXiv  Detail & Related papers  (2021-02-16T06:04:27Z)
• Bayesian optimization of variable-size design space problems [0.0]
  Two alternative Bayesian Optimization-based approaches are proposed in order to solve this type of optimization problems. The first approach consists in a budget allocation strategy allowing to focus the computational budget on the most promising design sub-spaces. The second approach, instead, is based on the definition of a kernel function allowing to compute the covariance between samples characterized by partially different sets of variables.
  arXiv  Detail & Related papers  (2020-03-06T16:30:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.