A THRESHOLD ACCEPTING ALGORITHM FOR PARTITIONING MACHINES IN A TANDEM AUTOMATED GUIDED VEHICLE
عنوان مقاله: A THRESHOLD ACCEPTING ALGORITHM FOR PARTITIONING MACHINES IN A TANDEM AUTOMATED GUIDED VEHICLE
شناسه ملی مقاله: JR_IJIEPR-19-1_001
منتشر شده در شماره 1 دوره 19 فصل در سال 1387
شناسه ملی مقاله: JR_IJIEPR-19-1_001
منتشر شده در شماره 1 دوره 19 فصل در سال 1387
مشخصات نویسندگان مقاله:
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.
خلاصه مقاله:
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.
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.
کلمات کلیدی: Tandem AGV, Machine Grouping, Mathematical Model, Threshold Accepting Algorithm
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/281253/