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

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

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 ...

2002
Peng Hui Tan, Lars Rasmussen,

In this paper, we compare several optimization methods using tabu search heuristics for solving the maximum likelihood (ML) multiuser detection problem. The purpose of using these algorithms is to provide complexity constraint alternatives to solving this NPhard problem. It is now possible to show analytically that these methods exactly solve the ML problem, however, numerical examples show tha...

Journal: :CoRR 2014
Andy M. Connor, Keith A. Seffen, Geoffrey T. Parks, P. John Clarkson,

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 time spans. Results are presented for the well established ten bar truss problem and compared to results published in the literature. In the first...

2010
Filomena Ferrucci, Carmine Gravino, Rocco Oliveto, Federica Sarro,

Some studies have been recently carried out to investigate the use of search-based techniques in estimating software development effort and the results reported seem to be promising. Tabu Search is a meta-heuristic approach successfully used to address several optimization problems. In this paper, we report on an empirical analysis carried out exploiting Tabu Search on two publicly available da...

1999
Andrea Schaerf,

The high-school timetabling problem consists in assigning all the lectures of a high school to the time periods in such a way that no teacher (or class) is involved in more than one lecture at a time and other side constraints are satisfied. The problem is NPcomplete and is usually tackled using heuristic methods. This paper describes a solution algorithm (and its implementation) based on Z’abz...

2001
Concettina GUERRA,

The problem of detecting straight lines arises frequently in image processing and computer vision. Here we consider the problem of extracting lines from range images and more generally from sets of three-dimensional (3D) points. The problem is stated as follows. Given a set Γ of points in 3D space and a non-negative constant , determine the line that is at a distance at most from the maximal nu...

2002
Muhammad Atif Tahir, Habib Youssef, A. Almulhem, Sadiq M. Sait,

The research and industrial communities have recently been striving to make the Internet capable of supporting multicast traffic sources. A multicast tree for a given multicast source is a tree rooted at the source and all its leaves being members in the multicast group. Tree cost is measured by the utilization of tree links. The problem to be solved is to find a minimum cost multicast tree. Th...

1995
Colin R. Reeves,

Recent work 1] has highlighted the value of using a restricted candidate list in the implementation of the Tabu Search (TS) method. The original motivation for this approach was to reduce the amount of computation involved in applying TS to the solution of owshop sequencing problems. However, it is becoming evident that this concept of restricted neighbourhood search (RNS) can itself act as a d...

2009
Gerardo Berbeglia, Jean-François Cordeau, Gilbert Laporte,

6 This paper introduces a hybrid algorithm for the dynamic dial-a-ride problem in which 7 service requests arrive in real time. The hybrid algorithm combines an exact constraint 8 programming algorithm and a tabu search heuristic. An important component of the tabu 9 search heuristic consists of three scheduling procedures which are executed sequentially. 10 Experiments show that the constraint...

2013
Wojciech Chmiel, Piotr Kadluczka, Joanna Kwiecien, Boguslaw Filipowicz, Przemyslaw Pukocz,

In this paper we introduce a method for optimisation of strategic tasks using an approximation algorithm. We propose the mathematical model and algorithm for solving this problem near optimality. An overall motivation for the development of the proposed algorithm is discussed with detailed e ciency analysis. From the end users' perspective the proposed method has practical application because i...

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

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