Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem
From MaRDI portal
Publication:320805
DOI10.1016/J.EJOR.2015.08.014zbMath1346.90496OpenAlexW2198872097MaRDI QIDQ320805
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.08.014
metaheuristicsvariable neighborhood searchant colony optimizationevolutionary computationssingle row facility layout problem
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (9)
Construction heuristics for the single row layout problem with machine-spanning clearances ⋮ A \(\beta\)-accurate linearization method of Euclidean distance for the facility layout problem with heterogeneous distance metrics ⋮ Learning variable neighborhood search for a scheduling problem with time windows and rejections ⋮ Evolutionary neighborhood discovery algorithm for agricultural routing planning in multiple fields ⋮ 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 ⋮ A decomposition-based algorithm for the double row layout problem ⋮ A new solution method of ant colony-based logistic center area layout problem ⋮ New exact approaches to row layout problems
Cites Work
- Insertion based Lin-Kernighan heuristic for single row facility layout
- A computational study and survey of methods for the single-row facility layout problem
- A polyhedral approach to the single row facility layout problem
- Single row facility layout problem using a permutation-based genetic algorithm
- Efficient models for the facility layout problem
- Methods for the one-dimensional space allocation problem
- Variable neighbourhood search: methods and applications
- A new lower bound for the single row facility layout problem
- Experimental analysis of simulated annealing based algorithms for the layout problem
- An ant algorithm for the single row layout problem in flexible manufacturing systems
- Unified compression-based acceleration of edit-distance computation
- The single row facility layout problem: state of the art
- Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
- An efficient tabu algorithm for the single row facility layout problem
- Variable neighbourhood search for bandwidth reduction
- An efficient genetic algorithm for single row facility layout
- 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
- Provably near-optimal solutions for very large single-row facility layout problems
- 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
- Optimal and Heuristic Procedures for Row Layout Problems in Automated Manufacturing Systems
- One-Dimensional Space Allocation: An Ordering Algorithm
This page was built for publication: Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem
