Mathematical formulation and a new metaheuristic for the constrained double-floor corridor allocation problem

A layout plan for a manufacturing system that is designed without any facility constraints will most likely be infeasible when confronted with reality. Additionally, considering land available building industrial plants limited and its cost high, it necessary to investigate the planning of two multi-floor facilities. To address these shortages in scientific literature, we focus on double-floor corridor allocation problem (DFCAP) which covers wide range complex constraints, such as fixed floor row positioning mutual sequencing adjacency constraints. For model mentioned above, term constrained DFCAP (cDFCAP). mixed-integer linear programming formulated cDFCAP. In order solve larger realistic problems, metaheuristic memetic algorithm framework customised solving cDFCAP introduced this work. our algorithm, four problem-specific heuristic rules construct set initial solutions are developed. addition, an ideal parameter combination determined through Taguchi experimental design. Finally, results instances different sizes (n = 10?80) report provided approach effective considered problem.