Single row facility layout problem using a permutation-based genetic algorithm
From MaRDI portal
Publication:545111
DOI10.1016/j.ejor.2011.03.034zbMath1215.90039OpenAlexW1994587583MaRDI QIDQ545111
André R. S. Amaral, Dilip Datta, José Rui Figueira
Publication date: 22 June 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.03.034
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (22)
Construction heuristics for the single row layout problem with machine-spanning clearances ⋮ Single row layout models ⋮ Fast local search for single row facility layout ⋮ Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem ⋮ A parallel ordering problem in facilities layout ⋮ Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm ⋮ Insertion based Lin-Kernighan heuristic for single row facility layout ⋮ The corridor allocation problem ⋮ A computational study and survey of methods for the single-row facility layout problem ⋮ A polyhedral approach to the single row facility layout problem ⋮ Mixed integer linear programming model and an effective algorithm for the bi-objective double-floor corridor allocation problem ⋮ Decorous combinatorial lower bounds for row layout problems ⋮ The single row facility layout problem: state of the art ⋮ An efficient genetic algorithm for single row facility layout ⋮ Corridor Allocation as a Constrained Optimization Problem Using a Permutation-Based Multi-objective Genetic Algorithm ⋮ The Constrained Single-Row Facility Layout Problem with Repairing Mechanisms ⋮ A GRASP algorithm for solving large-scale single row facility layout problems ⋮ A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem ⋮ Simulated annealing and tabu search approaches for the Corridor Allocation Problem ⋮ A fast algorithm to generate feasible solution of production facilities layout based on plane segmentation ⋮ New exact approaches to row layout problems ⋮ Exact approaches for the combined cell layout problem
Cites Work
- Unnamed Item
- Unnamed Item
- A polyhedral approach to the single row facility layout problem
- Efficient models for the facility layout problem
- A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems
- A new lower bound for the single row facility layout problem
- Experimental analysis of simulated annealing based algorithms for the layout problem
- A heuristic procedure for the single-row facility layout problem
- An efficient constraint handling method for genetic algorithms
- An ant algorithm for the single row layout problem in flexible manufacturing systems
- An efficient tabu algorithm for the single row facility layout problem
- On the exact solution of a facility layout problem
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes
- An Exact Approach to the One-Dimensional Facility Layout Problem
- On the One-Dimensional Space Allocation Problem
- Deux problèmes d'affectation non linéaires
- On Solving A One-Dimensional Space Allocation Problem With Integer Programming
- One-Dimensional Space Allocation: An Ordering Algorithm
This page was built for publication: Single row facility layout problem using a permutation-based genetic algorithm
