2022/07/12 by Kai Zhang, Kai, Zhang, Chuanhou, Gao
Engineering · #Advanced Manufacturing and Logistics Optimization #FOS: Mathematics #Optimization and Control (math.OC) #Optimization and Packing Problems #Vehicle Routing Optimization Methods
paper · pdf · doi:10.48550/arxiv.2207.05305
openalex publication_date 2022/07/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Order picking is the process of retrieving ordered products from storage locations in warehouses. In picker-to-parts order picking systems, two or more customer orders may be grouped and assigned to a single picker. Then routing decision regarding the visiting sequence of items during a picking tour must be made. (J.Won and S.Olafsson 2005) found that solving the integrated problem of batching and routing enables warehouse managers to organize order picking operations more efficiently compared with solving the two problems separately and sequentially. We therefore investigate the mathematical programming formulation of this integrated problem. We present several improved formulations for the problem based on the findings of (Valle, Beasley, and da Cunha 2017), that can significantly improve computational results. More specifically, we reconstruct the connectivity constraints and generate new cutting planes in our branch-and-cut framework. We also discuss some problem properties by studying the structure of the graphical representation, and we present two types of additional constraints. We also consider the no-reversal case of this problem. We present efficient formulations by building different auxiliary graphs. Finally, we present computational results for publicly available test problems for single-block and multiple-block warehouse configurations