Distribution center is a complex system,which is composed of multiple operating processes.In general,the order picking process may consume as much as 60% of all labor activities in the distribution center,it is one of the main process of all distribution center.Therefore,the design and optimization of the order picking has a very significant impact on the operation efficiency of the distribution center.This paper take the order picking operation of distribution center as the research object,particularly,focus on the optimization of batching of orders and order picking path.With the condition of a plurality of sorting equipment and warehouse storage area,formulate the objective to determine how to batch the orders to minimize the weighted sum of order picking time and order lateness.Then,on the basis of batching the orders,the picking path optimization mathematical model is established.And apply the two optimization methods to an example to minimize the order picking time and lateness.For order batching problem,with the constraints of equipment quality and capacity,formulate the optimization model,so as to minimize the weighted sum of order picking time and order lateness.A heuristics—Improved Envelop Algorithm,based on Envelop Algorithm as well as Seed Algorithm and Savings Algorithm is designed to solve this problem.For order picking path optimization problem,the mathematical optimization model is established on the basis of the order batch strategy,aiming at minimize the weighted sum of order picking time and lateness of each batch.And the genetic algorithm of the problem is designed.In order to verify the validity of the mathematical optimization model and the algorithm,the actual data of the distribution center of an automobile manufacturing enterprise is selected for a period of time,and the established mathematical model and algorithm are verified.Batching the orders by the Improved Envelope Algorithm designed in this paper.Then,on the basis of order batching,DEV C++ programming is used to solve the genetic algorithm of picking path optimization.The example shows that batching the order by the improved envelope algorithm first,then optimize the picking route,which can reduce the order travel time as well as the order lateness to the minimum. |