Results 81 to 90 of about 55,623 (279)

Precision Restoration to Minimize Soil Loss in a Watershed in the Atlantic Forest Domain

open access: yesLand Degradation &Development, EarlyView.
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

A metaheuristic image cryptosystem using improved parallel model and many‐objective optimization

open access: yesIET Image Processing
Metaheuristic is one of the techniques to improve the security of image encryption. However, existing metaheuristic image cryptosystems based on metaheuristic may have convergence difficulties during the optimization process, which cause insecurity and ...
Zihao Xin   +4 more
doaj   +1 more source

Current Trends in Simheuristics: from smart transportation to agent-based simheuristics [PDF]

open access: yes, 2018
Simheuristics extend metaheuristics by adding a simulation layer that allows the optimization component to deal efficiently with scenarios under uncertainty.
Estrada-Moreno, Alejandro   +4 more
core  

A collaborative ant colony metaheuristic for distributed multi-level lot-sizing

open access: yes, 2012
The paper presents an ant colony optimization metaheuristic for collaborative planning. Collaborative planning is used to coordinate individual plans of self-interested decision makers with private information in order to increase the overall benefit of ...
Buer, Tobias   +2 more
core   +1 more source

METAHEURISTICS AND LARGE‐SCALE OPTIMIZATION

open access: yesTechnological and Economic Development of Economy, 2006
„Metaheuristics and large-scale optimization" Technological and Economic Development of Economy, 12(1), p ...
openaire   +4 more sources

On the Mean‐Field Limit of Consensus‐Based Methods

open access: yesMathematical Methods in the Applied Sciences, EarlyView.
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

A New Metaheuristic Bat-Inspired Algorithm

open access: yes, 2010
Metaheuristic algorithms such as particle swarm optimization, firefly algorithm and harmony search are now becoming powerful methods for solving many tough optimization problems.
J. Kennedy   +9 more
core   +1 more source

Ellipsoid‐Based Interval‐Type Uncertainty Model Updating Based on Riemannian Manifold and Gaussian Process Model

open access: yesInternational Journal of Mechanical System Dynamics, EarlyView.
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

The Vehicle Routing Problem with Service Level Constraints

open access: yes, 2017
We consider a vehicle routing problem which seeks to minimize cost subject to service level constraints on several groups of deliveries. This problem captures some essential challenges faced by a logistics provider which operates transportation services ...
Bulhões, Teobaldo   +3 more
core   +1 more source

Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs

open access: yesNetworks, EarlyView.
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

Home - About - Disclaimer - Privacy