The Optimization Of The Order Batching And Replenishment Route About A Distribution Center Of D Company

Recently, due to the increasingly fierce industry competition, companies choose to establish distribution center where the supply and demand of cargoes can be dispatched in a centralized way to reduce the logistics cost, meet customer demand for small batch and multi-frequency orders and improve customers service. The core process of the distribution center is order picking, including picking and replenishment operation, the efficiency and quality of which has direct influence on the whole benefit and service quality of the distribution center. The optimization of order picking, particular the order batching and the route of the replenishment is the important means to improve the efficiency and reduce operation cost. Taking the D distribution center of D company as an example, in order to solve the problems in the order batching and the route of the replenishment, two new algorithms are proposed in this thesis. Compared with other algorithms, the proposed new one is tested to verify the superiority and feasibility.The main contents of this thesis are as follows:(1) Based on the current analysis of order management in D company’s distribution center and the researches carried out by the domestic and international scholars. A mathematical model of order batching is constructed, which can be more in line with the actual situation of D company, and a storage position distance calculating approach for S type strategy sorting route is also improved.(2) A improved Particle Swarm Chemical Reaction Optimization algorithm is proposed for the problem of Transit order batching in the distribution center of D company. The proposed algorithm in this thesis can effectively solve the defect of no information transmission between molecular and slow convergence of the Chemical Reaction Optimization algorithm. At the same time, the metathesis reaction mechanism, which can greatly improve the ability of jumping out of local optimum, is constructed to solve the defect of prematurity of Particle Swarm Optimization algorithm, thereby improving the ability of optimization. This algorithm is also applied to solve the batching problem of Transit order of D company, and compared with the Particle Swarm Optimization algorithm, Chemical Reaction Optimization algorithm, Particle Swarm Chemical Reaction Optimization algorithm has its advantages in solving the problem of order batching.(3) In order to solve the optimization problem of the replenishment route of Pallet storage area in distribution center of D company, A mathematical model in this thesis about the dual zone type of replenishment route is constructed, and a convenient and accurate coding method of storage position distance is discussed and analyzed. A Stage Initialization Particle Swarm Optimization algorithm is also proposed to seek the solution of the mathematical model. compared with the Particle Swarm Optimization algorithm, Gradient Particle Swarm Optimization algorithm, and Particle Swarm Chemical Reaction Optimization algorithm, Stage Initialization Particle Swarm Optimization algorithm has its advantages in solving the problem of replenishment route optimization.The outcomes of this research provides a beneficial practice for the distribution center which is mainly based on manual order picking operation.