INFORMS journal on computing · 1997 · 73 citations · 33 references
Natural SciencesIndustrial EngineeringOperations ManagementFacilities PlanningFacility LayoutOptimizationCombinatorial OptimizationHeuristic OptimizationHeuristic SearchInteger ProgrammingLayout OptimizationMetaheuristic OptimizationDynamic Heuristic OptimizationFacility Layout ProblemFinite-horizon OptimizationHeuristic AlgorithmsPlant Layout OptimizationTabu Search
We consider the dynamic plant layout problem (DPLP) in which the layout of a facility must be determined in each period of a finite planning horizon. We begin by reviewing the literature on DPLP, discussing various formulations of the problem which have appeared in the literature, as well as a number of exact and heuristic solution procedures which have been proposed for DPLP. We then define a tabu-search heuristic (TSH) for DPLP. The TSH employs short-term and longer-term memory features such as the use of an aspiration criterion, dynamic tabu list strategies, and other strategies for search intensification and diversification. Computational experience with the heuristic on a set of test problems appearing in the literature is reported. The TSH is seen to be extremely effective in obtaining high-quality solutions to the test problems. The TSH procedure produces new best-known solutions for over one-third of the test problems.
33
Fred Glover · INFORMS Journal on Computing · 1990 · 5.6K citations
The Quadratic Assignment Problem
Eugene L. Lawler · Management Science · 1963 · 973 citations
Fred Glover, Éric D. Taillard, Éric D. Taillard · Annals of Operations Research · 1993 · 910 citations
Robust taboo search for the quadratic assignment problem
Éric D. Taillard · Parallel Computing · 1991 · 830 citations