A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem: a robust optimization approach

DOI10.1080/03155986.2020.1788328OpenAlexW3039564234MaRDI QIDQ5889164

Saeed Emami, Unnamed Author, Unnamed Author

Publication date: 19 April 2023

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.2020.1788328

zbMATH Keywords

simulated annealing algorithmrobust optimizationdynamic facility layout problemnested partitions algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Robustness in mathematical programming (90C17)

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem
• Solutions for the constrained dynamic facility layout problem
• Flexible machine layout design for dynamic and uncertain production environments
• Genetic search and the dynamic facility layout problem
• Robust solutions of linear programming problems contaminated with uncertain data
• An improved genetic algorithm based robust approach for stochastic dynamic facility layout problem
• Dynamic facility layout problem based on open queuing network theory
• Solving a group layout design model of a dynamic cellular manufacturing system with alternative process routings, lot splitting and flexible reconfiguration by simulated annealing
• Genetic search and the dynamic layout problem
• Formulating and solving sustainable stochastic dynamic facility layout problem: a key to sustainable operations
• Simulated annealing heuristics for the dynamic facility layout problem
• Handbook on modelling for discrete optimization.
• Global solution approach for a nonconvex MINLP problem in product portfolio optimization
• Hybrid ant systems for the dynamic facility layout problem
• A continuous approach to considering uncertainty in facility design
• Robust Convex Optimization
• A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem
• The Price of Robustness
• The Dynamics of Plant Layout
• A Tabu-Search Heuristic for the Dynamic Plant Layout Problem
• Robust Solutions to Least-Squares Problems with Uncertain Data
• Nested Partitions Method for Global Optimization
• New heuristic for the dynamic layout problem
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Recent advances in dynamic facility layout research
• A simulated annealing algorithm for dynamic layout problem

This page was built for publication: A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem: a robust optimization approach