نتایج جستجو برای: guided tabu search

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

2008
Kittipong Ekkachai Pradondet Nilagupta

This paper presents a packing algorithm to solve an irregular shape strip packing problem. The polygons are packed in strip material, which limits a bin width but not limits a bin length. The objective of a packing algorithm is to minimize a bin length. This paper proposes a hybrid method of genetic algorithms and tabu search to solve a packing problem. Initially, a hybrid method behaves like r...

2009
Anant Oonsivilai Wichai Srisuruk Boonruang Marungsri Thanatchai Kulworawanichpong

Optimal routing in communication networks is a major issue to be solved. In this paper, the application of Tabu Search (TS) in the optimum routing problem where the aim is to minimize the computational time and improvement of quality of the solution in the communication have been addressed. The goal is to minimize the average delays in the communication. The effectiveness of Tabu Search method ...

Journal: :Annals OR 2002
José Luis González Velarde Manuel Laguna

We present a Tabu Search (TS) method that employs a simple version of ejection chains for coloring graphs. The procedure is tested on a set of benchmark problems. Empirical results indicate that the proposed TS implementation outperforms other metaheuristic methods, including Simulated Annealing, a previous version of Tabu Search and a recent implementation of a Greedy Randomized Adaptive Searc...

2001
Wen-Chyuan Chiang

This paper describes the application of tabu search, a recent heuristic technique for combinatorial optimization problems, to the assembly line balancing problems. Computational experiments with different search strategies have been performed for some assembly ine problems from literature. Computational results show that except for few cases tabu search always finds optimal solutions.

Journal: :Proceedings of the ISCIE International Symposium on Stochastic Systems Theory and its Applications 2005

Journal: :Pattern Recognition 2007
Shih-Ming Pan Kuo-Sheng Cheng

This paper presents an evolution-based tabu search approach (ETSA) to design codebooks with smaller distortion values in vector quantization. In the ETSA, there is no need for users to determine the size of a tabu memory and to specifically define a set of tabu restrictions and a set of aspiration criteria. During iterations, only the best solution visited is memorized as a tabu point in the se...

1995
Te-Wei Chiang Hai-Yen Hau

In this paper, we propose an approach for railway scheduling based on iterative repair, a technique that starts with a complete but possibly flawed schedule and searches through the space of possible repairs. Based on the observation that the decision of the track assignments of trains would influence thepe$onnance of the resulting schedule, we divide the scheduling process into two levels. In ...

Journal: :Parallel Computing 2003
Andreas Bortfeldt Hermann Gehring Daniel Mack

This paper presents a parallel tabu search algorithm for the container loading problem with a single container to be loaded. The emphasis is on the case of a weakly heterogeneous load. The distributed-parallel approach is based on the concept of multi-search threads according to Toulouse et al. [Issues in designing parallel and distributed search algorithms for discrete optimization problems, P...

2007
ANANT OONSIVILAI BOONRUANG MARUNGSRI

This paper presents an application of the intelligent search technique for the parameters optimization of conventional automatic generation control (AGC) systems. An efficient intelligent search technique, which is Adaptive Tabu Search (ATS), is employed to demonstrate the effectiveness of the intelligent search techniques in the tuning of the AGC parameters. A two-area non-reheat thermal syste...

Journal: :CoRR 2014
Gamal Abd El-Nasser A. Said Abeer M. Mahmoud El-Sayed M. El-Horbaty

Quadratic Assignment Problem (QAP) is an NPhard combinatorial optimization problem, therefore, solving the QAP requires applying one or more of the meta-heuristic algorithms. This paper presents a comparative study between Meta-heuristic algorithms: Genetic Algorithm, Tabu Search, and Simulated annealing for solving a real-life (QAP) and analyze their performance in terms of both runtime effici...

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

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