Volume 23, Issue 1 (7-2004)                   jame 2004, 23(1): 71-81 | Back to browse issues page

XML Persian Abstract Print

Download citation:
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. jame 2004; 23 (1) :71-81
URL: http://jame.iut.ac.ir/article-1-303-en.html
Abstract:   (5444 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.
Full-Text [PDF 221 kb]   (1034 Downloads)    
Type of Study: Research | Subject: General
Received: 2014/10/25 | Published: 2004/07/15

Add your comments about this article : Your username or Email:

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

© 2022 CC BY-NC 4.0 | Journal of Advanced Materials in Engineering (Esteghlal)

Designed & Developed by : Yektaweb