A new tabu search method for continuous parameter optimization: application to design problems in electromagnetic

2005 ◽  
Vol 15 (6) ◽  
pp. 527-540 ◽  
Author(s):  
O. Hajji ◽  
S. Brisset ◽  
P. Brochet
Keyword(s):  
Tabu Search ◽  
Parameter Optimization ◽  
Search Method ◽  
Design Problems ◽  
Continuous Parameter ◽  
Tabu Search Method

A Hybrid Lagrangian Relaxation and Tabu Search Method for Interdependent-Choice Network Design Problems

2011 ◽  
pp. 294-324 ◽  
Author(s):  
Chi Xie ◽  
Mark A. Turnquist ◽  
S. Travis Waller
Keyword(s):  
Tabu Search ◽  
Network Design ◽  
Lagrangian Relaxation ◽  
Optimization Problems ◽  
Search Method ◽  
Network Design Problem ◽  
Design Problems ◽  
Network Design Problems ◽  
Tabu Search Method ◽  
Algorithmic Logic

Hybridization offers a promising approach in designing and developing improved metaheuristic methods for a variety of complex combinatorial optimization problems. This chapter presents a hybrid Lagrangian relaxation and tabu search method for a class of discrete network design problems with complex interdependent-choice constraints. This method takes advantage of Lagrangian relaxation for problem decomposition and complexity reduction while its algorithmic logic is designed based on the principles of tabu search. The algorithmic advance and solution performance of the method are illustrated by implementing it for solving a network design problem with lane reversal and crossing elimination strategies, arising from urban evacuation planning.

Multiobjective Tabu Search method used in chemistry

2006 ◽  
Vol 106 (6) ◽  
pp. 1406-1412 ◽  
Author(s):  
T. Rusu ◽  
V. Bulacovschi
Keyword(s):  
Tabu Search ◽  
Search Method ◽  
Tabu Search Method

On a Genetic-Tabu Search Based Algorithm for Two-Dimensional Guillotine Cutting Problems

2012 ◽  
Vol 4 (2) ◽  
pp. 26-40 ◽  
Author(s):  
Hamza Gharsellaoui ◽  
Hamadi Hasni
Keyword(s):  
Tabu Search ◽  
Hybrid Approach ◽  
Search Method ◽  
Two Dimensional ◽  
Whole Number ◽  
Infinite Height ◽  
Tabu Search Method ◽  
Problem Instances ◽  
Cutting Problems ◽  
Guillotine Cutting

The paper deals with the purpose of one hybrid approach for solving the constrained two-dimensional cutting (2DC) problem. The authors study this hybrid approach that combines the genetic algorithm and the Tabu search method. For this problem, they assume a packing of a whole number of rectangular pieces to cut, and that all cuts are of guillotine type in one sheet of a fixed width and an infinite height. Finally, they undertake an extensive experimental study with a large number of problem instances extracted from the literature by the Hopper’s benchmarks in order to support and to prove their approach and to evaluate the performance.

Sign in / Sign up

Export Citation Format

Share Document