“…Hence, Konak et al (2006) argued that the recent works on unequal area facility layout problems consider the Flexible Bay Structure (FBS) for the facility layout design. Tate and Smith (1995) published a key paper on FBS. In FBS, the plant floor is partitioned in one direction with bays of varying width and also each facility is assigned to a single bay.…”
In this article, we propose Simulated Annealing (SA) heuristic to solve Unequal Area Dynamic Facility Layout Problem (FBS) with Flexible Bay Structure (UA-DFLPs with FBS). The UA-DFLP with FBS is the problem of determining the facilities dimension and their location coordinates with flexible bays formation in the layout for various periods of the planning horizon. The UA-DFLP with FBS is more constrained than general UA-DFLP and it is an NP-complete problem. The proposed SA is tested with the available UA-DFLPs instances in the literature. The proposed SA heuristic has given new best solution or the same solution for FBS based problems as compared with the best-known reported in the UA-DFLPs with FBS literature. The proposed SA heuristic is also tested on standard UA-DFLPs used in non-FBS approaches. The SA heuristic solution is not significantly different from the best solution reported in the literature for non-FBS approaches. Equal area DFLP instances are also solved with the proposed SA and the results obtained are promising with the solutions reported in the literature. Hence the results obtained indicate that the proposed SA for UA-DFLP with FBS is effective and versatile for both equal and unequal area dynamic facility layout problems. The computational efficiency of the proposed SA heuristic is very much competitive as compared to other meta-heuristics computational timings reported in the literature.
“…Hence, Konak et al (2006) argued that the recent works on unequal area facility layout problems consider the Flexible Bay Structure (FBS) for the facility layout design. Tate and Smith (1995) published a key paper on FBS. In FBS, the plant floor is partitioned in one direction with bays of varying width and also each facility is assigned to a single bay.…”
In this article, we propose Simulated Annealing (SA) heuristic to solve Unequal Area Dynamic Facility Layout Problem (FBS) with Flexible Bay Structure (UA-DFLPs with FBS). The UA-DFLP with FBS is the problem of determining the facilities dimension and their location coordinates with flexible bays formation in the layout for various periods of the planning horizon. The UA-DFLP with FBS is more constrained than general UA-DFLP and it is an NP-complete problem. The proposed SA is tested with the available UA-DFLPs instances in the literature. The proposed SA heuristic has given new best solution or the same solution for FBS based problems as compared with the best-known reported in the UA-DFLPs with FBS literature. The proposed SA heuristic is also tested on standard UA-DFLPs used in non-FBS approaches. The SA heuristic solution is not significantly different from the best solution reported in the literature for non-FBS approaches. Equal area DFLP instances are also solved with the proposed SA and the results obtained are promising with the solutions reported in the literature. Hence the results obtained indicate that the proposed SA for UA-DFLP with FBS is effective and versatile for both equal and unequal area dynamic facility layout problems. The computational efficiency of the proposed SA heuristic is very much competitive as compared to other meta-heuristics computational timings reported in the literature.
“…In the first type (discrete), managers identify feasible places for locating facilities, then these places are divided into rectangular blocks that each block can be assigned to a facility. when costs associated with the flow between facilities are linear with respect to distance traveled and quantity of flow, this type of problem can be formulated as Quadratic assignment problem (QAP) [7,8]. The Quadratic Assignment Problem is a classic combinatorial optimization problem and is well known for its various applications [9].…”
The whale optimization algorithm (WOA) is a recently developed swarm-based optimization algorithm inspired by the hunting behavior of humpback whales. This study attempts to enhance the original formulation of the WOA by hybridizing it with some concepts of the colliding bodies optimization (CBO) in order to improve solution accuracy, reliability and convergence speed. The new method, called WOA-CBO algorithm, is applied to construction site layout planning problem. To show the efficiency and performance of the WOA and WOA-CBO in construction site layout problems, three case studies are selected. First case is a discrete and equal area facility layout problem that every facility could assign to any location. Second case is an unequal area version of discrete facility layout problem with more constraints and the last case is a continuous model of construction site layouts. These cases are studied by WOA, CBO and WOA-CBO, and the results are compared with each other.
“…In the baystructured facility layout problems, a pre-specified rectangular floor space is first partitioned horizontally or vertically into bays and then each bay is divided into blocks with equal width but different lengths. Some typical works in bay layout are Aiello et al (2006), Arapoglu et al (2001), Castillo and Peters (2004), Chae and Peters (2006), Chen et al (2002), Eklund et al (2006), Enea et al (2005), Garey and Johnson (1979), , Kulturel-Konak et al (2004), Meller (1997), Peters and Yang (1997) and Tate and Smith (1995).…”
In the aforesaid paper, some pages are omitted reluctantly and are corrected thus. In this paper, the two-floor facility layout problem with unequal departmental areas in multi-bay environments is addressed. A mixed integer programming formulation is developed to find the optimal solution to the problem. This model determines position and number of elevators with consideration of conflicting objectives simultaneously. Objectives include to minimize material handling cost and to maximize closeness rating. A memetic algorithm (MA) is designed to solve the problem and it is compared with the corresponding genetic algorithm for large-sized test instances and with a commercial linear programming solver solution to small-sized test instances. Computational results proved the efficiency of solution procedure to the problem.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.