Maximum weight matching and genetic algorithm for fixed-shape facility layout problem
From MaRDI portal
Publication:3605401
DOI10.1080/00207540600733527zbMath1154.90530OpenAlexW2057631889MaRDI QIDQ3605401
T. Limudomsuk, Booncharoen Sirinaovakul
Publication date: 24 February 2009
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540600733527
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Cites Work
- Genetic algorithms, function optimization, and facility layout design
- On finding a biconnected spanning planar subgraph with applications to the facilities layout problem
- Computational aspects of the facility layout design problem.
- Optimal orientations of cells in slicing floorplan designs
- Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics
- How good are slicing floorplans?
- The Recognition of Series Parallel Digraphs
- Efficient facility layout planning in a maximally planar graph model
- A knowledge base to assist a heuristic search approach to facility layout
This page was built for publication: Maximum weight matching and genetic algorithm for fixed-shape facility layout problem