نتایج جستجو برای: stochastic facility layout problem

تعداد نتایج: 1051048  

2015
Anja Fischer Frank Fischer Philipp Hungerländer

Given a set of departments, a number of rows and pairwise connectivities between these departments, the multi-row facility layout problem (MRFLP) looks for a non-overlapping arrangement of these departments in the rows such that the weighted sum of the center-to-center distances is minimized. As even small instances of the (MRFLP) are rather challenging, several special cases have been consider...

Journal: :Comp. Opt. and Appl. 2013
Philipp Hungerländer Franz Rendl

The single-row facility layout problem (SRFLP) is an NP-hard combinatorial optimization problem that is concerned with the arrangement of n departments of given lengths on a line so as to minimize the weighted sum of the distances between department pairs. (SRFLP) is the one-dimensional version of the facility layout problem that seeks to arrange rectangular facilities so as to minimize the ove...

Journal: :Rairo-operations Research 2021

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 ...

Journal: :European Journal of Operational Research 2007
Yasmina Hani Lionel Amodeo Farouk Yalaoui Haoxun Chen

This paper presents ACO_GLS, a hybrid ant colony optimization approach coupled with a guided local search, applied to a layout problem. ACO_GLS is applied to an industrial case, in a train maintenance facility of the French railway system (SNCF). Results show that an improvement of near 20% is achieved with respect to the actual layout. Since the problem is modeled as a quadratic assignment pro...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید