Order Picking Problem in a Warehouse with Bi-Objective Genetic Algorithm Approach: Case Study

OpenAlex İngilizce

In this paper, an order picking problem with the capacitated forklift in a warehouse is studied by considering the total distance and the penalized earliness/tardiness. These objectives are important to reduce transportation costs and to satisfy customer expectations. Since this problem has been known as NP-hard, a genetic algorithm (GA) is proposed to solve the bi-objective order picking problem. The proposed approach is applied to auto components industry that produces wire harnesses responsible for all electrical functions in the vehicle. Experimental design is used for tuning the influential parameters of the proposed GA. The GA approach was solved by weighted sum scalarization.