Tabu Search Method for Optimum Installation of Generators in an Unbalanced System

Author(s):  
Matheus Dantas De Lucena ◽  
Allan David Da Costa Silva ◽  
Nubia Silva Dantas Brito
2006 ◽  
Vol 106 (6) ◽  
pp. 1406-1412 ◽  
Author(s):  
T. Rusu ◽  
V. Bulacovschi

Author(s):  
Hamza Gharsellaoui ◽  
Hamadi Hasni

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.


Author(s):  
A M Connor ◽  
D G Tilley

This paper describes the development of an efficient algorithm for the optimization of fluid power circuits. The algorithm is based around the concepts of Tabu search, where different time-scale memory cycles are used as a metaheuristic to guide a hill climbing search method out of local optima and locate the globally optimum solution. Results are presented which illustrate the effectiveness of the method on mathematical test functions. In addition to these test functions, some results are presented for real problems in hydraulic circuit design by linking the method to the Bath fp dynamic simulation software. In one such example the solutions obtained are compared to those found using simple steady state calculations.


Sign in / Sign up

Export Citation Format

Share Document