Results 11 to 20 of about 673,864 (284)
Particle Swarm Optimization with Enhanced Global Search and Local Search
Journal of Intelligent Systems, 2017 In order to mitigate the problems of premature convergence and low search accuracy that exist in traditional particle swarm optimization (PSO), this paper presents PSO with enhanced global search and local search (EGLPSO).
Wang Jie, Li Hongwen
doaj +2 more sources
Bayesian Optimization with Local Search [PDF]
, 2020 Global optimization finds applications in a wide range of real world problems. The multi-start methods are a popular class of global optimization techniques, which are based on the ideas of conducting local searches at multiple starting points. In this work we propose a new multi-start algorithm where the starting points are determined in a Bayesian ...
Gao, Yuzhou, Yu, Tengchao, Li, Jinglai
openaire +2 more sources
Approximate Local Search in Combinatorial Optimization [PDF]
SIAM Journal on Computing, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Orlin, James +2 more
openaire +4 more sources
A particle swarm optimization based memetic algorithm for dynamic optimization problems [PDF]
, 2009 Copyright @ Springer Science + Business Media B.V. 2010.Recently, there has been an increasing concern from the evolutionary computation community on dynamic optimization problems since many real-world optimization problems are dynamic.
AS Uyar +25 more
core +4 more sources
A New Metaheuristic Inspired by the Vapour-Liquid Equilibrium for Continuous Optimization
Applied Sciences, 2018 In this article, a novel optimization metaheuristic based on the vapour-liquid equilibrium is described to solve highly nonlinear optimization problems in continuous domains.
Enrique M. Cortés-Toro +4 more
doaj +1 more source
Optimal Network Topologies for Local Search with Congestion [PDF]
Physical Review Letters, 2002 The problem of searchability in decentralized complex networks is of great importance in computer science, economy and sociology. We present a formalism that is able to cope simultaneously with the problem of search and the congestion effects that arise when parallel searches are performed, and obtain expressions for the average search cost--written in
Guimerà, R +4 more
openaire +6 more sources
, 2016 A greedy randomized adaptive search procedure (GRASP) is an itera- tive multistart metaheuristic for difficult combinatorial optimization problems. Each GRASP iteration consists of two phases: a construction phase, in which a feasible solution is ...
De Santis, M. +4 more
core +1 more source
Paroid search: generic local combinatorial optimization
Discrete Applied Mathematics, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rardin, Ronald L., Sudit, Moises
openaire +2 more sources
Adaptive Self-Scaling Brain-Storm Optimization via a Chaotic Search Mechanism
Algorithms, 2021 Brain-storm optimization (BSO), which is a population-based optimization algorithm, exhibits a poor search performance, premature convergence, and a high probability of falling into local optima.
Zhenyu Song +5 more
doaj +1 more source
An improved crow search algorithm with multi strategy disturbance [PDF]
ITM Web of Conferences, 2022 As a new meta heuristic intelligent algorithm, crow search algorithm simulates the behavior of crows following each other and stealing food. Due to the simplicity and robustness of crow search algorithm, it has been successfully applied in many fields ...
Huang Huadong, Liao Heng
doaj +1 more source