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

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

Journal: :J. Heuristics 2002
Ahmad A. Al-Yamani, Sadiq M. Sait, Habib Youssef, Hassan Barada,

In this paper, we present the parallelization of tabu search on a network of workstations using PVM. Two parallelization strategies are integrated: functional decomposition strategy and multi-search threads strategy. In addition, domain decomposition strategy is implemented probabilistically. The performance of each strategy is observed and analyzed. The goal of parallelization is to speedup th...

1996
Fred Glover,

Tabu search (TS) has provided advances for solving difficult optimization problems in many domains. At the same time, fundamental TS strategies are often not applied as effectively as they might be, and their underlying rationale is often not completely understood. We examine basic concepts and principles of tabu search, emphasizing those that have sometimes led to applying the label "adaptive ...

2003
Luis B. Morales,

Some papers have dealt with the construction of 2-concurrence designs as an optimization problem. In this paper we generalize these results to formulate also the construction of partially balanced incomplete block designs with 2 associate classes as a combinatorial optimization problem. We will propose an algorithm based on tabu search to construct many of these designs. Our algorithm was able ...

Journal: :ITOR 2014
Franco Mascia, Paola Pellegrini, Mauro Birattari, Thomas Stützle,

On-line parameter adaptation schemes are widely used in metaheuristics. They are sometimes preferred to off-line tuning techniques for two main reasons. First, they promise to achieve good performance even on new instance families that have not been considered during the design or the tuning phase of the algorithm. Second, it is assumed that an on-line scheme could adapt the algorithm’s behavio...

2012
Hany Kamal, Marceau Coupechoux, Philippe Godlewski,

In this paper, we present and analyze a Tabu Search (TS) algorithm for Dynamic Spectrum Allocation (DSA) in cellular networks. We study a case where an operator is providing packet services to the endusers. The objective of the cellular operator is to maximize its reward while taking into account the trade-off between the spectrum cost and the revenues obtained from end-users. These revenues ar...

Journal: :RAIRO - Operations Research 2010
Jacek Blazewicz, Marcin Borowski, Piotr Formanowicz, Tomasz Glowacki,

Determining amino acid sequences of protein molecules is one of the most important issues in molecular biology. These sequences determine protein structure and functionality. Unfortunately, direct biochemical methods for reading amino acid sequences can be used for reading short sequences only. This is the reason, which makes peptide assembly algorithms an important complement of these methods....

Journal: :Pattern Recognition Letters 1997
Qifa Ke, Tianzi Jiang, Songde Ma,

In this paper, we propose a novel method for extracting the geometric primitives from geometric data, which is essentially an optimization problem. Specifically, we use tabu search to solve geometric primitive extraction problem. To the Ž . best of our knowledge, it is the first attempt that tabu search is used in computer vision. Our tabu search TS has a number Ž . Ž . of advantages: 1 TS avoi...

Journal: :Comp. Opt. and Appl. 2011
Abraham Duarte, Manuel Laguna, Rafael Martí,

Given a matrix of weights, the Linear Ordering Problem (LOP) consists of finding a permutation of the columns and rows in order to maximize the sum of the weights in the upper triangle. This well known NP-complete problem can also be formulated on a complete weighted graph, where the objective is to find an acyclic tournament that maximizes the sum of arc weights. The variant of the LOP that we...

Journal: :J. Network and Computer Applications 2004
Heng Wang, Jie Fang, Hua Wang, Ya-Min Sun,

As a NP-Complete problem, multicast routing with delay constraint is a research difficulty in routing problem. Tabu Search is artificial intelligence algorithm, which is an extension of local search algorithm and has simple realization and well properties. In this paper, an efficient algorithm based on Tabu Search for Delay-Constrained Low-Cost Multicast Routing is proposed to solve delay-const...

Journal: :CoRR 2017
Kojo Sarfo Gyamfi, James Brusey, Andrew Hunt,

The Tabu Search (TS) metaheuristic has been proposed for K-Means clustering as an alternative to Lloyd’s algorithm, which for all its ease of implementation and fast runtime, has the major drawback of being trapped at local optima. While the TS approach can yield superior performance, it involves a high computational complexity. Moreover, the difficulty in parameter selection in the existing TS...

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

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