scholarly journals A new soft computing algorithm based on cloud theory for dynamic facility layout problem

2020 ◽  
Author(s):  
Mostafa Zandieh ◽  
Seyed Shamsodin Hosseini ◽  
parham azimi ◽  
Mani Sharifi
Keyword(s):  
Material Handling ◽  
Simulated Annealing Algorithm ◽  
Facility Layout ◽  
Planning Horizon ◽  
Test Problems ◽  
Layout Problem ◽  
Facility Layout Problem ◽  
Dynamic Facility Layout Problem ◽  
Material Handling Costs ◽  
Cloud Theory

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.

scholarly journals Genetic algorithm using a modified backward pass heuristic for the dynamic facility layout problem *

2011 ◽  
Vol 2 (3) ◽  
Author(s):  
Kazi Shah Nawaz Ripon ◽  
Kyrre Glette ◽  
Dirk Koch ◽  
Mats Hovin ◽  
Jim Torresen
Keyword(s):  
Genetic Algorithm ◽  
Material Handling ◽  
Manufacturing System ◽  
Industrial Robot ◽  
Facility Layout ◽  
Layout Problem ◽  
Facility Layout Problem ◽  
Dynamic Facility Layout Problem ◽  
Economical Consideration ◽  
Over Time

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.

scholarly journals Heuristics for the dynamic facility layout problem with unequal area departments

2008 ◽  
Author(s):  
◽  
Artak Hakobyan ◽  
Keyword(s):  
Material Handling ◽  
Facility Layout ◽  
Planning Horizon ◽  
Combinatorial Structure ◽  
Material Flows ◽  
Layout Problem ◽  
Dual Simplex Method ◽  
Data Set ◽  
Facility Layout Problem ◽  
Dual Simplex

The facility layout problem (FLP) is a well researched problem of finding positions of departments on a plant floor such that departments do not overlap and some objective(s) is (are) optimized. In this dissertation, the FLP with unequal area rectangular shaped departments is considered, when material flows between departments change during the planning horizon. This problem is known as the dynamic FLP. The change in material flows between pairs of departments in consecutive periods may require rearrangements of departments during the planning horizon in order to keep material handling costs low. The objective of our problem is to minimize the sum of the material handling and rearrangement costs. Because of the combinatorial structure of the problem, only small sized problems can be solved in reasonable time using exact techniques. As a result, construction and improvement heuristics are developed for the proposed problem. The construction algorithms are boundary search heuristics as well as a dual simplex method, and the improvement heuristics are tabu search and memetic heuristics with boundary search and dual simplex (linear programming model) techniques. The heuristics were tested on a generated data set as well as some instances from the literature. In summary, the memetic heuristic with the boundary search technique out-performed the other techniques with respect to solution quality.

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

2012 ◽  
Vol 2012 ◽  
pp. 1-9 ◽  
Author(s):  
Parham Azimi ◽  
Hamid Reza Charmchi
Keyword(s):  
Integer Programming ◽  
Simulation Model ◽  
Heuristic Algorithms ◽  
Facility Layout ◽  
Discrete Event ◽  
Test Problems ◽  
Layout Problem ◽  
Facility Layout Problem ◽  
Dynamic Facility Layout Problem ◽  
Optimization Via Simulation

A new efficient heuristic algorithm has been developed for the dynamic facility layout problem with budget constraint (DFLPB) using optimization via simulation technique. The heuristic integrates integer programming and discrete event simulation to address DFLPB. In the proposed algorithm, the nonlinear model of the DFLP has been changed to a pure integer programming (PIP) model. Then, the optimal solution of the PIP model has been used in a simulation model that has been designed in a similar manner as the DFLP for determining the probability of assigning a facility to a location. After a sufficient number of runs, the simulation model obtains near optimum solutions. Finally, to test the performance of the algorithm, several test problems have been taken from the literature and solved. The results show that the proposed algorithm is more efficient in terms of speed and accuracy than other heuristic algorithms presented in previous works.

An Unequal-Sized Unidirectional Loop Layout Design Problem Considering Empty Vehicle Trip

2010 ◽  
Vol 37-38 ◽  
pp. 116-121
Author(s):  
Yu Lan Li ◽  
Bo Li ◽  
Su Jun Luo
Keyword(s):  
Material Handling ◽  
Design Principle ◽  
Facility Layout ◽  
Original Model ◽  
Layout Problem ◽  
Proposed Model ◽  
Loop Layout ◽  
Material Handling Costs ◽  
Loop Layout Problem ◽  
Better Than

In the facility layout decisions, the previous general design principle is to minimize material handling costs, and the objective of these old models only considers the costs of loaded trip, without regard to empty vehicle trip costs, which do not meet the actual demand. In this paper, the unequal-sized unidirectional loop layout problem is analyzed, and the model of facility layout is improved. The objective of the new model is to minimize the total loaded and empty vehicle trip costs. To solve this model, a heuristic algorithm based on partheno-genetic algorithms is designed. Finally, an unequal-sized unidirectional loop layout problem including 12 devices is simulated. Comparison shows that the result obtained using the proposed model is 20.4% better than that obtained using the original model.

Sign in / Sign up

Export Citation Format

Share Document