الفهرس يوجد فقط 14 صفحة متاحة للعرض العام
 |  | from | 171 |  |  |
| | | from | 171 | | |
المستخلص
ABSTRACT
The research on warehousing systems gained interest since the 1970’s. One of the modern global economy depends on the efficient flow of products. Products can be stored temporarily in warehouses and retrieving products from storage can be fill customer orders. However, warehousing generally requires a considerable amount of product handling, which is time consuming. One way to decrease handling time is an entirely new design of the warehouse. But often it is also possible to decrease handling time by less radical methods such as changing the operational procedures.
order picking and material handling, in general, have received considerable attention. order Picking is the process of retrieving items from storage in response to a specific customer request. It is employed in warehouses of every kind, from small, manually served spare-part warehouses of small firms to large, high-bay warehouses which serve as supply depots for a country. order picking is becoming a more significant operation. According to the literature, in warehouses and distribution centers, products have to be picked from specified storage locations on the basis of customer orders. In general, the order picking process is the most laborious of all warehouse processes. It may consume as much as 60% of all labor activities in the warehouse.
In this study, three order picking routing methods for warehouses with multiple cross-aisles are proposed. The proposed methods named as Block-aisle1, Block-aisle2, and Nearest cross-aisle. These methods are introduced to find a sequence in which products have to be retrieved from the storage locations such that the travel distances are short as possible.
A computer program is designed and constructed to determine appropriate order picking methods which have the minimum travel distance. The basic idea of the proposed system is using the established software to determine the traveling distance for each order using the existing and proposed methods. The best method which provides minimum traveling distance will be chosen. A proposed algorithm is presented in the aim of reduction of the total consumed time in order picking process for warehouses with multiple cross-aisles.
from the comprehensive test and examination for the performance of the existing and proposed routing methods, no order picking routing method achieves the best over all the test problems features and configurations but the proposed heuristics are relatively have the best performance specially Block-aisle2 that appears to be best in the majority of the tested cases with different warehouses dimensions and different order size. Nearest cross-aisle and aisle by aisle methods perform best when the order size is relatively large with respect to the total number of storage locations within the warehouse. In the other hand, block-aisle2, block-aisle1, and combined methods will perform the best among the other methods when the order size is relatively small or the order size is relatively medium with respect to the total number of warehouse storage locations.