A Path Relinking-Based Approach for the Bi-Objective Double Floor Corridor Allocation Problem

The Bi-Objective Double Floor Corridor Allocation Problem is one of the most recent incorporation to the family of Facility Layout Problems. This problem, which has been a challenge for exact and metaheuristic approaches, involves optimizing the layout of the given facilities to minimize material handling cost and the length of the corridor considering more than one floor. This paper introduces a new approach based on the combination of two greedy methods and a path relinking implementation to tackle this problem. The experimental results show the superiority of our proposal in relation to the current state-of-the-art under different multi-objective metrics.