Results 31 to 40 of about 794,304 (306)
Anytime Pareto local search [PDF]
European Journal of Operational Research, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jérémie Dubois-Lacoste +2 more
openaire +4 more sources
Formulation space search approach for the teacher/class timetabling problem [PDF]
Yugoslav Journal of Operations Research, 2008 We consider the well known NP-hard teacher/class timetabling problem. Variable neighborhood search and tabu search heuristics are developed based on idea of the Formulation Space Search approach.
Kochetov Yuri +2 more
doaj +1 more source
Heuristics for NP-hard optimization problems - simpler is better!?
Logistics & Sustainable Transport, 2015 We provide several examples showing that local search, the most basic metaheuristics, may be a very competitive choice for solving computationally hard optimization problems. In addition, generation of starting solutions by greedy heuristics should be at
Žerovnik Janez
doaj +1 more source
Which Local Search Operator Works Best for the Open-Loop TSP?
Applied Sciences, 2019 The traveling salesman problem (TSP) has been widely studied for the classical closed-loop variant. However, very little attention has been paid to the open-loop variant.
Lahari Sengupta +2 more
doaj +1 more source
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 +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
Local search for the maximumk-plex problem
, 2020 The maximum k-plex problem is an important, computationally complex graph based problem. In this study an effective k-plex local search (KLS) is presented for solving this problem on a wide range of graph types.
Pullan, Wayne
core +1 more source
A New Local Search for Continuous Location Problems [PDF]
, 2013 This paper presents a new local search approach for solving continuous location problems. The main idea is to exploit the relation between the continuous model and its discrete counterpart.
Mladenovic, Nenad +3 more
core +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
Toward an automaton Constraint for Local Search [PDF]
, 2009 We explore the idea of using finite automata to implement new constraints for local search (this is already a successful technique in constraint-based global search). We show how it is possible to maintain incrementally the violations of a constraint and
Flener, Pierre, +5 more
core +1 more source