QQCWB

GV

Modified Genetic Algorithms For Solving Facility Layout Problems

Di: Ava

Bénabès, J., Poirson, E., Bennis, F.: Integrated and interactive method for solving layout optimization problems. Expert Syst. Appl. 40 (15), 5796–5803 (2013) 1 Introduction Efficient organization and facility layout can significantly reduce operational costs related to product and material handling. Solving Facility Layout Problems (FLPs) involves determining the most effective arrangement of a set of facilities—whether machines, load centers, or departments—on the floor of a productive system. These arrangements must satisfy Islier’s algorithm for the multi-facility layout problem and an improved genetic algorithm for the ship layout design problem are discussed. A new, hybrid genetic algorithm incorporating local search technique to further the improved genetic algorithm’s practicality is proposed.

The placement of facilities is a fundamental task in many industries, and the facility layout problem is frequently encountered. This paper describes the implementation of a modified genetic algorithm for solving the facility layout problem by minimizing the total material handling the cost.

(PDF) Solving facility layout problems with strict geometric ...

The component layout problem requires efficient search of large, discontinuous spaces. The efficient layout planning of a production site is a fundamental task to any project undertaking. This paper describes a genetic algorithm (GA) to solve the problem of optimal facilities layout in manufacturing system design so that material-handling costs are minimized. The performance To solve the problem a multi-objective population-based on simulated annealing algorithm (MPS) and a Modified Non-dominated Sorting Genetic Algorithm II (MNSGA-II) was proposed then six case studies were solved by them. The aim of this article is to apply Genetic Algorithms to solve factory layout problems. Within these type of problems, we focus a particular case whi

Modified genetic algorithms for solving facility layout problems

Abstract This paper proposes a new multi objective genetic algorithm (MOGA) for solving unequal area facility layout problems (UA-FLPs). The genetic algorithm suggested is based upon the slicing structure where the relative locations of the facilities on the floor are represented by a location matrix encoded in two chromosomes.

This paper proposes a new multi objective genetic algorithm (MOGA) for solving unequal area facility layout problems (UA-FLPs). The genetic algorithm suggested is based upon the slicing structure where the relative locations of the facilities on the floor are represented by a location matrix encoded in two chromosomes. A tool for solving stochastic dynamic facility layout problems with stochastic demand using either a Genetic Algorithm or modified Backtracking Search Algorithm This paper describes a genetic algorithm (GA) to solve the problem of optimal facilities layout in manufacturing systems design so that material-handling costs are minimized. The paper considers the various material flow patterns of manufacturing environments of flow shop layout, flow-line layout (single line) with multi-products, multi-line layout, semi-circular and

A tool for solving stochastic dynamic facility layout problems with stochastic demand using either a Genetic Algorithm or modified Backtracking Search Algorithm Article Full-text available May 2016 Then, we use a modified version of the multi-objective ant colony optimization (MOACO) algorithm which is a heuristic global optimization algorithm and has shown promising performances in solving many optimization problems to solve the multi-objective UA-FLP. With the huge advance in artificial intelligence and the rapid development of intelligent swarm algorithms, the exploration of facility layout problem (FLP) with its non-deterministic polynomial-time (NP-Hard) nature has gained much more attention.

Abstract Layout problems are found in several types of manufacturing systems. Typically, layout problems are related to the location of facilities (e. g. machines, departments) in a plant. They are known to greatly impact the system performance. Most of these problems are NP hard. Numerous research works related to facility layout have been published. A few 1 Introduction Efficient organization and facility layout can significantly reduce operational costs related to product and material handling. Solving Facility Layout Problems (FLPs) involves determining the most effective arrangement of a set of facilities—whether machines, load centers, or departments—on the floor of a productive system. These arrangements must satisfy

Genetic algorithm sequence for solving optimization problems | Download ...

The document discusses the application of a genetic algorithm to solve the facility layout problem, focusing on scenarios with non-restricted space and a predetermined length-to-width ratio. It introduces a two-leveled chromosome design to optimize transportation costs while ensuring efficient facility arrangement based on specific rules. Aiello et al. (2013) utilized a Genetic Algorithm (GA) for solving a multi-objective programming problem in unequal area facility layout. Objectives included minimizing total material handling costs, distance and closeness requirements A tool for solving stochastic dynamic facility layout problems with stochastic demand using either a genetic algorithm or modified backtracking search algorithm.

Download Citation | On Sep 28, 2024, Saeideh Salimpour and others published Solving dynamic facility layout problem using a hybridized heuristic dynamic programming approach | Find, read and cite

In the layout planning, changes in product demand and uncertainty caused by demand prediction need to be considered simultaneously to cope with the market changes. To this end, a dynamic facility layout problem (DFLP) is studied to optimize cost and area utilization considering the uncertain product demands. An improved multi-objective pigeon-inspired Abstract This paper proposes a new multi objective genetic algorithm (MOGA) for solving unequal area facility layout problems (UA-FLPs). The genetic algorithm suggested is based upon the slicing structure where the relative locations of the facilities on the floor are represented by a location matrix encoded in two chromosomes. Tam and Chan (1998) present a parallel genetic algorithm approach to solve the facility layout problem. They adopt a slicing tree representation of a floor layout. The coding scheme represents a

Vitayasak S, Pongcharoen P, and Hicks C A tool for solving stochastic dynamic facility layout problems with stochastic demand using either a genetic algorithm or modified backtracking search algorithm International Journal of Production Economics 2017 190 146-157

A state-of-the-art review, spanning the last two decades, on application of metaheuristic methods in facility layout problems (FLPs) to gauge the current and emerging trends involving new design objectives, algorithms and methodologies to the combinatorial optimisation aspects is presented in this work. Fresh developments in emerging layout research, as analysed in this study, Request PDF | On Jun 1, 2015, Ali Derakhshan Asl and others published Solving unequal area static facility layout problems by using a modified genetic algorithm | Find, read and cite all the A stochastic dynamic facilities layout tool (SDFLT) was developed for solving the stochastic dynamic facilities layout problem that included a Genetic Algorithm, a Backtracking Search Algorithm and modified Backtracking Search Algorithms.

The positioning and layout of facilities on a construction site is important to enhance efficiency, productivity and safety. In this paper, three metaheuristics, Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and Ant Colony Optimization (ACO), are proposed to solve the construction site layout problem in which facilities are positioned to locations so the The facility layout problem (FLP) has many practical applications and is known to be NP-hard. During recent decades exact and heuristic approaches have been proposed in the literature to solve FLPs. In this paper we review the most recent developments regardingsimulated annealing and genetic algorithms for solvingfacility layout problems approximately. Layout problems are found in several types of manufacturing systems. Typically, layout problems are related to the location of facilities (e.g., machines, departments) in a plant. They are known to greatly impact the system performance. Most of these problems are NP hard. Numerous research works related to facility layout have been published. A few literature

Enhancing Facility Layout Optimization: A Performance Analysis of Genetic Algorithm Variants in Dynamic Facility Layout Problems Function optimization is a significant issue in the fields of mathematics and computer science, finding extensive applications across various domains in the real world. Genetic algorithms serve as a global, parallel, and efficient search method for solving function optimization and search problems. Despite the widespread use of genetic algorithms in diverse fields, their intrinsic Request PDF | A tool for solving stochastic dynamic facility layout problems with stochastic demand using either a Genetic Algorithm or modified Backtracking Search Algorithm | Facility layout

Abstract Facility layout problems have a significant impact on the productivity and efficiency of the manufacturing systems. Generally, layout problems deal with the optimization of facility space and locations (e. g. machines, departments) and are oriented to optimize the system’s performance within the facility space.

Liuand Li (2006) ameliorated the innovative search approach used to solve the facility parameters of genetic algorithms to determine the layout problems by many researchers (Banerjee and optimal locations of the departments in the supply Zhou, 1995; Azadivar and Wang, 2000; Wu and chain-oriented dynamic facility layout problem. This paper presents an investigation of the applicability of a genetic approach for solving the construction site layout problem. This problem involves coordinating the use of limited site space to accommodate temporary facilities so that

New developments of various techniques provide a perspective of the future research in facility layout problems. A trend toward multi-objective approaches, developing facility layout software using meta-heuristics such as simulated annealing (SA), genetic algorithm (GA) and concurrent engineering to facility layout is observed.