The dynamic space allocation problem: applying hybrid GRASP and tabu search metaheuristics

DOI10.1016/j.cor.2011.05.016zbMath1251.90254OpenAlexW2035499648MaRDI QIDQ1762023

Geiza Cristina da Silva, Luiz Satoru Ochi, Paulo Oswaldo Boaventura-Netto, Laura Bahiense

Publication date: 15 November 2012

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

Full work available at URL: https://doi.org/10.1016/j.cor.2011.05.016

zbMATH Keywords

combinatorial optimizationmetaheuristicsquadratic assignment problemdynamic space allocation problem

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (4)

A mixed integer programming approach to the patient admission scheduling problem ⋮ Efficient metaheuristics for the home (health)-care routing and scheduling problem with time windows and synchronized visits ⋮ Double-row facility layout with replicate machines and split flows ⋮ Modelling and metaheuristic for gantry crane scheduling and storage space allocation problem in railway container terminals

Cites Work

• Unnamed Item
• A survey for the quadratic assignment problem
• Research on warehouse operation: a comprehensive review
• Simulated annealing heuristics for managing resources during planned outages at electric power plants
• Improved tabu search heuristics for the dynamic space allocation problem
• A tabu search heuristic for the dynamic space allocation problem
• Assignment Problems and the Location of Economic Activities
• The Dynamics of Plant Layout

This page was built for publication: The dynamic space allocation problem: applying hybrid GRASP and tabu search metaheuristics