Results 51 to 60 of about 64,576 (188)
Integrating Conflict Driven Clause Learning to Local Search
This article introduces SatHyS (SAT HYbrid Solver), a novel hybrid approach for propositional satisfiability. It combines local search and conflict driven clause learning (CDCL) scheme. Each time the local search part reaches a local minimum, the CDCL is
Bertrand Mazure +5 more
core +3 more sources
Análisis de proximidades métrico usando búsqueda tabú
We apply tabu search (TS) in metric multidimensional scaling, obtaining good results comparable to those obtained with simulated annealing. A state in TS is a configuration of n points in a p dimensional space, and a neighbour is defined by the ...
Mario A. Villalobos +1 more
doaj +1 more source
A Local Search Algorithm for Clustering in Software as a Service Networks [PDF]
In this paper we present and analyze a model for clustering in networks that offer Software as a Service (SaaS). In this problem, organizations requesting a set of applications have to be assigned to clusters such that the costs of opening clusters and ...
Gaast, J.P. van der +3 more
core +1 more source
Uzay Çelik Çerçevelerin Tabu Arama Yöntemiyle Optimum Tasarımı [PDF]
Konferans Bildirisi -- Teorik ve Uygulamalı Mekanik Türk Milli Komitesi, 2008Conference Paper -- Theoretical and Applied Mechanical Turkish National Committee, 2008Bu çalışmada, uzay çelik çerçevelerin optimum tasarımında tabu arama yöntemi ...
Değertekin, S. Özgür +2 more
core
Authors wish to give their sincerest thanks to Professor Caro Lucas for his valuable comments during this task, and Ms. Mojdeh Jalali Heravi & Ms. Bahareh Jafari Jashmi for their help through implementation and tests.
Halavati, Ramin, Shouraki, Saeed Bagheri
openaire +2 more sources
Efficient optimisation of structures using tabu search [PDF]
This paper presents a novel approach to the optimisation of structures using a Tabu search (TS) method. TS is a metaheuristic which is used to guide local search methods towards a globally optimal solution by using flexible memory cycles of differing ...
Clarkson, P. John +3 more
core +1 more source
This paper addresses the problem of production tardiness on five parallel production floors at PT Garmen X, each with an identical machine arrangement.
Hana Merlina Hesti Bestari +2 more
doaj +1 more source
Complete local search with memory [PDF]
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart from tabu search, most of these heuristics are memoryless. In this paper we
Ghosh, D., Sierksma, G.
core +1 more source
FARKLI GELİŞ ZAMANLI ÖĞRENME ETKİLİ PARALEL MAKİNELİ ÇİZELGELEME PROBLEMİ
In this study m-identical parallel machine scheduling problem with release date is considered. The objective function of the problem is minimization of the makespan.
Tamer Eren
doaj
Optimised search heuristic combining valid inequalities and tabu search [PDF]
This paper presents an Optimised Search Heuristic that combines a tabu search method with the verification of violated valid inequalities. The solution delivered by the tabu search is partially destroyed by a randomised greedy procedure, and then the ...
Helena Ramalhinho-Lourenço +1 more
core

