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

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

2002
J. POŽIVIL,

The paper describes an algorithm for solving the scheduling problem of a hybrid flowshop (flowshop with multiple processors, FSMP). The algorithm is a combination of genetic algorithm and tabu search, and the batch processes it is applied on are modeled by a model of time requirements. The paper describes the algorithm and compares its performance with other optimization techniques.

Journal: :Bioinformatics 2005
Jacek Blazewicz, Marta Szachniuk, Adam Wójtowicz,

MOTIVATION Liquid state nuclear magnetic resonance (NMR) spectroscopy has now been well established as a method for RNA tertiary structure determination. Most of the steps involved in the determination of RNA molecules are performed using computer programs. They however, do not apply to resonance assignment being the starting point of the whole procedure. We propose a tabu search algorithm as a...

Journal: :J. Inf. Sci. Eng. 2001
Xiao-Dan Mei, Sheng-He Sun, Jeng-Shuang Pan, Tsong-Yi Chen,

$EVWUDFW ,Q WKLV SDSHU WKH WDEX VHDUFK DOJRULWKP LV HPSOR\HG WR WUDLQ +LGGHQ 0DUNRY 0RGHO +00 WR VHDUFK RXW WKH RSWLPDO SDUDPHWHU VWUXFWXUH RI +00 IRU DXWRPDWLF VSHHFK UHFRJQLWLRQ 7KH SURSRVHG 76 +00 WUDLQLQJ SURYLGHG D PHFKDQLVP WKDW DOORZV WKH VHDUFKLQJ SURFHVV WR HVFDSH IURP WKH ORFDO RSWLPXP DQG REWDLQ D QHDU JOREDO RSWLPXP ([SHULPHQWDO UHVXOWV VKRZ WKDW WKH 76 +00 WUDLQLQJ KDV D KLJKHU SUR...

1997
John B. Chambers, Wesley Barnes,

In the classical job shop scheduling problem (JSSP), n jobs are processed to completion on m unrelated machines. Each job requires processing on each machine exactly once. For each job, technology constraints specify a complete, distinct routing which is fixed and known in advance. Processing times are sequence-independent, fixed, and known in advance. Each machine is continuously available fro...

2004
S.,

The application of Tabu Search Algorithm (TSA) technique to solve Economic Dispatch problem (ED) with non-smooth fuel cost function is reported in this paper. Results from MATLAB on Pentium Ill-500 MHz system for three case studies are presented. Effectiveness of method was compared with many conventional methods. Result shows that the proposed method can provide accurate solution with rapid co...

2001
SADAN KULTUREL-KONAK, ALICE E. SMITH, DAVID W. COIT,

SADAN KULTUREL-KONAK1, ALICE E. SMITH2 and DAVID W. COIT3 1Management Information Systems, Penn State Berks-Lehigh Valley College, Tulpehocken Road, P.O. Box 7009, Reading, PA 19610-6009, USA E-mail: [email protected] 2Department of Industrial and Systems Engineering, Auburn University, 207 Dunstan Hall, Auburn, AL 36849, USA E-mail: [email protected] 3Department of Industrial and Systems Engi...

2001
SUPAPORN SUWANNARONGSRI, SUNPASIT LIMNARARAT, DEACHA PUANGDOWNREONG,

A new hybrid tabu search (HTS) method for solving assembly line balancing problems is proposed in this paper. The tabu search (TS) method is combined with the genetic algorithm (GA) to identify and provide solutions for assembly line balancing problems. With the proposed HTS method, the TS method can well address the number of tasks assigned for each workstation, while the GA can also assign th...

2000
JiaHua Weng, Hiroki Okubo, Hisashi Onari,

Flexible assembly job shop scheduling has been proved to be an NP-hard problem. To reduce the complexity, it is always divided into 2 sub-problems: routing sub-problem and sequencing sub-problem. In this paper, in order to develop a solution with high accuracy, we propose a method that can deal with these two sub-problems concurrently. Tabu search, one of the meta-heuristics, is adopted. Some e...

Journal: :JDCTA 2010
Yongguo Liu, Jianrui Hao,

In this article, a novel approach is proposed to predict RNA secondary structure called RNA secondary structure prediction based on Tabu Search (RNATS). In the RNATS algorithm, two search models, intensification search and diversification search, are developed to exploit the local regions around the current solution and explore the unvisited solution space, respectively. Simulation experiments ...

2003
Yangjie Peng, Lipo Wang, Boon-Hee Soong,

The channel assignment problem (CAP) in cellular systems has the task of planning the reuse of the limited available frequencies in a spectrum-efficient and interference-minimal way. We adopt an integer programming representation of the static channel assignment (SCA) formulated by Smith and Palaniswami. A tabu search (TS) algorithm is implemented to solve this problem. Two forms of tabu list a...

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

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