RT - Journal Article
T1 - Ant Colony Algorithm for the Single Loop Routing Problem
JF - iut-jame
YR - 2004
JO - iut-jame
VO - 23
IS - 1
UR - http://jame.iut.ac.ir/article-1-303-en.html
SP - 71
EP - 81
K1 - Single loop routing problem
K1 - Ant colony optimizaion algorithm
K1 - Meta-heuristic algorithms
AB - 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.
LA eng
UL http://jame.iut.ac.ir/article-1-303-en.html
M3
ER -