A tabu search heuristic for the dynamic space allocation problem

DOI10.1016/j.cor.2004.08.007zbMath1114.90160OpenAlexW2060220378MaRDI QIDQ2566942

Alan R. jun. McKendall, Juan R. Jaramillo

Publication date: 29 September 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://researchrepository.wvu.edu/cgi/viewcontent.cgi?article=3984&context=faculty_publications

zbMATH Keywords

tabu searchclustering algorithmsdynamic space allocation problemrandomized storage policy

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (6)

Recent advances in dynamic facility layout research ⋮ The allocation of storage space for transshipment in vehicle distribution ⋮ Improved tabu search heuristics for the dynamic space allocation problem ⋮ Double-row facility layout with replicate machines and split flows ⋮ The dynamic space allocation problem: applying hybrid GRASP and tabu search metaheuristics ⋮ Adaptive demand peak management in online transport process planning

Cites Work

• Extensions of a tabu search adaptation to the quadratic assignment problem
• Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
• Future paths for integer programming and links to artificial intelligence
• Simulated annealing heuristics for managing resources during planned outages at electric power plants
• Genetic search and the dynamic layout problem
• Assignment Problems and the Location of Economic Activities
• The Dynamics of Plant Layout
• Tabu Search Applied to the Quadratic Assignment Problem
• P-Complete Approximation Problems
• An improved tabu search heuristic for solving facility layout design problems
• A Tabu-Search Heuristic for the Dynamic Plant Layout Problem

This page was built for publication: A tabu search heuristic for the dynamic space allocation problem