Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem
From MaRDI portal
(Redirected from Publication:320805)
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
Cites work
- A computational study and survey of methods for the single-row facility layout problem
- A new lower bound for the single row facility layout problem
- A polyhedral approach to the single row facility layout problem
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- An Exact Approach to the One-Dimensional Facility Layout Problem
- An ant algorithm for the single row layout problem in flexible manufacturing systems
- An efficient genetic algorithm for single row facility layout
- An efficient tabu algorithm for the single row facility layout problem
- Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
- Deux problèmes d'affectation non linéaires
- Efficient models for the facility layout problem
- Experimental analysis of simulated annealing based algorithms for the layout problem
- Insertion based Lin-Kernighan heuristic for single row facility layout
- Methods for the one-dimensional space allocation problem
- On Solving A One-Dimensional Space Allocation Problem With Integer Programming
- On the One-Dimensional Space Allocation Problem
- On the exact solution of a facility layout problem
- One-Dimensional Space Allocation: An Ordering Algorithm
- Optimal and Heuristic Procedures for Row Layout Problems in Automated Manufacturing Systems
- Provably near-optimal solutions for very large single-row facility layout problems
- Single row facility layout problem using a permutation-based genetic algorithm
- Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
- The single row facility layout problem: state of the art
- Unified compression-based acceleration of edit-distance computation
- Variable neighbourhood search for bandwidth reduction
- Variable neighbourhood search: methods and applications
Cited in
(13)- An ant algorithm for the single row layout problem in flexible manufacturing systems
- A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem
- Learning variable neighborhood search for a scheduling problem with time windows and rejections
- A decomposition-based algorithm for the double row layout problem
- 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
- New exact approaches to row layout problems
- An efficient variable neighborhood search for the space-free multi-row facility layout problem
- A hybrid ant colony optimization algorithm for solving facility layout problems formulated as quadratic assignment problems
- A GRASP algorithm for solving large-scale single row facility layout 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
- 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)
