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

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

2005
Sébastien Sorlin, Christine Solnon,

Graph matching is often used for image recognition. Different kinds of graph matchings have been proposed such as (sub)graph isomorphism or error-tolerant graph matching, giving rise to different graph similarity measures. A first goal of this paper is to show that these different measures can be viewed as special cases of a generic similarity measure introduced in [8]. This generic similarity ...

Journal: :European Journal of Operational Research 2004
Laurent D. Michel, Pascal Van Hentenryck,

The uncapacitated warehouse location problem (UWLP) is a heavily studied combinatorial optimization problem, which has been tackled by various approaches, such as linear-programming branch and bound, genetic algorithms, and local search. This paper presents an simple, yet robust and efficient, tabu search algorithm for the UWLP. The algorithm was evaluated on the standard OR Library benchmarks ...

Journal: :JORS 2011
Rafael Caballero, Manuel Laguna, Rafael Martí, Julián Molina Luque,

We propose a hybrid heuristic procedure based on scatter search and tabu search for the problem of clustering objects to optimize multiple criteria. Our goal is to search for good approximations of the efficient frontier for this class of problems and provide a means for improving decision making in multiple application areas. Our procedure can be viewed as an extension of SSPMO (a scatter sear...

2003
Hoong C. Lau, Xiaomin Jia, Wee C. Wan,

Presently, most tabu search designers devise their applications without considering the potential of design and code reuse, which consequently prolong the development of subsequent applications. In this paper, we propose a software solution known as Tabu Search Framework (TSF), which is a generic C++ software framework for tabu search implementation. The framework excels in code recycling throu...

2003
E. Burke, E. Soubeiga,

Hyperheuristics can be defined to be heuristics which choose between heuristics in order to solve a given optimisation problem. A number of hyperheuristics have been developed over the past few years. Here we propose a new hyperheuristic framework within which heuristics compete against one another. The rules for competition are motivated by the principles of reinforcement learning. We analyse ...

2004
Nattanun Thatphithakkul, Supphanat Kanokphara,

Hidden Markov Model (HMM) is regularly trained via mathematic functions optimized by gradient-based methods such as Baum-Welch (BW) algorithm. However, optimization from gradient-based methods usually yields only a local optimum. In this paper, Tabu search (TS), an artificial intelligent (AI) technique able to step back from a local optimum and search for other optima, is employed to attack thi...

Journal: :European Journal of Operational Research 2000
Rachid Chelouah, Patrick Siarry,

A new algorithm called Enhanced Continuous Tabu Search (ECTS) is proposed for the global optimization of multiminima functions. It results from an adaptation of combinatorial Tabu Search which aims to follow, as close as possible, Glover's basic approach. In order to cover a wide domain of possible solutions, our algorithm ®rst performs the diversi®cation: it locates the most promising areas, b...

2004
Tariq Riaz, Yi Wang, Kuo-Bin Li,

Tabu search is a meta-heuristic approach that is found to be useful in solving combinatorial optimization problems. We implement the adaptive memory features of tabu search to align multiple sequences. Adaptive memory helps the search process to avoid local optima and explores the solution space economically and effectively without getting trapped into cycles. The algorithm is further enhanced ...

2010
Jacek Blazewicz, Marta Kasprzak, Aleksandra Swiercz,

The DNA sequencing is an elementary approach in computational molecular biology, leading to recognizing genetic information of organisms. The information is encoded as a sequence of nucleotides (basic particles of DNA) composing double helix, which in human beings reaches the length of 3 billions. There are four types of the nucleotides: A, C, G, and T (the abbreviations of names of their nitro...

Journal: :Computers & Chemical Engineering 2004
B. Lin, D. C. Miller,

This paper presents a meta-heuristic optimization algorithm, Tabu Search (TS), and describes how it can be used to solve a wide variety of chemical engineering problems. Modifications to the original algorithm and constraint handling techniques are described and integrated to extend its applicability. All components of TS are described in detail. Initial values for each key parameter of TS are ...

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

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