A THRESHOLD ACCEPTING ALGORITHM FOR PARTITIONING MACHINES IN A TANDEM AUTOMATED GUIDED VEHICLE
Publish place: International Journal of Industrial Engineering & Production Research، Vol: 19، Issue: 1
Publish Year: 1387
نوع سند: مقاله ژورنالی
زبان: English
View: 753
This Paper With 10 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJIEPR-19-1_001
تاریخ نمایه سازی: 7 شهریور 1393
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.
Keywords:
Authors
R. Tavakkoli-Moghaddam
Associate professor in Department of Industrial Engineering and Engineering Optimization Research Group, University of Tehran
M.B. Aryanezhad
professor in Department of Industrial Engineering, Iran University of Science and Technology,
H. Kazemipoor
H. Kazemipoor: PhD student, Department of Industrial Engineering, Islamic Azad University-Parand Branch,
A. Salehipour
PhD student, Department of Industrial Engineering, Faculty of Engineering, Tarbiat Modarres University.