Population Heuristics for the Corridor Allocation Problem
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 practical applications in arrangements of rooms in oces and in hospitals. The problem is NP-hard. In this paper, we present two population based metaheuristic implementations for the problem; a genetic algorithm with local search embedded in it, and a scatter search algorithm with path relinking. We report the results of our experiments with these algorithms on benchmark instances with up to 49 facilities.
Authors: | Ghosh, Diptesh ; Kothari, Ravi |
---|---|
Institutions: | Economics, Indian Institute of Management |
Saved in:
freely available
Saved in favorites
Similar items by person