24 papers · ranked by Valyu relevance
S. Westerhof, T. Hofman
This paper presents an optimization framework for Spatial Packaging of Interconnected Systems with Physical Interactions (SPI2) that addresses the geometric challenges of three-dimensional component placement and routing. While SPI2 generally includes physical interactions, this study isolates the spatial optimization…
C. Feng, Minyang Chen, Zhuozhao Li, Ran Cheng
—Since Differential Evolution (DE) is sensitive to strategy choice, most existing variants pursue performance through adaptive mechanisms or intricate designs. While these approaches focus on adjusting strategies over time, the structural benefits that static strategy diversity may bring remain largely unexplored. To…
Zihao Cheng, Li Cao, Yang Qiu, Yinggao Yue + 1 more
Aiming at the problems of uneven population initialization distribution, easy trapping in local optima, unbalanced exploration and exploitation capabilities, insufficient optimization accuracy and convergence speed of the original Greater Cane Rat Algorithm (GCRA), this paper proposes a Chaos-Integrated…
Junhao Wei, Yanzhao Gu, Ran Zhang, Yanxiao Li + 5 more
Wireless Sensor Networks (WSNs) are essential for monitoring and communication in complex environments, where coverage optimization directly affects performance and energy efficiency. However, traditional algorithms such as the Whale Optimization Algorithm (WOA) often suffer from limited exploration and premature…
Chaochuan Jia, Yaqi Yang, Yujie Cheng, Maosheng Fu + 4 more
To tackle the drawbacks inherent in the Chinese Pangolin Optimization (CPO) algorithm, such as uneven population initialization distribution and a tendency to fall into local optimal solutions, this paper proposes an ACDCPO algorithm that integrates boundary-adaptive contraction initialization, Cauchy inverse…
Mohamed Elhosseny, Mahmoud Abdel-Salam, Anand Nayyar, Emre Çelik + 3 more
The Dung Beetle Optimization (DBO) algorithm is a relatively recent metaheuristic known for its simplicity, versatility, and low parameter dependence, making it a valuable tool for solving complex optimization problems. Despite its potential, DBO suffers from limitations such as slow convergence and premature…
Li Lan, Zhang Qi
This paper presents an Enhanced parrot Optimizer (EPO), a novel metaheuristic algorithm that synergistically integrates multiple advanced strategies to address the critical limitations of the original parrot Optimizer (PO)-namely, poor initial population diversity, susceptibility to premature convergence, slow…
Yacine Bouali, Basem Alamri
Accurate identification of photovoltaic (PV) cell and module parameters is essential for reliable electrical modeling, performance assessment, and long-term energy yield prediction. This task is commonly formulated as an optimization problem, where the root mean square error (RMSE) between measured and estimated…
Mazen Alamir
This paper discusses some aspects related to gradient-based optimization algorithms with special focus on the requirements associated to their use in the implementation of Nonlinear Model Predictive Control. Based on a dedicated discussion, a new algorithm, termed Search and Accelerate (SaA) is proposed that mixes…
Authors not listed
Data-driven approaches offer great potential for accelerating ab initio electronic structure calculations of molecules and materials but their transferability is often limited due to the vast amount of data needed for training, including when addressing the need to fine-tune universal models for each specific system to…
Zhixin Han, Ying Qiao, Hongxin Fu, Yuelin Gao + 1 more
With the increasing complexity of optimization problems, existing methods are often inadequate for addressing these challenges, creating a pressing need for more versatile and robust approaches capable of solving a wide range of optimization problems. Meta-heuristic algorithms have become powerful tools in this regard…
Camilo Chacón Sartori, Christian Blum
Automatic algorithm configuration tools such as irace efficiently tune parameter values but leave algorithmic code unchanged. This paper introduces a first version of irace-evo, an extension of irace that integrates code evolution through large language models (LLMs) to jointly explore parameter and code spaces. The…
Yarong Li, Chuandong Qin, Heming Jia
Inspired by the hovering, diving, and cooperative hunting behaviors of the pied kingfisher, the Pied Kingfisher Optimizer (PKO) has demonstrated competitive performance in optimization tasks. However, it exhibits several phase-specific limitations, including uneven population distribution caused by random…
Authors not listed
Recent advances in machine learning force fields (MLFF) have significantly extended the reach of atomistic simulations. Continuous progress in this field requires reliable reference datasets, accurate MLFF architectures, and efficient active learning strategies to enable robust modeling of complex molecular and…
Authors not listed
Finding the most stable adsorption geometry of a flexible molecule on a catalytic surface remains a key challenge due to the high dimensionality and ruggedness of the potential energy surface. We present a Gradient-Enhanced Genetic Algorithm (GE-GA) for the global optimization of adsorbate–surface configurations…
Albert Jiménez-Blanco, Lorién López-Villellas, Juan Carlos Moure, Miquel Moreto + 1 more
Sequence-to-graph alignment is a central problem in bioinformatics, with applications in multiple sequence alignment (MSA) and pangenome analysis, among others. However, current algorithms for optimal affine-gap alignment impose high memory and computational requirements, limiting their scalability to aligning long…
Authors not listed
Machine olfaction—the artificial replication of the sense of smell—faces significant challenges due to the absence of large, standardized training datasets. Unlike vision, language, and audio models, which benefit from extensive corpora such as ImageNet, GLUE, and AudioSet, olfaction lacks scaled equivalents and…
Ruya Fan, Yan Chen, Bo Shan, Erfan Babaee Tirkolaee
Aiming at the problem of matching scarce resources among donors, recipients, and medical institutions in organ transplantation, a stable three-sided matching method is proposed. Firstly, in view of the preference structure characteristics of the problems in the context of organ transplantation, a mixed preference…
João Sartori, Eduardo Krempser, Ana Carolina Ramos Guimarães, Lucas de Almeida Machado
The optimization of protein sequences for enhanced binding and stability remains a formidable challenge in bioengineering due to the vastness of sequence space. Existing state-of-the-art methods, including traditional structure-based design and protein language models, use fitness estimators as objective functions to…
Ryo Tsuchihashi, Misaki Kinoshita
Cyclic peptides have emerged as a pivotal modality for next-generation therapeutics, due to their superior biocompatibility, high selectivity, and structural stability. While AI-driven peptide design has advanced rapidly, conventional optimization algorithms are often constrained by initialization biases, which impede…
Authors not listed
The complete active space self-consistent field (CASSCF) method is essential for describing complex photochemical processes, but its application in ab initio molecular dynamics is often limited by the computational cost associated with four-center two-electron repulsion integrals (ERIs). We present the first…
Authors not listed
Exploring the potential energy surface to sample transition state regions is crucial to understand the atomic processes that govern chemical reactivity. Ideally, the exploration does not require any collective variables that are based on prior chemical domain knowledge. With this in mind, we adapt the stochastic saddle…
Yukun Yang, Wolfgang Maass
Most current methods for goal-directed action selection in the face of changing goals and contingencies require DNNs or LLMs. Therefore they are less suited for implementation in edge devices, where low energy-consumption is imperative. The brain shows that similar functionality can be produced with just 20W, even with…
Christian Konrad, Kheeran K. Naidu, Archie Walton, Eric Wang
Assadi, Liu, and Tarjan [SOSA'21] gave an auction algorithm that outputs a $(1-ε)$-approximation to Maximum Matching in bipartite graphs. Their algorithm computes a sequence of $O(\frac{1}{ε^2})$ maximal matchings in subgraphs of the input graph and can be implemented in the multi-pass streaming setting with…