Simulated annealing heuristics for the dynamic facility layout problem

DOI10.1016/j.cor.2005.02.021zbMath1086.90037OpenAlexW2120016694MaRDI QIDQ2489299

Alan R. jun. McKendall, Jin Shang, Saravanan Kuppusamy

Publication date: 16 May 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://researchrepository.wvu.edu/cgi/viewcontent.cgi?article=3985&context=faculty_publications

zbMATH Keywords

HeuristicsSimulated annealingDynamic facility layout problemLook-ahead/back strategy

Mathematics Subject Classification ID

Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Recent advances in dynamic facility layout research ⋮ The zone-based dynamic facility layout problem ⋮ A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem: a robust optimization approach ⋮ A cutting plane algorithm for the site layout planning problem with travel barriers ⋮ Novel integer linear programming models for the facility layout problem with fixed-size rectangular departments ⋮ Formulating and solving sustainable stochastic dynamic facility layout problem: a key to sustainable operations ⋮ Optimization of consignment-store-based supply chain with black hole algorithm ⋮ A novel meta-heuristic algorithm for multi-objective dynamic facility layout problem ⋮ A simulated annealing heuristic for the team orienteering problem with time windows ⋮ A new approach to weapon-target assignment in cooperative air combat ⋮ Solving the truck and trailer routing problem based on a simulated annealing heuristic ⋮ Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm ⋮ Robust scheduling on a single machine to minimize total flow time ⋮ The museum visitor routing problem ⋮ A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem ⋮ An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem

Cites Work

• Optimization by Simulated Annealing
• Experimental analysis of simulated annealing based algorithms for the layout problem
• Solutions for the constrained dynamic facility layout problem
• Genetic search and the dynamic facility layout problem
• A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version.
• A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
• Genetic search and the dynamic layout problem
• Hybrid ant systems for the dynamic facility layout problem
• The Dynamics of Plant Layout
• Multi-Terminal Network Flows
• Static and Dynamic Layout Problems with Varying Areas
• 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