The dynamic layout problem addresses the situation
where the traffic among the various units within a facility
changes over time. Its objective is to determine a layout for
each period in a planning horizon such that the total of the
flow and the relocation costs is minimized.
We present the detailed results of the test problems solved
using the heuristic developed in our paper "New heuristics for
the dynamic layout problem", Journal of the Operational
Research Society, 54(12), 12751282, 2003, authored
by E Erel, JB Ghosh, and JT Simon.
The test problems are developed by Balakrishnan and Cheng
(Genetic search and the dynamic layout problem, Computers and
Operations Research, 27, 587593, 2000); the set
consists of 6 combinations of N (number of departments) and T
(number of periods) (N = 6, 15, 30 and T = 5, 10), each
combination has 8 problem instances, leading to 48 instances in
all. The optimal layouts are known for the N = 6 cases; hence we
only present the solutions for the N = 15 and 30 cases (total of
32 instances).
Allocation of departments in each period can be downloaded by
clicking the appropriate problem instance below. The list below
also depicts the cost value; note that we solve these problems
by different parameters/ options developed in our paper, the
list also depicts the parameters/ options utilized to obtain
these solutions. Note also that we only present the best
solutions obtained in our paper (please see our paper for
further details).
For N = 15, a 3 x 5 layout and for N = 30, a 5 x 6 layout is
used.
N = 15, T = 5 
Cost 
Solution
procedure 
Problem
1 
481,738 
SA_EG_1 
Problem
2 
485,167 
SA_EG_1 
Problem
3 
491,310 
DP_10L,
DP_10LI 
Problem
4 
485,862 
SA_EG_2 
Problem
5 
489,304 
SA_EG_1 
Problem
6 
488,452 
SA_EG_2 
Problem
7 
487,576 
SA_EG_2 
Problem
8 
493,030 
SA_EG_2 
N = 15, T =
10 


Problem
1 
983,070 
DP_10SI 
Problem
2 
982,714 
SA_EG_1 
Problem
3 
988,465 
SA_EG_2 
Problem
4 
976,456 
DP_10LI 
Problem
5 
982,191 
SA_EG_2 
Problem
6 
973,199 
SA_EG_2 
Problem
7 
982,790 
DP_10LI 
Problem
8 
988,304 
SA_EG_1 
N = 30, T =
5 


Problem
1 
579,570 
SA_EG_1 
Problem
2 
569,482 
DP_10LI 
Problem
3 
578,506 
DP_10LI 
Problem
4 
569,723 
DP_5SI 
Problem
5 
558,792 
DP_10SI 
Problem
6 
568,047 
DP_10L,
DP_10LI 
Problem
7 
568,721 
DP_10SI 
Problem
8 
574,813 
DP_10S,
DP_10SI 
N = 30, T =
10 


Problem
1 
1,173,483 
SA_EG_1 
Problem
2 
1,170,092 
DP_10SI 
Problem
3 
1,168,720 
DP_10LI 
Problem
4 
1,150,265 
DP_10LI 
Problem
5 
1,128,013 
DP_10LI 
Problem
6 
1,145,858 
DP_10L,
DP_10LI 
Problem
7 
1,143,144 
DP_10LI 
Problem
8 
1,165,994 
DP_10S,
DP_10SI 
