Improved tabu search heuristics for the dynamic space allocation problem

DOI10.1016/J.COR.2007.03.002MaRDI QIDQ2482383zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

metaheuristicstabu searchprobabilistic tabu searchdynamic space allocation problemdiversification and intensification strategies

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

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

Cites work

• A Horizon-Varying, Zero-One Approach to Project Scheduling
• A Tabu-Search Heuristic for the Dynamic Plant Layout Problem
• A dynamic tabu search for large-scale generalized assignment problems
• A tabu search heuristic for the dynamic space allocation problem
• A tabu search heuristic for the generalized assignment problem
• An improved tabu search heuristic for solving facility layout design problems
• Assignment Problems and the Location of Economic Activities
• Crane scheduling with spatial constraints
• Extensions of a tabu search adaptation to the quadratic assignment problem
• Future paths for integer programming and links to artificial intelligence
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
• Simulated annealing heuristics for managing resources during planned outages at electric power plants
• Tabu Search Applied to the Quadratic Assignment Problem
• Tabu search for the multilevel generalized assignment problem
• The Dynamics of Plant Layout
• The Reactive Tabu Search

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

Describes a project that uses

Uses Software

• Tabu search

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)