The 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 operating activities That any poor performance in this process can lead to dissatisfaction with the service and operating costs.This research seeks to obtain a method forsequencing relocating storaged coil (or container) from warehouse(or terminal yard) to minimize retrieval time or minimizing the numberof relocations during this process. In this research , A mathematical model for the coil relocating problem with objective of minimizing the total relocation time is proposed. Also , an algorithm is proposed for this problem, which is very efficient in terms of time and solution quality.This algorithm for problems with the actual size achieving results in less than a second.In terms of solution quality in comparison with the mathematical model in half the cases the optimum solution is achieved.In cases with non-optimal solution,solution is between 5.4% rather than model solution. A new mathematical model with number of cutting plane,for container (coil) relocation problem under certain assumptions, has been proposed.Comparisons show that proposed model in rather than the literature 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 group sequence is flexible, has been developed. To solve big real size problems , two algorithm is proposed.The first algorithm, based on the proposed mathematical 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 than first algorithm has an advantage.this algorithm for problems with large size achiving answer in less than 1 second. In terms of solution quality in 95% ofcases the optimum solution is reached,that indicating the effectiveness of the algorithm.