TY - JOUR
JF - iut-jame
JO - jame
VL - 23
IS - 1
PY - 2004
Y1 - 2004/7/01
TI - Ant Colony Algorithm for the Single Loop Routing Problem
TT - الگوریتم مورچهای برای طراحی مسیر حرکت باربران خودکار در سیستم تک حلقه
N2 - In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system is developed for ALRP by using the properties of the graph model. Computational results show the efficiency of the proposed algorithm in comparison with other techniques for solving SLRP.
SP - 71
EP - 81
AU - K. Eshgee and M. Kazemi,
AD -
KW - Single loop routing problem
KW - Ant colony optimizaion algorithm
KW - Meta-heuristic algorithms
UR - http://jame.iut.ac.ir/article-1-303-en.html
ER -