جلد 19، شماره 1 - ( 12-1386 )                   جلد 19 شماره 1 صفحات 33-42 | برگشت به فهرست نسخه ها


XML English Abstract 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-fa.html
A Threshold Accepting Algorithm for Partitioning Machines in a Tandem Automated Guided Vehicle . نشریه بین المللی مهندسی صنایع و تحقیقات تولید. 1386; 19 (1) :33-42

URL: http://ijiepr.iust.ac.ir/article-1-20-fa.html


چکیده:   (13421 مشاهده)

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.

  

     
نوع مطالعه: پژوهشي | موضوع مقاله: Material Managment
دریافت: ۱۳۸۸/۱/۳۱

ارسال نظر درباره این مقاله : نام کاربری یا پست الکترونیک شما:
کد امنیتی را در کادر بنویسید

کلیه حقوق این وب سایت متعلق به نشریه بین المللی مهندسی صنایع و تحقیقات تولید می باشد.

طراحی و برنامه نویسی : یکتاوب افزار شرق

© 2015 All Rights Reserved | International Journal of Industrial Engineering & Production Research

Designed & Developed by : Yektaweb