Mathematical Programming Models for Solving Unequal-Sized Facilities Layout Problems - a Generic Search Method
author
Abstract:
This paper present unequal-sized facilities layout solutions generated by a genetic search program named LADEGA (Layout Design using a Genetic Algorithm). The generalized quadratic assignment problem requiring pre-determined distance and material flow matrices as the input data and the continuous plane model employing a dynamic distance measure and a material flow matrix are discussed. Computational results on test problems are reported as compared with those of layout solutions generated by the branch and bound algorithm, a hybrid method merging simulated annealing and local search techniques and an optimization process of an enveloped block.
similar resources
Adaptive variable neighborhood search for solving multi-objective facility layout problems with unequal area facilities
In this paper, we report the results of our investigation of an evolutionary approach for solving the unequal area multi-objective facility layout problem (FLP) using the variable neighborhood search (VNS) with an adaptive scheme that presents the final layouts as a set of Pareto-optimal solutions. The unequal area FLP comprises a class of extremely difficult and widely applicable optimization ...
full textA Method for Solving Optimal Control Problems Using Genetic Programming
This paper deals with a novel method for solving optimal control problems based on genetic programming. This approach produces some trial solutions and seeks the best of them. If the solution cannot be expressed in a closed analytical form then our method produces an approximation with a controlled level of accuracy. Using numerical examples, we will demonstrate how to use the results.
full textAn efficient approach for solving layout problems
This paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. By this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. This is resulted from dividing area into discrete and continuous dimensions. Also defining decision var...
full textMathematical Programming Models for Solving Two Conference Planning Problems
Planning academic conferences is often a difficult, tedious and time-consuming task. This is because there are many possible designs that can be considered and created. Additionally many of the associated tasks are currently performed manually in an inefficient manner when they could easily be automated. The planning process is particularly important because high quality sessions can lose thei...
full textGenetic search for solving construction site-level unequal-area facility layout problems
A construction site represents a conflux of concerns, constantly calling for a broad and multi-criteria approach to solving problems related to site planning and design. As an important part of site planning and design, the objective of site-level facility layout is to allocate appropriate locations and areas for accommodating temporary site-level facilities such as warehouses, job offices, wor...
full textDefuzzification Method for Solving Fuzzy Linear Programming Problems
Several authors have proposed different methods to find the solution of fully fuzzy linear programming (FFLP) problems. But all the existing methods are based on the assumption that all the fuzzy coefficients and the fuzzy variables are non-negative fuzzy numbers. in this paper a new method is proposed to solve an FFLP problems with arbitrary fuzzy coefficients and arbitrary fuzzy variables, th...
full textMy Resources
Journal title
volume 12 issue 4
pages 233- 246
publication date 1999-11-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023