An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem

DOI10.1631/jzus.A0820284zbMath1180.90373OpenAlexW2011941531MaRDI QIDQ1048304

Hassan Rezazadeh, Mohammad Saidi-Mehrabad, Seyed Jafar Sadjadi, Mehdi Ghazanfari

Publication date: 11 January 2010

Published in: Journal of Zhejiang University. Science A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1631/jzus.a0820284

zbMATH Keywords

optimizationparticle swarm optimization (PSO)heuristic methoddynamic facility layout problem (DFLP)

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

Recent advances in dynamic facility layout research ⋮ A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem: a robust optimization approach ⋮ A novel meta-heuristic algorithm for multi-objective dynamic facility layout problem

Cites Work

• A discrete version of particle swarm optimization for flowshop scheduling problems
• Solutions for the constrained dynamic facility layout problem
• Genetic search and the dynamic facility layout problem
• Genetic search and the dynamic layout problem
• Simulated annealing heuristics for the dynamic facility layout problem
• Hybrid ant systems for the dynamic facility layout problem
• Emerging Optimization Techniques in Production Planning and Control
• A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks
• The Dynamics of Plant Layout
• A Tabu-Search Heuristic for the Dynamic Plant Layout Problem
• New heuristic for the dynamic layout problem
• A simulated annealing algorithm for dynamic layout problem

This page was built for publication: An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem