Assessing the Performance of Two Bioinspired Algorithms to Solve Single-Row Layout Problem

Abstract EN

The single-row layout problem (SRLP), also known as the one-dimensional layout problem, deals with arranging a number of rectangular machines/departments with equal or varying dimensions on a straight line.

Since the problem is proved to be NP-hard, there are several heuristics developed to solve the problem.

This study introduces both a Clonal Selection Algorithm (CSA) and a Bacterial Foraging Algorithm (BFA) for SRLP.

The performance of the algorithms is assessed by using three (small, medium, and large sized) well known test problems available in the literature.

The promising results illustrated that both algorithms had generated the best known solutions so far for most of the problems or provided better results for a number of problems.