in this paper a guided tabu search (gts) is utilized for optimal nodal ordering of finite element models (fems) leading to small profile for the stiffness matrices of the models. the search strategy is accelerated and a graph-theoretical approach is used as guidance. the method is evaluated by minimization of graph matrices pattern equivalent to stiffness matrices of finite element models. comp...

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

In this paper, we develop an extended guided tabu search (EGTS) and a new heuristic packing algorithm for the two-dimensional loading vehicle routing problem (2L-CVRP). The 2L-CVRP is a combination of two well-known NP-hard problems, the capacitated vehicle routing problem, and the two-dimensional bin packing problem. It is very difficult to get a good performance solution in practice for these...

With the surge in the availability of real-time manufacturing and transportation resources information, requirements for advanced intelligent real time decision-making techniques are imperative. This research is focused on developing dynamic real time demand responsive decision-making techniques to address the current and future needs in the field of advanced synchronized manufacturing and tran...

A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. While there are many wellstudied methods to help the search process escape a basin of attraction, it seems more difficult to prevent it from looping between a limited number of basins of attraction. We introduce a Positi...

A new hybrid optimization method, combining Continuous Ant Colony System (CACS) and Tabu Search (TS) is proposed for minimization of continuous multiminima functions. The new algorithm incorporates the concepts of promising list, tabu list and tabu balls from TS into the framework of CACS. This enables the resultant algorithm to avoid bad regions and to be guided toward the areas more likely to...