![]() ![]() These two alternatives have to be compared with each other after which the one, resulting in the shortest route, is chosen. In this routing strategy, developed by Roodbergen and De Koster (1998), every time all items of one aisle are picked, the question is posed whether to go to the rear end of an aisle or to return to the front end. If all items are picked, the picker returns to the depot. Now, the aisles are entered from the front end as far as the 'largest gap'. The last aisle is traversed entirely to the front. This aisle is traversed entirely after which each aisle at the rear end of the warehouse is entered as far as the 'largest gap' and left from the same side that it was entered. Thus, this is the most left or most right item containing aisle. Similar to the S-shape heuristic, the order picker starts at the depot and goes to the front of the aisle, closest to the depot, that contains at least one item. The Largest Gap heuristic is especially useful when the additional time to change aisles is short and the number of picks per aisle is low.īelow, you can see how the selected items are to be picked according to the Largest Gap heuristic in a warehouse with a central depot and no cross aisles. The back aisle can only be accessed through either the first or last aisle. The largest gap within an aisle is therefore the portion of the aisle that the picker does not traverse. Otherwise, a return route from either the front or back aisle is used. ![]() If the largest gap is between two adjacent picks, the picker performs a return route from both ends of the aisle. The largest gap is the part of the aisle that is not visited by the order picker. A gap represents the distance between any two adjacent picks, between the first pick and the front aisle, or between the last pick and the back aisle. In the Largest Gap strategy a picker enters an aisle as far as the largest gap within an aisle. The picker goes from one item to another by crossing the (item containing) aisles entirely. The order picker starts at the depot and then enters the left most aisle containing items or the right most aisle containing items, whichever is the closest. This strategy is used frequently, because it is very simple to use and to understand.īelow, you can see how the selected items are to be picked according to the S-shape heuristic in a warehouse with a central depot and no cross aisles. After picking the last item, the order picker returns to the front end of the aisle. The picker thus enters an aisle from one end and leaves the aisle from the other end, starting at the left side of the warehouse. Thus aisles are visited in the shape of an S. Aisles where nothing has to be picked are skipped. This strategy leads to a route in which the aisles, that are to be visited, are totally traversed. The S-shape strategy is also called the Traversal strategy. We have decided to take the following four routing strategies into this page: ![]() ![]() There are several routing strategies, but not all of them are suited for any situation. If you want to reduce the orderpicking costs to a minimum, the route have to be as short as possible. A route is a path in which you pass all items of an order. A routing strategy is a strategy by which the route through the warehouse is determined. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |