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.014zbMATH Open1346.90496OpenAlexW2198872097MaRDI QIDQ320805FDOQ320805
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
Recommendations
- A hybrid ant colony optimization algorithm for solving facility layout problems formulated as quadratic assignment problems
- An ant algorithm for the single row layout problem in flexible manufacturing systems
- An efficient variable neighborhood search for the space-free multi-row facility layout problem
- Applying ant system for solving unequal area facility layout problems
- A GRASP algorithm for solving large-scale single row facility layout problems
ant colony optimizationmetaheuristicsvariable neighborhood searchevolutionary computationssingle row facility layout problem
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Cites Work
- 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
- 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
- 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
- Insertion based Lin-Kernighan heuristic for single row facility layout
- Provably near-optimal solutions for very large single-row facility layout problems
- A computational study and survey of methods for the single-row facility layout problem
- A polyhedral approach to the single row facility layout problem
- On the One-Dimensional Space Allocation Problem
- Optimal and Heuristic Procedures for Row Layout Problems in Automated Manufacturing Systems
- Single row facility layout problem using a permutation-based genetic algorithm
- One-Dimensional Space Allocation: An Ordering Algorithm
- Efficient models for the facility layout problem
- Methods for the one-dimensional space allocation problem
- Unified compression-based acceleration of edit-distance computation
- Variable neighbourhood search for bandwidth reduction
- Deux problèmes d'affectation non linéaires
- On Solving A One-Dimensional Space Allocation Problem With Integer Programming
Cited In (13)
- Learning variable neighborhood search for a scheduling problem with time windows and rejections
- A decomposition-based algorithm for the double row layout problem
- A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem
- A GRASP algorithm for solving large-scale single row facility layout problems
- New exact approaches to row layout problems
- An efficient variable neighborhood search for the space-free multi-row facility layout problem
- Construction heuristics for the single row layout problem with machine-spanning clearances
- A hybrid ant colony optimization algorithm for solving facility layout problems formulated as quadratic assignment problems
- A new solution method of ant colony-based logistic center area layout problem
- Evolutionary neighborhood discovery algorithm for agricultural routing planning in multiple fields
- A \(\beta\)-accurate linearization method of Euclidean distance for the facility layout problem with heterogeneous distance metrics
- An ant algorithm for the single row layout problem in flexible manufacturing systems
- Optimisation of complex and large-sized single-row facility layout problems with a unique hybrid meta-heuristic framework
This page was built for publication: Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q320805)
