Results 81 to 90 of about 50,778 (275)
Precision Restoration to Minimize Soil Loss in a Watershed in the Atlantic Forest Domain
ABSTRACT The Turvo River Watershed, located in the Zona da Mata region of Minas Gerais and part of the Doce River Basin, faces serious problems of erosion and soil degradation, which compromise and reduce the quality of local water resources. Given this scenario, it is essential to implement environmental recovery strategies that prioritize the ...
Rodrigo Nobre Santana +6 more
wiley +1 more source
Performance-based design optimization using uniform deformation theory: a comparison study
The uniform deformation theory (UDT) is a relatively new concept in structural seismic design optimization. However, the results of optimization based on this theory have not yet been compared with other optimization techniques such as metaheuristics ...
R. Karami Mohammadi, A. Ghasemof
doaj +1 more source
ASSET ALLOCATION AND PORTFOLIO OPTIMIZATION PROBLEMS WITH METAHEURISTICS: A LITERATURE SURVEY [PDF]
The main objective of Markowitz work is seeking optimal allocation of wealth on a defined number of assets while minimizing risk and maximizing returns of expected portfolio.
Bilel JARRAYA
doaj
Metaheuristic algorithms for the simultaneous slot allocation problem [PDF]
In this paper, we formalize the simultaneous slot allocation problem. It is an extension of the problem currently tackled for allocating airport slots: it deals with all airports simultaneously and it enforces the respect of airspace sector capacities ...
Lorenzo Castelli +2 more
core
On the Mean‐Field Limit of Consensus‐Based Methods
ABSTRACT Consensus‐based optimization (CBO) employs a swarm of particles evolving as a system of stochastic differential equations (SDEs). Recently, it has been adapted to yield a derivative free sampling method referred to as consensus‐based sampling (CBS). In this paper, we investigate the “mean‐field limit” of a class of consensus methods, including
Marvin Koß, Simon Weissmann, Jakob Zech
wiley +1 more source
ABSTRACT Modern engineering systems require advanced uncertainty‐aware model updating methods that address parameter correlations beyond conventional interval analysis. This paper proposes a novel framework integrating Riemannian manifold theory with Gaussian Process Regression (GPR) for systems governed by Symmetric Positive‐Definite (SPD) matrix ...
Yanhe Tao +3 more
wiley +1 more source
Experiments to shed light on the best way to use Iterated Local Search for a complex combinatorial problem [PDF]
Iterated Local Search (ILS) is a popular metaheuristic search technique for use on combinatorial optimisation problems. As with most such techniques, there are many ways in which ILS can be implemented.
Wright, M B
core
Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs
ABSTRACT A 2‐packing set for an undirected, weighted graph G=(V,E,w)$$ G=\left(V,\kern0.3em E,\kern0.3em w\right) $$ is a subset 𝒮⊆V such that any two vertices v1,v2∈𝒮 are not adjacent and have no common neighbors. The Maximum Weight 2‐Packing Set problem that asks for a 2‐packing set of maximum weight is NP$$ \mathbf{NP} $$‐hard. Next to 13 novel data
Jannick Borowitz +2 more
wiley +1 more source
This paper presents a review of quantum-inspired population-based metaheuristics. Quantum-inspired algorithms were born when there were no quantum computers; they demonstrated to have interesting characteristics providing good results in classical ...
Oscar H. Montiel Ross
doaj +1 more source
A study on exponential-size neighborhoods for the bin packing problem with conflicts
We propose an iterated local search based on several classes of local and large neighborhoods for the bin packing problem with conflicts. This problem, which combines the characteristics of both bin packing and vertex coloring, arises in various ...
Capua, Renatha +3 more
core +1 more source

