Stats: A slicing tree and tabu search based heuristic for the unequal area facility layout problem
From MaRDI portal
Publication:1011279
Recommendations
- A slicing tree representation and QCP-model-based heuristic algorithm for the unequal-area block facility layout problem
- A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays
- Heuristics for the dynamic facility layout problem with unequal-area departments
- A graph-pair representation and MIP-model-based heuristic for the unequal-area facility layout problem
- Integrated slicing tree approach for solving the facility layout problem with input and output locations based on contour distance
Cites work
- A coevolutionary algorithm for a facility layout problem
- A nonlinear optimization approach for solving facility layout problems
- A simulated annealing algorithm for allocating space to manufacturing cells
- A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem
- An \(\varepsilon\)-accurate model for optimal unequal-area block layout design
- An iterative facility layout algorithm
- Enhanced Model Formulations for Optimal Facility Layout
- Floorplan design of VLSI circuits
- Genetic algorithms, function optimization, and facility layout design
- Optimal facility layout design
Cited in
(15)- Applying ant system for solving unequal area facility layout problems
- Optimal facility layout and material handling network design
- A problem evolution algorithm with linear programming for the dynamic facility layout problem -- a general layout formulation
- Combining Wang-Landau sampling algorithm and heuristics for solving the unequal-area dynamic facility layout problem
- A hybrid genetic algorithm with decomposition phases for the unequal area facility layout problem
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays
- Extensions to STaTS for practical applications of the facility layout problem
- An efficient multiple-stage mathematical programming method for advanced single and multi-floor facility layout problems
- A biased random-key genetic algorithm for the unequal area facility layout problem
- A graph-pair representation and MIP-model-based heuristic for the unequal-area facility layout problem
- A slicing tree representation and QCP-model-based heuristic algorithm for the unequal-area block facility layout problem
- Using projected cutting planes in the extended cutting plane method
- Metaheuristics and a matheuristic for solving the facility layout problem in the presence of alternative process plans and machine redundancy
- Integrated slicing tree approach for solving the facility layout problem with input and output locations based on contour distance
This page was built for publication: Stats: A slicing tree and tabu search based heuristic for the unequal area facility layout problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1011279)
