Results 1 to 10 of about 3,752,335 (283)
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
An improved local search algorithm for 3-SAT [PDF]
, 2004 We slightly improve the pruning technique presented in Dantsin et. al.
Brueggemann, T., Kern, W.
core +5 more sources
Optimal network topologies for local search with congestion [PDF]
, 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 ...
A. Arenas +15 more
core +4 more sources
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
, 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
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
NILS: a Neutrality-based Iterated Local Search and its application to Flowshop Scheduling [PDF]
, 2011 This paper presents a new methodology that exploits specific characteristics from the fitness landscape. In particular, we are interested in the property of neutrality, that deals with the fact that the same fitness value is assigned to numerous ...
Dhaenens, Clarisse +4 more
core +4 more sources
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