Mathematical model of emptying the picking warehouse in the conditions of changing the production program (crisis) with heterogeneous peak containers

Mathematical model of emptying the picking warehouse in the conditions of changing the production program (crisis) with heterogeneous peak containers

Amir Reza Ahmadi Keshavarz1 Davood Jaafari2 Mehran Khalaj3 Parshang Dokouhaki4

1) Department of Industrial Engineering, Parand Branch Islamic Azad University, Parand, Iran Email:
2) Department of Industrial Engineering, Parand Branch Islamic Azad University, Parand, Iran Email:
3) Department of Industrial Engineering, Parand Branch Islamic Azad University, Parand, Iran Email:
4) Department of Industrial Engineering, Parand Branch Islamic Azad University, Parand, Iran Email:

IOI Code : XDAA-EKBCK
Publication : 2 nd- Scientific Research Conference on Management, Economics and Accounting(cmeaconf.com)
Abstract :
    Planning to unload Picking parts is one of the most challenging issues when changing production plans (crises). Since picking containers are one of the limited resources at this time, their optimal use is of great importance. In this paper, a two-objective model of simultaneous routing and scheduling of picking containers is proposed to discharge parts from picking warehouse cells to logistics areas and warehouses. The two goals considered in the model include minimizing total shipping time and maximizing route reliability. To solve the proposed model, two methods of ant colony algorithm (ACO) and particle density algorithm (PSO) have been used to achieve the best answer. In the proposed model, it is possible to serve each cell damaged by several picking containers, heterogeneous fleet of courier containers, the Capacity limitation for warehouses and logistics areas. To show the efficiency of the proposed model, the model is executed on a random sample and the computational results are presented.

Keywords : picking routing parallel aisle two way optimization