Results 31 to 40 of about 9,166,026 (293)
Discrete Optimization, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
LANCIA, Giuseppe +2 more
openaire +1 more source
, 2001 Iterated Local Search (ILS) has many of the desirable features of a metaheuristic: it is simple, easy to implement, robust, and highly effective. The essential idea of ILS lies in focusing the search not on the full space of solutions but on a smaller subspace defined by the solutions that are locally optimal for a given optimization engine.
Helena Ramalhinho Dias Lourenço +2 more
openaire +5 more sources
Local Search for Unsatisfiability [PDF]
, 2006 Local search is widely applied to satisfiable SAT problems, and on some classes outperforms backtrack search. An intriguing challenge posed by Selman, Kautz and McAllester in 1997 is to use it instead to prove unsatisfiability. We investigate two distinct approaches.
Steven D. Prestwich, Inês Lynce
openaire +2 more sources
Experiments to shed light on the best way to use Iterated Local Search for a complex combinatorial problem [PDF]
, 2007 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 +4 more sources
On the Local Convergence of Pattern Search [PDF]
SIAM Journal on Optimization, 2003 The authors consider local convergence properties of pattern search as a class of direct search methods for solving nonlinear programming problems. For simplicity, only the unconstrained case \(\min_{x\in\mathbb{R}^n}\,f(x)\) is considered. Numerical tests are given.
Elizabeth D. Dolan +2 more
openaire +2 more sources
Unsupervised Local Feature Hashing for Image Similarity Search [PDF]
, 2016 The potential value of hashing techniques has led to it becoming one of the most active research areas in computer vision and multimedia. However, most existing hashing methods for image search and retrieval are based on global feature representations ...
Liu, Li, Shao, Ling, Yu, Mengyang
core +1 more source
An analysis of Harmony Search for solving Sudoku puzzles
Soft Computing Letters, 2021 The Harmony Search metaheuristic has been used to solve many different optimization problems. Several papers examined its effectiveness for solving Sudoku puzzles.
Rachel H. Chae, Amelia C. Regan
doaj +1 more source
An Improved Shuffled Frog-Leaping Algorithm for Flexible Job Shop Scheduling Problem
Algorithms, 2015 The flexible job shop scheduling problem is a well-known combinatorial optimization problem. This paper proposes an improved shuffled frog-leaping algorithm to solve the flexible job shop scheduling problem. The algorithm possesses an adjustment sequence
Kong Lu +5 more
doaj +1 more source
Hybrid Gravitational Search Algorithm Based on Fuzzy Logic
IEEE Access, 2017 Gravitational search algorithm (GSA) is a novel heuristic optimization algorithm which is used to search for the global optimal solution by iteration. However, GSA is easy to fall into local minima and convergence slowly.
Kun Qian, Wei Li, Weiyi Qian
doaj +1 more source
Algorithms, 2021 This paper presents an effective stochastic algorithm that embeds a large neighborhood decomposition technique into a variable neighborhood search for solving the permutation flow-shop scheduling problem. The algorithm first constructs a permutation as a
Mehrdad Amirghasemi
doaj +1 more source