Constructing some PBIBD(2)s by Tabu Search Algorithm

نویسنده

  • Luis B. Morales
چکیده

Some papers have dealt with the construction of 2-concurrence designs as an optimization problem. In this paper we generalize these results to formulate also the construction of partially balanced incomplete block designs with 2 associate classes as a combinatorial optimization problem. We will propose an algorithm based on tabu search to construct many of these designs. Our algorithm was able to construct 51 resolvable and 71 non-resolvable PBIBD(2)s.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructing Cyclic PBIBD(2)s through an Optimization Approach: Thirty Two New Cyclic Designs

We formulate the construction of cyclic partially balanced incomplete block designs with 2 associate classes as a combinatorial optimization problem. We propose an algorithm based on tabu search to tackle the problem. Our algorithm constructed 32 new cyclic designs.

متن کامل

Comparison of particle swarm optimization and tabu search algorithms for portfolio selection problem

Using Metaheuristics models and Evolutionary Algorithms for solving portfolio problem has been considered in recent years.In this study, by using particles swarm optimization and tabu search algorithms we  optimized two-sided risk measures . A standard exact penalty function transforms the considered portfolio selection problem into an equivalent unconstrained minimization problem. And in final...

متن کامل

Developing a Permutation Method Using Tabu Search Algorithm: A Case Study of Ranking Some Countries of West Asia and North Africa Based on Important Development Criteria

The recent years have witnessed an increasing attention to the methods of multiple attribute decision making in solving the problems of the real world due to their shorter time of calculation and easy application. One of these methods is the ‘permutation method’ which has a strong logic in connection with ranking issues, but when the number of alternatives increases, solving problems through th...

متن کامل

Solving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method

In this paper, a leader–follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services ar...

متن کامل

Tabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach

  The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003