A new intelligent algorithm for dynamic facility layout problem in state of fuzzy constraints

2013 ◽  
Vol 24 (5) ◽  
pp. 1179-1190 ◽  
Author(s):  
Mojtaba Kaveh ◽  
Vahid Majazi Dalfard ◽  
Sajjad Amiri
2014 ◽  
Vol 31 (04) ◽  
pp. 1450027 ◽  
Author(s):  
GARY YU-HSIN CHEN ◽  
JU-CHIEH LO

A problem in multi-objective dynamic facility layout is achieving distance- and adjacency-based objectives for arranging facility layouts across multiple time periods. As a non-deterministic polynomial time-hard problem, it resembles the quadratic assignment problem (QAP), which can be solved through meta-heuristics such as ant colony optimization (ACO). This study investigates three multi-objective approaches coupled with ACO to solve this problem. As the experimental design, we apply the proposed methods to solve the dynamic facility layout problem (DFLP), multi-objective facility layout problem, and multi-objective DFLP based on data sets from the literature to test the quality of the solution. The results show that the proposed methods are effective for solving the problem.


Author(s):  
Kazi Shah Nawaz Ripon ◽  
Kyrre Glette ◽  
Dirk Koch ◽  
Mats Hovin ◽  
Jim Torresen

AbstractLayout planning in a manufacturing company is an important economical consideration. In the past, research examining the facility layout problem (FLP) generally concerned static cases, where the material flows between facilities in the layout have been assumed to be invariant over time. However, in today’s real-world scenario, manufacturing system must operate in a dynamic and market-driven environment in which production rates and product mixes are continuously adapting. The dynamic facility layout problem (DFLP) addresses situations in which the flow among various facilities changes over time. Recently, there is an increasing trend towards implementation of industrial robot as a material handling device among the facilities. Reducing the robot energy usage for transporting materials among the facilities of an optimal layout for completing a product will result in an increased life for the robots and thus enhance the productivity of the manufacturing system. In this paper, we present a hybrid genetic algorithm incorporating jumping genes operations and a modified backward pass pair-wise exchange heuristic to determine its effectiveness in optimizing material handling cost while solving the DFLP. A computational study is performed with several existing heuristic algorithms. The experimental results show that the proposed algorithm is effective in dealing with the DFLP.


Author(s):  
Mostafa Zandieh ◽  
Seyed Shamsodin Hosseini ◽  
parham azimi ◽  
Mani Sharifi

This paper deals with dynamic facility layout problem (DFLP) in a plant which is concerned with determining the best position of machines in the plant during a multi-period planning horizon. The material handling costs and machines rearrangement costs are used to determine the best layout. In addition to positions of machines, the details of transportation such as type of transporters and sequence of transportation operations have a direct effect on MHC. Therefore, it is more realistic to consider the transportation details during DFLP optimization. This paper proposes a new mathematical model to simultaneously determine the best position of machines in each period and to plan the transportation operations. Minimizing sum of MHC and MRC is considered as the objective function. A new hybrid meta-heuristic approach has been developed by combining modified genetic algorithm and cloud-based simulated annealing algorithm to solve the model. Finally, the proposed methodology is compared with two meta-heuristics on a set of test problems.


Sign in / Sign up

Export Citation Format

Share Document