a tandem agv configuration connects all cells of a manufacturing area by means of non-overlapping, sin-gle-vehicle closed loops. each loop has at least one additional p/d station, provided as an interface between adjacent loops. this study describes the development of three tabu search algorithms for the design of tandem agv systems. the first algorithm was developed based on the basic definiti...

  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 ...

The Multiple Sequence Alignment problem is considered to be an NP-Hard problem, requiring initially a specific encoding schema and design, as for any other of its siblings, implement run the main categories heuristic. This paper intends discuss our proposed generic implementation Tabu Search algorithm, heuristic procedure by Fred Glover solve discrete combinatorial optimization problems. In thi...

the bi-objective warehouse problem in a crisp environment is often not eective in dealing with the imprecision or vagueness in the values of the problem parameters. to deal with such situations, several researchers have proposed that the parameters be represented as fuzzy numbers. we describe a new algorithm for fuzzy bi-objective warehouse problem using a ranking function followed by an applic...

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...

We here propose an efficient tabu search (TS) for solving the uncapacitated single allocation hub location problem. To decrease the computational time, in the proposed tabu search, some new tabu rules are considered. Also, to compute the changes in the objective function’s value in each move, some new results are given. The performance of the proposed tabu search is compared with a recently pro...

Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over local search alone has been already shown experimentally several times. A natural question addressed here is to understand if this superiority holds also from the worst-case point of view. Moreover, it is well known that a critic...