Fast local search for single row facility layout
Explore this paper's citation graph
Summary
Numerical results show that, for large SRFLP instances, the insertion-based local search (LS) algorithm is two orders of magnitude faster than the best existing LS techniques, and embeds this LS algorithm into the variable neighborhood search (VNS) framework.
- Type
- article
- Published
- 2015-11-01
- Cited by
- 61
- References
- 37
- OpenAlex
- https://openalex.org/W2200226441
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:6809943
Keywords
Variable neighborhood search, Computer science, Mathematical optimization, Variable (mathematics), Local search (optimization)
References
- Handbook on Semidefinite, Conic and Polynomial Optimization
- Metaheuristic methods for a class of the facility layout problem
- A branch-and-bound algorithm for the single-row equidistant facility layout problem
- Single-row equidistant facility layout as a special case of single-row facility layout
- Designing the layout of single- and multiple-rows flexible manufacturing system by genetic algorithms
- A new heuristic procedure for the single-row facility layout problem
- Efficient models for the facility layout problem
- A polyhedral approach to the single row facility layout problem
- An Exact Approach to the One-Dimensional Facility Layout Problem
- On the One-Dimensional Space Allocation Problem
- Variable neighbourhood search: methods and applications
- Single row facility layout problem using a permutation-based genetic algorithm
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- Tabu Search Applied to the Quadratic Assignment Problem
- Experimental analysis of simulated annealing based algorithms for the layout problem
- A new lower bound for the single row facility layout problem
- A scatter search algorithm for the single row facility layout problem
- Insertion based Lin-Kernighan heuristic for single row facility layout
- Methods for the one-dimensional space allocation problem
- A computational study and survey of methods for the single-row facility layout problem
Cited by
- Design and evaluation of layout alternatives to enhance the performance of industry
- Single row facility layout using multi-start simulated annealing
- An island model genetic algorithm for unequal area facility layout problems
- A variable neighborhood search and simulated annealing hybrid for the profile minimization problem
- Two Strategies Based on Meta-Heuristic Algorithms for Parallel Row Ordering Problem (PROP)
- Classification of facility layout problems: a review study
- Solving an extended multi-row facility layout problem with fuzzy clearances using GA
- Bi-objective corridor allocation problem using a permutation-based genetic algorithm hybridized with a local search technique
- A cross-entropy approach to the single row facility layout problem
- Construction heuristics for the single row layout problem with machine-spanning clearances
- Performance improvement of Teaching-Learning-Based Optimisation for robust machine layout design
- Branch and Bound for Facility Layout Problem Using Minimum Weighted Clique Problem in Complete K-partite Graph
- Solving single row facility layout problem with simplified swarm optimization
- Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization
- Hybridizing tabu search with mathematical programming for solving a single row layout problem
- A GRASP algorithm for solving large-scale single row facility layout problems
- New exact approaches to row layout problems
- Multi-Objective Optimization for Multi-Line and U-Shape Layout of Sewing Assembly Line in Apparel Industry
- MOEA/D With Linear Programming for Double Row Layout Problem With Center-Islands
- Population-based improvement heuristic with local search for single-row facility layout problem
Related papers
- A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
- Adaptive variable neighborhood search for solving multi-objective facility layout problems with unequal area facilities
- Noninferior Solution Grey Wolf Optimizer with an Independent Local Search Mechanism for Solving Economic Load Dispatch Problems
- A VNS-based hyper-heuristic with adaptive computational budget of local search
- Multiobjective Local Search Algorithm-Based Decomposition for Multiobjective Permutation Flow Shop Scheduling Problem
- Variable and large neighborhood search to solve the multiobjective set covering problem
- A Novel Variable Neighborhood Search Algorithm
- A memory and variable neighborhood structure based complete local search for the no-wait job shop problem
- GAUSSIAN VARIABLE NEIGHBORHOOD SEARCH FOR THE FILE TRANSFER SCHEDULING PROBLEM