Use of Elephant Search Algorithm to Solve an Order Picking Problem in a Mobile Atelier

Abstract

Mobile ateliers, also called pop-up stores, sell their products away from their warehouse. Therefore, it causes them to go back to it once a product in their mobile store runs out since the customer is waiting for them at the store. The need to spend as little time searching for the product at the warehouse is of the utmost importance. To solve this problem, the authors have decided to attack it as an order picking problem. With the use of the elephant search algorithm, they aim to optimize the time it takes to retrieve the product needed to form the warehouse by giving the sales representative the optimum picking order route, so he can go in and out of the warehouse in as few steps as possible.