Maximum weight matching and genetic algorithm for fixed-shape facility layout problem
From MaRDI portal
Publication:3605401
Recommendations
- A genetic algorithm approach for multiple criteria facility layout design
- A genetic algorithm for facility layout
- An improved genetic algorithm for facility layout problems having inner structure walls and passages
- An iterative facility layout algorithm
- A genetic algorithm for facility layout design in flexible manufacturing systems
Cites work
- A knowledge base to assist a heuristic search approach to facility layout
- Computational aspects of the facility layout design problem.
- Efficient facility layout planning in a maximally planar graph model
- Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics
- Genetic algorithms, function optimization, and facility layout design
- How good are slicing floorplans?
- On finding a biconnected spanning planar subgraph with applications to the facilities layout problem
- Optimal orientations of cells in slicing floorplan designs
- The Recognition of Series Parallel Digraphs
Cited in
(3)- An improved genetic algorithm for multi-floor facility layout problems having inner structure walls and passages
- Integrated slicing tree approach for solving the facility layout problem with input and output locations based on contour distance
- An improved genetic algorithm for facility layout problems having inner structure walls and passages
This page was built for publication: Maximum weight matching and genetic algorithm for fixed-shape facility layout problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605401)
