Improved tabu search heuristics for the dynamic space allocation problem
From MaRDI portal
Publication:2482383
DOI10.1016/J.COR.2007.03.002zbMATH Open1278.90474OpenAlexW1989133941MaRDI QIDQ2482383FDOQ2482383
Authors: Alan R. jun. McKendall
Publication date: 16 April 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2007.03.002
Recommendations
- A tabu search heuristic for the dynamic space allocation problem
- The dynamic space allocation problem: applying hybrid GRASP and tabu search metaheuristics
- An improved tabu search heuristic for solving facility layout design problems
- A dynamic tabu search for large-scale generalized assignment problems
- A Tabu-Search Heuristic for the Dynamic Plant Layout Problem
- A tabu search heuristic for the generalized assignment problem
- Tabu search for large location–allocation problems
- Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation
- A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem
- A Tabu Search Algorithm for the Resource-Constrained Assignment Problem
metaheuristicstabu searchprobabilistic tabu searchdynamic space allocation problemdiversification and intensification strategies
Cites Work
- Future paths for integer programming and links to artificial intelligence
- Assignment Problems and the Location of Economic Activities
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
- Tabu Search Applied to the Quadratic Assignment Problem
- A tabu search heuristic for the generalized assignment problem
- Crane scheduling with spatial constraints
- Tabu search for the multilevel generalized assignment problem
- Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
- The Reactive Tabu Search
- A dynamic tabu search for large-scale generalized assignment problems
- The Dynamics of Plant Layout
- Extensions of a tabu search adaptation to the quadratic assignment problem
- A Horizon-Varying, Zero-One Approach to Project Scheduling
- A tabu search heuristic for the dynamic space allocation problem
- An improved tabu search heuristic for solving facility layout design problems
- A Tabu-Search Heuristic for the Dynamic Plant Layout Problem
- Simulated annealing heuristics for managing resources during planned outages at electric power plants
Cited In (9)
- Double-row facility layout with replicate machines and split flows
- A new variable neighborhood search approach for solving dynamic memory allocation problem
- Buffer dimensioning and control stations positioning with a space partitioning-tabu search approach
- The dynamic space allocation problem: applying hybrid GRASP and tabu search metaheuristics
- A new mixed integer programming model for curriculum balancing: application to a Turkish university
- A learning-based probabilistic tabu search for the uncapacitated single allocation hub location problem
- A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays
- A tabu search heuristic for the dynamic space allocation problem
- Recent advances in dynamic facility layout research
Uses Software
This page was built for publication: Improved tabu search heuristics for the dynamic space allocation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482383)