Man Shan

Man Shan

Auto-generated profile, based on publicly available information

Man Shan

Beijing Wuzi University, School of Information, Beijing 101149, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 December 2023 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
凯梁凯博 梁
凯博 梁
HLHuwei Liu
Huwei Liu
MSMan Shan
Man Shan
JZJunhui Zhao
Junhui Zhao
XLXiaolan Li
Xiaolan Li
LZLi Zhou
Li Zhou

31 March 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
凯梁凯博 梁
凯博 梁
LZLi Zhou
Li Zhou
JYJianglong Yang
Jianglong Yang
HLHuwei Liu
Huwei Liu
YLYakun Li
Yakun Li
JYJin Yang
Jin Yang
Order picking is a crucial operation in the storage industry, with a significant impact on storage efficiency and cost. Responding quickly to customer demands and shortening picking time is crucial given the random nature of order arrival times and quantities. This paper presents a study on the order-picking process in a distribution center, employing a “parts-to-picker” system, based on dynamic order batching and task optimization. Firstly, dynamic arriving orders with uncertain information are transformed into static picking orders with known information. A new method of the hybrid time window is proposed by combining fixed and variable time windows, and an order consolidation batch strategy is established with the aim of minimizing the number of target shelves for picking. A heuristic algorithm is designed to select a shelf selection model, taking into account the constraint condition that the goods on the shelf can meet the demand of the selection list. Subsequently, task division of multi-AGV is carried out on the shelf to be picked, and the matching between the target shelf and the AGVs, as well as the order of the AGVs to complete the task of picking, is determined. A scheduling strategy model is constructed to consider the task completion time as the incorporation of moving time, queuing time, and picking time, with the shortest task completion time as the objective function and AGV task selection as the decision variable. The improved ant colony algorithm is employed to solve the problem. The average response time of the order batching algorithm based on a hybrid time window is 4.87 s, showing an improvement of 22.20% and 40.2% compared to fixed and variable time windows, respectively. The convergence efficiency of the improved ant colony algorithm in AGV task allocation is improved four-fold, with a better convergence effect. By pre-selecting the nearest picking station for the AGVs, the multi-AGV picking system can increase the queuing time. Therefore, optimizing the static picking station selection and dynamically selecting the picking station queue based on the queuing situation are proposed. The Flexsim simulation results show that the queue-waiting and picking completion times are reduced to 34% of the original, thus improving the flexibility of the queuing process and enhancing picking efficiency.

15 May 2024 in International Journal of Intelligent Systems
Verified
Journal Article
Open access
PDF file
JYJianglong Yang
Jianglong Yang
HLHuwei Liu
Huwei Liu
凯梁凯博 梁
凯博 梁
MSMan Shan
Man Shan
LKLingjie Kong
Lingjie Kong
LZLi Zhou
Li Zhou
This paper addresses the multiorder open-dimension three-dimensional rectangular packing problem (3D-MOSB-ODRPP), which involves packing rectangular items from multiple orders into a single, size-adjustable container. We propose a novel metaheuristic approach combining a genetic algorithm with the Gurobi solver. The algorithm incorporates a lower neighborhood search strategy and is underpinned by a mathematical model representing the multiorder open-dimension packing scenario. Extensive experiments validate the effectiveness of the proposed approach. The LNSGA algorithm outperforms Gurobi and the traditional genetic algorithm in solution quality and computational efficiency. For small-scale instances, LNSGA achieves optimal values in most cases. LNSGA demonstrates significant optimization improvements over Gurobi and the genetic algorithm for large-scale instances. The superior performance is attributed to the effective integration of the lower neighborhood search mechanism and the Gurobi solver. This study offers valuable insights for optimizing the packing process in e-commerce warehousing and logistics operations.

8 December 2023
Verified
Conference Paper
Open access
ZJZiqing Jiang
Ziqing Jiang
XWXinyan Wang
Xinyan Wang
FLFeng Li
Feng Li
LCLei Chen
Lei Chen
MSMan Shan
Man Shan
LHLu Hui
Lu Hui
Major emergencies in recent years have greatly challenged the rapid response capability of the emergency supplies logistics system. In order to minimize the damage brought by emergencies to the society, the emergency supplies should be timely to the place where the emergencies occur, so as to reduce the losses brought by the emergencies. In order to further study the vehicle scheduling of emergency supplies, this paper establishes a multi-distribution centre emergency logistics vehicle scheduling model in the context of emergency logistics, considering the number of distribution centres in different cases, with the goal of reaching the demand point in terms of the total time and the total cost, and giving the time goal a higher weight, and solving it by using the genetic algorithm. The simulation solution is carried out through the arithmetic example, and the following conclusions are drawn: (1) in the ideal situation, the more the number of distribution centres is, the total time for emergency supplies to reach the demand point is the smallest, but the total cost tends to be higher; (2) the model in this paper can find the optimal solution that meets the conditions for the different number of distribution centres, which improves the distribution tenacity of the distribution centres. Therefore, the research in this paper provides scientific and effective suggestions for emergency logistics decision makers.