Search
Now showing items 1-7 of 7
Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
(2013-11-20)
The single row facility layout problem (SRFLP) is the problem of arranging facilities with
given lengths on a line, while minimizing the weighted sum of the distances between all pairs
of facilities. The problem is ...
A Lin-Kernighan heurisitic for single row facility layout
(2013-11-25)
The single row facility layout problem (SRFLP) is the problem of arranging facilities with
given lengths on a line, while minimizing the weighted sum of the distances between all pairs
of facilities. The problem is known ...
Population Heuristics for the Corridor Allocation Problem
(2013-11-22)
The corridor allocation problem is one of assigning a given set of facilities in two rows
along a straight corridor so as to minimize a weighted sum of the distances between every
pair of facilities. This problem has ...
A competitive genetic algorithm for single row facility layout
(2013-11-25)
The single row facility layout is the NP-Hard problem of arranging facilities with given
lengths on a line, so as to minimize the weighted sum of the distances between all pairs of
facilities. Owing to the computational ...
Path relinking for single row facility layout
(2013-11-22)
The single row facility layout problem is the problem of arranging facilities with given lengths
on a line, while minimizing the weighted sum of the distances between all pairs of facilities. The
problem is NP-hard. In ...
Scatter search algorithms for the single row facility layout problem
(2013-11-25)
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 ...
Sensitivity Analysis for the Single Row Facility Layout Problem
(2013-11-25)
The single row facility layout problem (SRFLP) is an important combinatorial optimization
problem where a given set of facilities have to be arranged in a single row so as to minimize the
weighted sum of the distances ...