A biased random-key genetic algorithm for the unequal area facility layout problem
From MaRDI portal
Publication:319725
DOI10.1016/j.ejor.2015.04.029zbMath1346.90495OpenAlexW2165121267MaRDI QIDQ319725
José Fernando Gonçalves, Mauricio G. C. Resende
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://repositorio.inesctec.pt/handle/123456789/5387
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (22)
A new way to produce key streams based on chaotic sequences ⋮ An efficient algorithm for unequal area facilities layout planning with input and output points ⋮ Using projected cutting planes in the extended cutting plane method ⋮ A differential evolution algorithm with self-adaptive strategy and control parameters based on symmetric Latin hypercube design for unconstrained optimization problems ⋮ A problem evolution algorithm with linear programming for the dynamic facility layout problem -- a general layout formulation ⋮ A biased random key genetic algorithm for the field Technician scheduling problem ⋮ A biased random-key genetic algorithm for the project scheduling problem with flexible resources ⋮ A \(\beta\)-accurate linearization method of Euclidean distance for the facility layout problem with heterogeneous distance metrics ⋮ Combining Wang-Landau sampling algorithm and heuristics for solving the unequal-area dynamic facility layout problem ⋮ The dial-a-ride problem with private fleet and common carrier ⋮ Multi-objective optimization of layout with functional constraints ⋮ The double traveling salesman problem with partial last‐in‐first‐out loading constraints ⋮ A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects ⋮ An enhanced GRASP approach for the index tracking problem ⋮ Heuristic algorithm for univariate stratification problem ⋮ Layout optimisation for an installation port of an offshore wind farm ⋮ A hybrid genetic algorithm with decomposition phases for the unequal area facility layout problem ⋮ Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions ⋮ Block layout for attraction-based enterprises ⋮ Integrated slicing tree approach for solving the facility layout problem with input and output locations based on contour distance ⋮ A new solution method of ant colony-based logistic center area layout problem ⋮ A genetic algorithm applied to optimal allocation in stratified sampling
Cites Work
- Unnamed Item
- A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
- A graph-pair representation and MIP-model-based heuristic for the unequal-area facility layout problem
- A new mixed integer programming formulation for facility layout design using flexible bays
- A random key based genetic algorithm for the resource constrained project scheduling problem
- Stats: A slicing tree and tabu search based heuristic for the unequal area facility layout problem
- Applying ant system for solving unequal area facility layout problems
- Heuristics for the dynamic facility layout problem with unequal-area departments
- The facility layout problem
- A nonlinear optimization approach for solving facility layout problems
- Optimal facility layout design
- A genetic algorithm for the weight setting problem in OSPF routing
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- An \(\varepsilon\)-accurate model for optimal unequal-area block layout design
- Applying the sequence-pair representation to optimal facility layout designs
- A genetic algorithm for the resource constrained multi-project scheduling problem
- A hybrid genetic algorithm for the job shop scheduling problem
- Enhanced Model Formulations for Optimal Facility Layout
- A simulated annealing algorithm for allocating space to manufacturing cells
- P-Complete Approximation Problems
- Preprocessing for static and dynamic facility layout problems
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Spine layout design
- A coevolutionary algorithm for a facility layout problem
- An iterative facility layout algorithm
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
This page was built for publication: A biased random-key genetic algorithm for the unequal area facility layout problem