Simulated annealing and genetic algorithms for the facility layout problem: A survey
From MaRDI portal
Publication:1363064
DOI10.1023/A:1008623913524zbMath0883.90078OpenAlexW1976320994MaRDI QIDQ1363064
Thelma D. Mavridou, Panos M. Pardalos
Publication date: 7 August 1997
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008623913524
Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Parallel numerical computation (65Y05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Application of chaos in simulated annealing ⋮ A survey for the quadratic assignment problem ⋮ An improved two-stage optimization-based framework for unequal-areas facility layout ⋮ An improved simulated annealing for solving the linear constrained optimization problems ⋮ Fast simulated annealing for single-row equidistant facility layout ⋮ Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities ⋮ A graph-pair representation and MIP-model-based heuristic for the unequal-area facility layout problem ⋮ A derivative-free variant called DFSA of Dekkers and Aarts' continuous simulated annealing algorithm ⋮ Identifying algorithmic vulnerabilities through simulated annealing ⋮ A probabilistic cooperative-competitive hierarchical model for global optimization ⋮ A class of genetic algorithms for multiple-level warehouse layout problems ⋮ A convex optimisation framework for the unequal-areas facility layout problem ⋮ Global Approaches for Facility Layout and VLSI Floorplanning ⋮ An efficient multiple-stage mathematical programming method for advanced single and multi-floor facility layout problems ⋮ A model to design recreational boat mooring fields ⋮ Solving the multiple competitive facilities location problem
