Volume 23, Issue 1 (7-2004)
2004, 23(1): 71-81 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
K. Eshgee and M. Kazemi. Ant Colony Algorithm for the Single Loop Routing Problem. Computational Methods in Engineering 2004; 23 (1) :71-81
URL: http://jcme.iut.ac.ir/article-1-303-en.html
URL: http://jcme.iut.ac.ir/article-1-303-en.html
Abstract: (3865 Views)
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.
