WWWei Wang

Wei Wang

*This is an algorithmically generated author record based on publicly available information.

Wei Wang has a total of 6 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Virtual pallet design in tobacco sorting system

    by Xiao Chen, Guobo Li, Wei Wang

    The main purpose of this paper is to build a mathematical model of virtual pallet in tobacco logistics center. We take Beijing Tobacco Sorting System as an example to verify the consistency of the mathematical model. The experiment shows the model is reasonable and when optimal length of virtual pallet is suggested, the sorting efficiency is increased by 7.8%.

  • Open Access

    Storage Assignment Optimization in Robotic Mobile Fulfillment Systems

    by Ruiping Yuan, Juntao Li, Wei Wang, Jiangtao Dou, Luke Pan

    Robotic mobile fulfillment system (RMFS) is a new type of parts‐to‐picker order picking system, where robots carry inventory pods to stationary pickers. Because of the difference in working mode, traditional storage assignment methods are not suitable for this new kind of picking system. This paper studies the storage assignment optimization of RMFS, which is divided into products assignment stage and pods assignment stage. In the products assignment stage, a mathematical model maximizing the total correlation of products in the same pods is established to reduce the times of pod visits, and a scattered storage policy is adopted to reduce system congestion. A heuristic algorithm is designed to solve the model. In the pods assignment stage, a model is established minimizing the total picking distance of the mobile robots considering the turnover rate and the correlation of pods as well as the workload balance among picking corridors. A two‐stage hybrid algorithm combining greedy algorithm and improved simulated annealing is designed to solve the model. Finally, a simulation experiment is carried out based on the historical order data of an e‐commerce company. Results show that the storage assignment method proposed in the paper significantly improves the efficiency of order picking.