Simulated annealing heuristics for the dynamic facility layout problem

DOI10.1016/J.COR.2005.02.021zbMATH Open1086.90037OpenAlexW2120016694MaRDI QIDQ2489299FDOQ2489299

Authors: 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

Recommendations

• A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem
• A simulated annealing algorithm for dynamic layout problem
• Simulated annealing and genetic algorithms for the facility layout problem: A survey
• Multi-floor dynamic facility layout: a simulated annealing-based solution
• A new simulated annealing algorithm for the facility layout problem

zbMATH Keywords

HeuristicsSimulated annealingDynamic facility layout problemLook-ahead/back strategy

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (30)

• A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem
• SIMULATED ANNEALING SCHEME INCORPORATING MOVE DESIRABILITY TABLE FOR SOLUTION OF FACILITY LAYOUT PROBLEMS
• Hybrid ant systems for the dynamic facility layout problem
• A Monte Carlo simulation based heuristic procedure for solving dynamic line layout problems for facilities using conventional material handling devices
• A novel meta-heuristic algorithm for multi-objective dynamic facility layout problem
• Title not available (Why is that?)
• Location of facility based on simulated annealing and ``ZKW algorithms
• Solving multi objective facility layout problem by modified simulated annealing
• Solving the truck and trailer routing problem based on a simulated annealing heuristic
• A simulated annealing hyper-heuristic methodology for flexible decision support
• A cutting plane algorithm for the site layout planning problem with travel barriers
• A new approach to weapon-target assignment in cooperative air combat
• The zone-based dynamic facility layout problem
• Simulated annealing heuristics for managing resources during planned outages at electric power plants
• Novel integer linear programming models for the facility layout problem with fixed-size rectangular departments
• The museum visitor routing problem
• Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
• A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem: a robust optimization approach
• A simulated annealing heuristic for the team orienteering problem with time windows
• Robust scheduling on a single machine to minimize total flow time
• Multi-floor dynamic facility layout: a simulated annealing-based solution
• Formulating and solving sustainable stochastic dynamic facility layout problem: a key to sustainable operations
• A simulated annealing algorithm for dynamic layout problem
• A two-stage simulated annealing procedure for block layout problems
• Combining Wang-Landau sampling algorithm and heuristics for solving the unequal-area dynamic facility layout problem
• An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem
• Fast simulated annealing for single-row equidistant facility layout
• Optimization of consignment-store-based supply chain with black hole algorithm
• A simulated annealing heuristic for the facility location problem
• Recent advances in dynamic facility layout research

This page was built for publication: Simulated annealing heuristics for the dynamic facility layout problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489299)