Yanfang Zhang

Yanfang Zhang

Auto-generated profile, based on publicly available information

Yanfang Zhang

School of Information Management, Central China Normal University, Wuhan, China

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
19 June 2018 in AIChE Journal
Verified
Journal Article
Closed access
PDF file
XDXuezhi Duan
Xuezhi Duan
YZYanfang Zhang
Yanfang Zhang
MPMinjian Pan
Minjian Pan
HDHua Dong
Hua Dong
BCBingxu Chen
Bingxu Chen
DCDe Chen
De Chen

24 December 2020 in International Transactions in Operational Research
Verified
Journal Article
Closed access
PDF file
JZJun Zhang
Jun Zhang
YZYanfang Zhang
Yanfang Zhang
XZXueyan Zhang
Xueyan Zhang

19 January 2021 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
JZJun Zhang
Jun Zhang
XZXueyan Zhang
Xueyan Zhang
YZYanfang Zhang
Yanfang Zhang
The online order fulfillment of online-to-offline (O2O) supermarket faces the challenge in how to pick orders from thousands of products on the supermarket shelves and deliver them to customers in different zones and locations by a vehicle routing method within the lowest cost and shortest time. It is critical to integrate the order picking and delivery processes and schedule them jointly with a coordinated manner. Thus, in this paper, we study the online integrated order picking and delivery problem with multizone routing method (IOPDP-MR) to minimize both the maximum delivery completion time and the total delivery cost. The online algorithm A is presented to solve the online problem and is proved to be - competitive, where is the vehicle capacity. Since it is difficult to get a lower competitive ratio theoretically, the numerical experiments are proposed to analyze the gaps by comparing the values of algorithm A with the ones of offline optimal algorithm A∗ under different situations. It can be inferred that the competitive ratio is less than 2.5 and the average flow time for customer orders is less than 30 minutes, which verifies the good performance in both computation efficiency and customer satisfaction of algorithm A.