Seeking and leveraging alternative variable dependency concepts in gray-box-elusive bimodal land-use allocation problems

• URL: http://arxiv.org/abs/2504.11882v1
• Date: Wed, 16 Apr 2025 09:06:55 GMT
• Title: Seeking and leveraging alternative variable dependency concepts in gray-box-elusive bimodal land-use allocation problems
• Abstract summary: We consider a real-world multi-objective problem for which standard variable dependency discovery techniques are inapplicable.<n>To address this issue, we propose a definition of problem-dedicated variable dependency.<n>The results concerning real-world test cases show that introducing our propositions into two well-knowns (NSEA/D) significantly improves their effectiveness.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Solving land-use allocation problems can help us to deal with some of the most urgent global environmental issues. Since these problems are NP-hard, effective optimizers are needed to handle them. The knowledge about variable dependencies allows for proposing such tools. However, in this work, we consider a real-world multi-objective problem for which standard variable dependency discovery techniques are inapplicable. Therefore, using linkage-based variation operators is unreachable. To address this issue, we propose a definition of problem-dedicated variable dependency. On this base, we propose obtaining masks of dependent variables. Using them, we construct three novel crossover operators. The results concerning real-world test cases show that introducing our propositions into two well-known optimizers (NSGA-II, MOEA/D) dedicated to multi-objective optimization significantly improves their effectiveness.

Related papers

• Boomda: Balanced Multi-objective Optimization for Multimodal Domain Adaptation [17.15772103162049]
  A popular solution is unsupervised domain adaptation, which has been extensively studied in unimodal settings.<n>In this paper, we investigate heterogeneous multimodal domain adaptation, where the primary challenge is the varying domain shifts of different modalities.<n>By exploiting the properties specific to our model, the problem can be simplified to a quadratic programming problem.<n>The proposed method features textbfBalanced multi-text-bfobjective textbfoptimization for textbfmultimodal textbfdomain textbf
  arXiv  Detail & Related papers  (2025-11-11T12:03:45Z)
• On Revealing the Hidden Problem Structure in Real-World and Theoretical Problems Using Walsh Coefficient Influence [0.0]
  Gray-box optimization employs Walsh decomposition to obtain non-linear variable dependencies. In some problems, all variables are non-linearly dependent, making the aforementioned masks useless. We analyze the features of the real-world instances of such problems and show that many of their dependencies may have noise-like origins.
  arXiv  Detail & Related papers  (2025-04-16T08:22:59Z)
• When Disagreements Elicit Robustness: Investigating Self-Repair Capabilities under LLM Multi-Agent Disagreements [56.29265568399648]
  We argue that disagreements prevent premature consensus and expand the explored solution space.<n>Disagreements on task-critical steps can derail collaboration depending on the topology of solution paths.
  arXiv  Detail & Related papers  (2025-02-21T02:24:43Z)
• 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.<n>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.<n>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)
• Non-Myopic Multi-Objective Bayesian Optimization [64.31753000439514]
  We consider the problem of finite-horizon sequential experimental design to solve multi-objective optimization problems.<n>This problem arises in many real-world applications, including materials design.<n>We propose the first set of non-myopic methods for MOO problems.
  arXiv  Detail & Related papers  (2024-12-11T04:05:29Z)
• Learning Multiple Initial Solutions to Optimization Problems [52.9380464408756]
  Sequentially solving similar optimization problems under strict runtime constraints is essential for many applications.<n>We propose learning to predict emphmultiple diverse initial solutions given parameters that define the problem instance.<n>We find significant and consistent improvement with our method across all evaluation settings and demonstrate that it efficiently scales with the number of initial solutions required.
  arXiv  Detail & Related papers  (2024-11-04T15:17:19Z)
• The hop-like problem nature -- unveiling and modelling new features of real-world problems [0.0]
  We propose a hop-based analysis of the optimization process. Results indicate the existence of some of the features of the well-known Leading Ones problem. Experiments reveal what kind of mechanisms must be proposed to improve GAs' effectiveness.
  arXiv  Detail & Related papers  (2024-06-03T11:30:04Z)
• UCB-driven Utility Function Search for Multi-objective Reinforcement Learning [75.11267478778295]
  In Multi-objective Reinforcement Learning (MORL) agents are tasked with optimising decision-making behaviours. We focus on the case of linear utility functions parameterised by weight vectors w. We introduce a method based on Upper Confidence Bound to efficiently search for the most promising weight vectors during different stages of the learning process.
  arXiv  Detail & Related papers  (2024-05-01T09:34:42Z)
• Metaheuristics for (Variable-Size) Mixed Optimization Problems: A Unified Taxonomy and Survey [0.0]
  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.
  arXiv  Detail & Related papers  (2024-01-08T13:24:55Z)
• Learning Proximal Operators to Discover Multiple Optima [66.98045013486794]
  We present an end-to-end method to learn the proximal operator across non-family problems. We show that for weakly-ized objectives and under mild conditions, the method converges globally.
  arXiv  Detail & Related papers  (2022-01-28T05:53:28Z)
• 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)
• Variable Division and Optimization for Constrained Multiobjective Portfolio Problems [8.056425814256116]
  Variable division and optimization (D&O) is a frequently utilized algorithm design paradigm in Evolutionary Algorithms (EAs) In this paper, an elitist selection method for partial variables in multiobjective problems is developed. With the help of a mathematical programming, it is achieved on the constrained multiobjective portfolio problems.
  arXiv  Detail & Related papers  (2021-01-21T11:08:23Z)
• Bottleneck Problems: Information and Estimation-Theoretic View [2.7793394375935088]
  Information bottleneck (IB) and privacy funnel (PF) are two closely related optimization problems. We show how to evaluate bottleneck problems in closed form by equivalently expressing them in terms of lower envelope or upper envelope of certain functions.
  arXiv  Detail & Related papers  (2020-11-12T05:16:44Z)
• Robust Optimal Transport with Applications in Generative Modeling and Domain Adaptation [120.69747175899421]
  Optimal Transport (OT) distances such as Wasserstein have been used in several areas such as GANs and domain adaptation. We propose a computationally-efficient dual form of the robust OT optimization that is amenable to modern deep learning applications. Our approach can train state-of-the-art GAN models on noisy datasets corrupted with outlier distributions.
  arXiv  Detail & Related papers  (2020-10-12T17:13:40Z)
• Explanation Generation for Multi-Modal Multi-Agent Path Finding with Optimal Resource Utilization using Answer Set Programming [1.7132914341329848]
  The real-world applications of mMAPF require flexibility and explainability. This paper introduces a method for generating explanations for queries regarding the feasibility and optimality of solutions.
  arXiv  Detail & Related papers  (2020-08-08T18:34:34Z)

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.