Volume 19, Issue 1 (International Journal of Engineering 2008)                   IJIEPR 2008, 19(1): 33-42 | Back to browse issues page

XML Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Tavakkoli-Moghaddam R, Aryanezhad M, Kazemipoor H, Salehipour A. A Threshold Accepting Algorithm for Partitioning Machines in a Tandem Automated Guided Vehicle . IJIEPR 2008; 19 (1) :33-42
URL: http://ijiepr.iust.ac.ir/article-1-20-en.html
1- , tavakoli@ut.ac.ir
Abstract:   (18693 Views)

Abstract : A tandem automated guided vehicle (AGV) system deals with grouping workstations into some non-overlapping zones , and assigning exactly one AGV to each zone. This paper presents a new non-linear integer mathematical model to group n machines into N loops that minimizes both inter and intra-loop flows simultaneously. Due to computational difficulties of exact methods in solving our proposed model, a threshold accepting (TA) algorithm is proposed. To show its efficiency, a number of instances generated randomly are solved by this proposed TA and then compared with the LINGO solver package employing the branch-and-bound (B/B) method. The related computational results show that our proposed TA dominates the exact algorithm when the size of instances grows.

  

Full-Text [PDF 189 kb]   (2443 Downloads)    
Type of Study: Research | Subject: Material Managment
Received: 2009/04/20 | Published: 2008/03/15

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

Send email to the article author


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