Convergent Tabu Search for Optimal Partitioning
نویسندگان
چکیده
We consider a specialization of tabu search for optimal partitioning problems, which can be used to model a wide variety of binary discrete optimization problems. Our method constitutes a form of tree search that applies under more general assumptions than standard tree search approaches. Moreover, the method allows combinations of problem restriction and problem relaxation strategies that are not available in ordinary branch and bound.
منابع مشابه
Solving the tandem AGV network design problem using tabu search: Cases of maximum workload and workload balance with fixed and non-fixed number of loops
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...
متن کاملA new memetic algorithm for mitigating tandem automated guided vehicle system partitioning problem
Automated Guided Vehicle System (AGVS) provides the flexibility and automation demanded by Flexible Manufacturing System (FMS). However, with the growing concern on responsible management of resource use, it is crucial to manage these vehicles in an efficient way in order reduces travel time and controls conflicts and congestions. This paper presents the development process of a new Memetic Alg...
متن کاملA Solution Proposal for the Capacitated P-Median Problem with Tabu Search
This work presents the Capacitated P-Median problem, which seeks to solve the optimal location of p distributors. In understanding the computational complexity of this problem, partitioning principles are applied in the process of associating a distribution center with customers to be serviced. These are treated as clusters containing each distribution center and its customers. The optimization...
متن کامل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 ...
متن کاملInitial Solutions Starting Point Starting Points Multi Tabu Genetic Algorithm Long Term Memory ( TS ) SearchImprovement Iterative Genetic
The modern philosophy for constructing fast, globally con-vergent algorithms is to combine a simple globally conver-gent algorithm with a fast, locally convergent algorithm to form a hybrid. The work in this paper involves exploring and implementing hybrid solutions to the problem of circuit partitioning in VLSI physical design. Results obtained indicate that the generated solutions and running...
متن کامل