9992

9222

كارشناسي ارشد

صنايع

اصفهان: دانشگاه صنعتي اصفهان، دانشكده صنايع و سيستم ها

1393

[نه]، 80ص.: مصور، جدول

ص.ع. به فارسي و انگليسي

مهدي بيجاري

94/2/20

بهروز ارباب شيراني، محمدسعيد صباغ

1396/09/27

كتابنامه

صنايع و سيستم ها

مهندسي صنايع و سيستم ها

ID9222

Steel coils retrieval sequencing from warehouse Sayyed Mohammad Majidi Sm majidi@in iut ac ir Date of Submission 2014 11 09 Department of Industrial and Systems Engineering Isfahan University of Technology Isfahan 84156 83111 Iran Degree M Sc Language PersianSupervisor Mehdi Bijari bijari@cc iut ac irAbstractThe cost of relocation operation includs more than a half of the total warehouse operating costs Furthermore order pickingoperations in warehouses often regarded as the most expensive operatingactivities That any poor performance in this process can lead to dissatisfaction with the service andoperating costs This research seeks to obtain a method forsequencing relocating storaged coil orcontainer from warehouse or terminal yard to minimize retrieval time or minimizing the numberofrelocations during this process In this research A mathematical model for the coil relocating problem with objective of minimizingthe total relocation time is proposed Also an algorithm is proposed for this problem which is veryefficient in terms of time and solution quality This algorithm for problems with the actual sizeachieving results in less than a second In terms of solution quality in comparison with themathematical model in half the cases the optimum solution is achieved In cases with non optimalsolution solution is between 5 4 rather than model solution A new mathematical model with number of cutting plane for container coil relocation problem undercertain assumptions has been proposed Comparisons show that proposed model in rather than theliterature model in average is 3 times faster to achieve the optimum solution Then this model for the case where different groups of items are in warehouse and the retrieval groupsequence is flexible has been developed To solve big real size problems two algorithm is proposed The first algorithm based on the proposedmathematical model and the second is based on the logical structure and decision rules of the problem Comparisons show that the second algorithm in terms of time and quality of the answer rather thanfirst algorithm has an advantage this algorithm for problems with large size achiving answer in lessthan 1 second In terms of solution quality in 95 of cases the optimum solution is reached thatindicating the effectiveness of the algorithm Key words coil retrieving container retrieving coil relocation container relocation mixed integerprogramming heuristic algorithm

مهدي بيجاري

بهروز ارباب شيراني، محمدسعيد صباغ