Solving the Dynamic Plant Layout Problem using a new hybrid meta-heuristic algorithm

Authors:
Jose M. Rodriguez;F. Chris MacPhee;David J. Bonham;Virendrakumar C. Bhavsar
Affiliations:
Department of Mechanical Engineering, University of New Brunswick, NB, Canada.;Faculty of Computer Science, University of New Brunswick, NB, Canada.;Department of Mechanical Engineering, University of New Brunswick, NB, Canada.;Faculty of Computer Science, University of New Brunswick, NB, Canada
Venue:
International Journal of High Performance Computing and Networking
Year:
2006

Citing 10
Cited 2

The dynamics of plant layout

Management Science
Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Genetic search and the dynamic facility layout problem

Computers and Operations Research - Special issue: heuristic, genetic and tabu search
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
A simulated annealing algorithm for dynamic layout problem

Computers and Operations Research
Tabu Search

Tabu Search
A New Genetic Algorithm for the Quadratic Assignment Problem

INFORMS Journal on Computing
Erratum to "A simulated annealing algorithm for dynamic layout problem " [computers & operations research 28 (2001) 1367-1460]

Computers and Operations Research
How to Solve It: Modern Heuristics

How to Solve It: Modern Heuristics
Recent developments in evolutionary computation for manufacturingoptimization: problems, solutions, and comparisons

IEEE Transactions on Evolutionary Computation

A simulated annealing heuristic for the dynamic layout problem with budget constraint

Computers and Industrial Engineering
A new optimization via simulation approach for dynamic facility layout problem with budget constraints

Modelling and Simulation in Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Quadratic Assignment Problem (QAP) can be used to formulate the Facility Layout Problem (FLP). The Dynamic Plant Layout Problem (DPLP) extends the FLP. Of the attempted 48 DPLP instances, 29 now have new best-known solution. With respect to the six department instances that all have a known optimal solution, optimal solutions were obtained for two, for which no heuristic had been found before, and previously found optimal solutions were matched for the remainder. With respect to the 15 and 30 department instances, none of which has a known optimal solution, only three current best-known solutions could not be obtained.