A min-max ANT colony algorithm for machine loop layout problem

This paper handles a problem of loop machine layout using one load and unload machine. The goal of this problem is to minimize the total cost of transporting parts within each manufacturing cell. The novelty of this study is based on the reformulation of the problem taking into consideration new variables which are generally neglected by recent researches like proximity constraints and machine dimensions. Hence, we aim to place these machines on a grid that represents the surface of the cell, in order to construct a loop layout while respecting proximity constraints. This new formulation led us to propose a two-stage approach to solve this problem. The first step consists in positioning the machines on a grid while respecting the proximity constraints and machines dimensions. The second step aims to optimize the path between these machines already positioned in order to minimize number of the loops travelled by parts. In this paper, the second step will be the center of our interesting. To solve this problem, we use ant colony optimization algorithm. The effectiveness of our approaches is demonstrated through numerical examples.