Machine layout problem in flexible manufacturing systems
Operations Research
Methods for the one-dimensional space allocation problem
Computers and Operations Research
Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
Discrete Applied Mathematics - Special volume: viewpoints on optimization
Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators
Artificial Intelligence Review
A Template for Scatter Search and Path Relinking
AE '97 Selected Papers from the Third European Conference on Artificial Evolution
Scatter Search: Methodology and Implementations in C
Scatter Search: Methodology and Implementations in C
An ant algorithm for the single row layout problem in flexible manufacturing systems
Computers and Operations Research
Distance measures based on the edit distance for permutation-type representations
Journal of Heuristics
A new lower bound for the single row facility layout problem
Discrete Applied Mathematics
An Exact Approach to the One-Dimensional Facility Layout Problem
Operations Research
Provably near-optimal solutions for very large single-row facility layout problems
Optimization Methods & Software - GLOBAL OPTIMIZATION
A particle swarm optimization for the single row facility layout problem
Computers and Industrial Engineering
Note: A polyhedral study of triplet formulation for single row facility layout problem
Discrete Applied Mathematics
The corridor allocation problem
Computers and Operations Research
Insertion based Lin-Kernighan heuristic for single row facility layout
Computers and Operations Research
A computational study and survey of methods for the single-row facility layout problem
Computational Optimization and Applications
| Hi-index | 0.00 |
The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, with the objective of minimizing the weighted sum of the distances between all pairs of facilities. The problem is NP-hard and research has focused on heuristics to solve large instances of the problem. In this paper we present a scatter search algorithm to solve large size SRFLP instances. Our computational experiments show that the scatter search algorithm is an algorithm of choice when solving large size SRFLP instances within limited time.