A multi-objective model to allocate multiple facilities at proposed locations in the multi-floor organisation, using an improved genetic algorithm. Case study: Isfahan Governorate (Q2247681)

From MaRDI portal





scientific article; zbMATH DE number 7428650
Language Label Description Also known as
default for all languages
No label defined
    English
    A multi-objective model to allocate multiple facilities at proposed locations in the multi-floor organisation, using an improved genetic algorithm. Case study: Isfahan Governorate
    scientific article; zbMATH DE number 7428650

      Statements

      A multi-objective model to allocate multiple facilities at proposed locations in the multi-floor organisation, using an improved genetic algorithm. Case study: Isfahan Governorate (English)
      0 references
      0 references
      0 references
      17 November 2021
      0 references
      Summary: The impressive role in the proper design of facility layout on productivity cannot be simply overlooked. So far, many models of the genetic algorithm have been introduced to solve such problems. The common approach of all these methods is to eliminate unacceptable answers. But given that unacceptable responses also have positive characteristics that can have a positive effect on next-generation fitness, this positive character can be exploited. In the multi-objective and multi-scale model presented, graded punishment is intended for such solutions, but will benefit from their positive features. Finally, the effectiveness of this method was evaluated by studying a case study. The results confirm the model's ability to improve the existing conditions. The main application of this model, in multi-layered organizations, is the allocation of several facilities to one location, depending on its capacity. It is also used to design workshop facility layouts.
      0 references
      genetic algorithm
      0 references
      basic layout model
      0 references
      fitness function
      0 references
      objective function
      0 references
      mutation
      0 references
      crossover
      0 references

      Identifiers