An efficient, effective, and robust decoding heuristic for metaheuristics-based layout optimization
From MaRDI portal
Publication:5438610
DOI10.1080/00207540500371873zbMath1128.90546OpenAlexW2047397820MaRDI QIDQ5438610
Abdul-Rahim Ahmad, Khaled Hassanein, Otman Basir, M. Hasan Imam
Publication date: 24 January 2008
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540500371873
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Cites Work
- Topology optimization of arbitrary-size blocks using a bivariate formulation
- On genetic algorithms for the packing of polygons
- Simulated annealing for manufacturing systems layout design
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- A literature survey on applications of neural networks for human-computer interaction
- Approximation algorithm for the oriented two-dimensional bin packing problem
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
- An algorithm for polygon placement using a bottom-left strategy
- An effective quasi-human based heuristic for solving the rectangle packing problem
- Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- Solving quadratic assignment problems with rectangular distances and integer programming
- Machine layout problem in modern manufacturing facilities
- Discusssion A note on 'A genetic algorithm approach for multiple criteria facility layout design'
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- Tree-search algorithms for quadratic assignment problems
This page was built for publication: An efficient, effective, and robust decoding heuristic for metaheuristics-based layout optimization
