Ant colony algorithm for the shortest loop design problem
In this paper, a new algorithm for solving the shortest loop design problem is presented. The shortest loop design problem is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. In this paper, first it is shown that this problem can be represented as a graph model. The properties of the presented model enable us to design a meta-heuristic based on ant colony system algorithm for solving the shortest loop design problem. Computational results show the. efficiency of our algorithm in compare to the other techniques. (c) 2006 Elsevier Ltd. All rights reserved.
shortest loop design problem ant colony optimization algorithm meta-heuristic algorithms