Research Article

A New Optimization via Simulation Approach for Dynamic Facility Layout Problem with Budget Constraints

Table 1

The computational results with significant level 99% with 𝑁 = 6 .

𝑇 Problem numberBudgetAverage probabilitiesNRBest solutionBest solution by Sahin et al. [26]% Dev.Average time

5P0110.76082110641910641900.53
20.79841510641910641900.38
30.84321010641910641900.26
P0210.77451910573110573100.47
20.84321010573110573100.26
30.800415103429104834−1.340.38
P0310.834611103541106011−2.330.28
20.834311106049107609−1.450.28
30.795416102092105762−3.470.39
P0410.792216106547106583−0.030.41
20.77321910798410798400.48
30.8511010690610690600.24
P0510.88487104786106328−1.450.18
20.8679810787010787000.21
30.82113106285106.328−0.040.31
P0610.8847710431510431500.18
20.8771810769810769800.19
30.821313104001104262−0.250.31
P0710.92355103582107406−3.560.12
20.91335104752108114−3.110.13
30.90116106173106439−0.250.15
P0810.82611210724810724800.3
20.80221510724810724800.37
30.80451510724810724800.36

10P0910.789217220301220367−0.030.52
20.79541622077622077600.49
30.81241421725121725100.42
P1010.810314216607217106−0.230.43
20.809214216767217201−0.20.43
30.86748211837212134−0.140.26
P1110.846410211951214960−1.40.31
20.852210206178215622−4.380.3
30.8775821539321539300.23
P1210.8923721682821682800.2
20.8955621682821682800.2
30.7981521682821682800.48
P1310.85639205695211620−2.80.28
20.85439210958213304−1.10.29
30.843910205060211620−3.10.32
P1410.784517211916212341−0.20.54
20.79815207966213430−2.560.48
30.823812205335213424−3.790.38
P1510.88427217221217460−0.110.22
20.89067218291218794−0.230.21
30.85789214136214823−0.320.28
P1610.7720171712220144−220.61
20.790316189324220144−140.51
30.843110181917219177−170.32

Average0.834812157616161343−1.890.33