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

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

2008
Charlotte Truchet, Marc Christie, Jean-Marie Normand,

This article presents an extension of the Tabu Search (TS) metaheuristic to continuous CSPs, where the domains are represented by floating point-bounded intervals. This leads to redefine the usual TS operators to take into account the special features of interval constraints: real variables encoded in floating points domains, high cardinality of the domains, nature of the CSP where constraints ...

2003
Ahmad A. Al-Yamani, Sadiq M. Sait, Hassan Barada, Habib Youssef,

In this paper, we discuss a parallel tabu search algorithm with implementation in a heterogeneous environment. Two parallelization strategies are integrated: functional decomposition and multi-search threads. In addition, domain decomposition strategy is implemented probabilistically. The performance of each strategy is observed and analyzed in terms of speeding up the search and finding better...

1995
R. Battiti, G. Tecchiolli, A. Sartori P. Lee,

2005
A. Dupont, M. Vasquez, D. Habet,

We present a general approach for solving Constraint Optimization Problems. A Tabu Search is performed on a well-designed Consistent Neighbourhood built using Constraint Programming. After each variable assignment, the conflicting variables are deleted to maintain the consistency of the instantiated constraints. Hence, instead of allowing infeasible moves on complete configurations, it works on...

2000
Luca Di Gaspero, Andrea Schaerf,

The Examination Timetabling problem regards the scheduling for the exams of a set of university courses, avoiding the overlapping of exams having students in common, fairly spreading the exams for the students, and satisfying room capacity constraints. We present a family of solution algorithms for a set of variants of the Examination Timetabling problem. The algorithms are based on tabu search...

2014
Andrew LIM,

Abstrllct. In this paper. we present an effective performance driven placement with glohal routing algorithm for macro cells. Our algorithm uses a hierarchical. divide and conquer, quad-partitioning approach. 'nle quad-partitioning routine uses the Tahu Search technique. Our algorithm uses the concept of proximity of regiuns tu approximate Ille interconnection delays during the placement proces...

2014
William Dyce, Nancy Rodriguez, Benoit Lange, Sebastien Andary, Antoine Seilles,

The use of computer vision techniques to build hands-free input devices has long been a topic of interest to researchers in the field of natural interaction. In recent years Microsoft’s Kinect has brought these technologies to the layman, but the most commonly used libraries for Kinect human pose recognition are closed-source. There is not yet an accepted, effective open-source alternative upon...

1996
Jiefeng Xu, Steve Y. Chiu, Fred Glover,

This paper presents a computational study of a network design problem arising in the telecommunication industry. The objective can be formulated as that of nding an optimal degree constrained Steiner tree in a graph whose nodes and edges are weighted by costs. We develop a probabilistic Tabu Search heuristic for this problem, addressing issues of move evaluations, error correction, tabu memorie...

Journal: :Computers & OR 2015
Eduardo Rodriguez-Tello, Hillel Romero-Monsivais, Gabriel Ramírez-Torres, Frédéric Lardeux,

The Cyclic Bandwidth problem (CB) for graphs consists in labeling the vertices of a guest graph G by distinct vertices of a host cycle Cn (both of order n) in such a way that the maximum distance in the cycle between adjacent vertices in G is minimized. To the best of our knowledge, this is the first research work investigating the use of metaheuristic algorithms for solving this challenging co...

2011
Fred Glover, Saïd Hanafi,

We consider a specialization of tabu search for optimal partitioning problems, which can be used to model a wide variety of binary discrete optimization problems. Our method constitutes a form of tree search that applies under more general assumptions than standard tree search approaches. Moreover, the method allows combinations of problem restriction and problem relaxation strategies that are ...

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

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