“…This problem is used from the research of C.Huang, C.K.Wong, C.M.Tam [32], planning the facilities layout on the basement storage in a multi-floor building, considering the horizontal movement of the warehouse and the vertical movement of the material along the hoist. (25) where: j Material types l Floor in a building for material storage as sources of supply k Cells on building floors for storage m Floor in a building demanding the materials J Total number of material types L Total number of storage floors in a building K Total number of cells in a level of a building M Total number of level in a building Q j, m Demand of material type j on floor m in a building C h j Horizontal unit transportation cost of material type j C v j, l Vertical unit transportation cost of material type j to the floor l of a building from ground C v j, m Vertical unit transportation cost of material type j to the floor m of a building from ground Dl, k Distance from cell k to the material hoist on level l xj, l, k Binary decision variable of storing material j inside cell k on level l Δj, m Demand of material type j on building level m δj, l, k, m Auxiliary binary-type variable where '1' means material j is transferred from floor l cell k to floor m but '0' otherwise' N Total cost in the material transfer setting Calculated data: Material quantity demand, Horizontal distance from cell k on 1st floor to hoist Vertical transportation cost (in USD/kg) from ground to floor l, input parameters for algorithm model, see Run the problem 20 times for three algorithms (GA), (ALO), (IALO-MOLT) to compare the results on PyCharm 2022 software, HP ProBook 450 G2, the final result is taken from the best run. 7's results, IALO-MOLT could achieve optimal results within the shortest time compared with the algorithms GA, ALO, and IALO after 20 iterations.…”