The facility layout problem is a well researched one. However few effective and user friendly approaches have been proposed. Since it is an NP hard problem, various optimization approaches for small problems and heuristic approaches for the larger problems have been proposed. For the most part the more effective algorithms are not user friendly. On the other hand user friendly methods have not ...

In this study, optimal layout design approach was used to solve problems related to site layout design of agricultural facilities such as refrigeration house, grading and packing house and warehouse. A basic program to support the rational construction of such facilities using Simulated Annealing (SA), one heuristic algorithm and one solution for combinatorial optimization problems, was coded i...

the integration of an approximate model and a clonal selection algorithm (csa) is considered to one of the most effective ways to solve complex optimization design problems in engineering. in this study, first, a process for developing an approximate model and the principles of clonal selection algorithms were presented. then, a variotherm temperature injection mold used to produce a large liqu...

This paper deals with dynamic facility layout problem (DFLP) in a plant which is concerned determining the best position of machines during multi-period planning horizon. The material handling costs and rearrangement (MRC) are used to determine layout. In addition positions machines, details transportation such as type transporters sequence operations have direct effect on (MHC). Therefore, it ...

The facility layout problem is one of the fundamental production system management problems. It has a significant impact on overall efficiency. This paper introduces new that allows for choosing from multiple variants each facility. need most suitable selection while at same time optimizing other quality indicators represents optimization challenge. We build our previous work where single- and ...

this research presents a new application of the cloud theory-based simulated annealing algorithm to solve mixed model assembly line sequencing problems where line stoppage cost is expected to be optimized. this objective is highly significant in mixed model assembly line sequencing problems based on just-in-time production system. moreover, this type of problem is np-hard and solving this probl...

This paper considers the Economic Lot Scheduling Problem, that is, the problem of scheduling several products on a single facility so as to minimize holding and setup costs. Combination of frequency and timing as well as production quantity make this problem Np-hard. A heuristic is developed to obtain a good solution to ELSP. The proposed heuristic makes use of the Simulated Annealing Technique...

A new search method to the feature selection problem – the tournament searching – is proposed and compared with other popular feature selection methods. The tournament feature selection method is a simple stochastic searching method with only one parameter controlling the global-local searching properties of the algorithm. It is less complicated and easier to use than other stochastic methods, ...

The layout design problem is a kind of nesting problems that is naturally NP-hard and very difficult to solve. Layout designing of machine is even more difficult because of its nesting items are actually machine parts that have both irregular shapes and complex constraints. A feasible way to solve machine layout problem is to employ ameliorative algorithms, such as simulated annealing algorithm...