نتایج جستجو برای Tabu search

تعداد نتایج: 223935  

Journal: :Pattern Recognition 1998
Pasi Fränti, Juha Kivijärvi, Olli Nevalainen,

A tabu search algorithm is proposed for the codebook generation in vector quantization. The key question is the definition of neighboring solution. Making random modifications to the current solution is not sufficient alone. The proposed algorithm first makes non-local changes to the codebook which is then fine-tuned by the generalized Lloyd algorithm (GLA). For a set of gray scale images, the ...

Journal: :Networks 2000
Celso C. Ribeiro, Maurício C. de Souza,

Given an undirected graph with weights associated with its nodes, the Steiner tree problem consists in nding a minimum weight subgraph spanning a given subset of nodes (terminals) of the original graph. In this paper, we describe an improved tabu search algorithm for the Steiner problem in graphs, based on a neighborhood deened by insertions and eliminations of Steiner nodes. Move estimations, ...

2013

Maintenance of water distribution systems is becoming a critical infrastructure problem. Good maintenance practices are necessary to extend the life of water distribution system components and an optimal maintenance effort can further prolong their useful life. The decision making problem of determining the best maintenance strategy which would minimize the total discounted maintenance cost ove...

1999
Luis B. Morales, Felipe Maldonado,

In this paper we describe a scheduling problem for certain types of tournaments. It is formulated as a discrete minimization problem. Using a tabu search method we solve various problem instances of di erent size and complexity. The in uence of the tabu list size on the performance of the algorithm is studied. Tabu search is also compared with previous optimization techniques, which are availab...

Journal: :Computers & OR 1995
Fred Glover, James P. Kelly, Manuel Laguna,

-Genetic algorithms and tabu search have a number of significant differences. They also have some common bonds, often unrecognized. We explore the nature of the connections between the methods, and show that a variety of opportunities exist for creating hybrid approaches to take advantage of their complementary features. Tabu search has pioneered the systematic exploration of memory functions i...

2009
Sadiq M. Sait, Mohammed H. Sqalli,

The problem of setting the Open Shortest Path First (OSPF) weights on links such that congestion can be avoided is proved to be NP-hard. Many iterative heuristics have been applied to solve the OSPF weight setting (OSPFWS) problem. As the size of any combinatorial optimization problem increases, it becomes more difficult to find an optimum solution using sequential algorithms. Parallelization o...

2004
RAMÓN ÁLVAREZ-VALDÉS, ENRIC CRESPO, JOSÉ M. TAMARIT,

A combination of heuristics, based on Tabu Search, first finds a solution in which no student has two exams simultaneously and then improves it by evenly spacing the exams in the examination period. The algorithm has been imbedded into a package to be used by Faculty administrators and proposes solutions to be considered by the parties involved: administration, departments and students. Computa...

Journal: :Transportation Science 1999
Michel Gendreau, François Guertin, Jean-Yves Potvin, Éric D. Taillard,

1995
Daniel Costa,

We present in this paper a new evolutionary procedure for solving general optimization problems that combines eeciently the mechanisms of genetic algorithms and tabu search. In order to explore the solution space properly interaction phases are interspersed with periods of optimization in the algorithm. An adaptation of this search principle to the National Hockey League (NHL) problem is discus...

2014
Gintaras Palubeckis, Armantas Ostreika, Arūnas Tomkevičius,

Given an edge-weighted undirected graph with weights specifying dissimilarities between pairs of objects, represented by the vertices of the graph, the clique partitioning problem (CPP) is to partition the vertex set of the graph into mutually disjoint subsets such that the sum of the edge weights over all cliques induced by the subsets is as small as possible. We develop an iterated tabu searc...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید