Abstract

This paper studies joint algorithms of order picking and distribution in new retail enterprises. The problem will consider many factors, such as the type of goods, picking time, batch capacity of distribution, distribution time, and distribution cost. First of all, the research problems are summarized as mathematical programming problems. Then, a genetic algorithm and comparison algorithms are proposed. Finally, the rationality of the model and the effectiveness of the algorithms are verified by computational experiments, and management enlightenments are revealed.

Highlights

  • In the first quarter of 2020, communities in China were closed for management, and since the public has been buying fresh food and daily necessities online because of the outbreak of COVID-19. e number of customers in traditional stores has reduced, and orders from new fresh e-commerce have increased rapidly. e new mode of doorto-door delivery has become popular

  • HEMA is a new retail format completely reconstructed by Alibaba for offline supermarkets that is different from other fresh e-commerce

  • Each customer can see all goods in HEMA. e display and placement of commercial products are different according to the preferences of consumers in the area where the store is located

Read more

Summary

Introduction

In the first quarter of 2020, communities in China were closed for management, and since the public has been buying fresh food and daily necessities online because of the outbreak of COVID-19. e number of customers in traditional stores has reduced, and orders from new fresh e-commerce have increased rapidly. e new mode of doorto-door delivery has become popular. By observing online orders’ picking process of HEMA, we found that once a customer places an order in HEMA APP, the information processing center will divide the order into several suborders according to commodity types, such as river fresh, fruit, pasta, and daily necessities. Peng [10] studied a joint scheduling problem of order batching and distribution routing and took the shortest total fulfillment time from order picking to distribution completion as the goal of B2C e-commerce distribution center. Erefore, we study the picking and distribution problem of orders generated in HEMA APP from a different view. We analyze the combined problem of order picking and distribution and establish the model with the goal of minimizing the sum of orders’ total completion time and total delivery cost. E remaining sections of this paper are organized as follows: In Section 2, we give the problem description; in Section 3, we construct a MP model for the case with one machine at each stage and one deliveryman; in Section 4, we devise algorithms to solve the problem; in Section 5, numerical experiments are carried out to verify the rationality of the model and the effectiveness of the algorithms; in Section 6, we conclude this paper

Problem Descriptions
MP Model for a Special Case
A Genetic Algorithm
Numerical Experiments and Analysis
Parameter Setting
Analysis of Experimental Results
Findings
Summery and Prospects
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call