返回
Decision models for personal shopper platform operations optimization
DOI:10.1016/j.trc.2022.103782.png)
摘要
En 中文
The 'lazy economy' gives rise to an emerging business mode, called personal shopper platforms (PSPs). A customer who needs some goods urgently can release an order on a PSP, which is then assigned by the platform to a personal shopper, who will buy the goods at a nearby retail store and deliver them to the customer within a short time interval. Since the development of PSP is relatively new, the decision mechanisms and policies are at an early stage. The operations of the PSPs can be optimized through operations research methodologies. This study proposes a series of mixed integer programming (MIP) models and improved dynamic programming-based algorithms to support operational decisions on order assignment and shopper routing, as well as strategic decisions on the PSP mode adoption and territory planning. Some intuitive but practical criteria are also designed to accelerate the proposed algorithms so that they can be applied to large-scale realistic instances. The proposed algorithm can solve the basic case with 1000 orders and 1050 shoppers (about 10(7) variables and 10(7) constraints in the MIP models) in half a minute. A realistic case in the Changning district of Shanghai is also used to validate the effectiveness of the pro-posed models and the efficiency of the algorithms. An extended model for considering the un-certain arrival of future orders is also presented. This study provides a comprehensive model-driven decision methodology for this emerging service industry mode.
Keyword:
Personal shoppers
Order assignment
Improved dynamic programming
Last-mile delivery
期刊
IF:
7.9
论文数:
4.9K
被引数:
3.2W
机构
引用论文
Statistical analysis in Small-N Designs: using linear mixed-effects modeling for evaluating intervention effectiveness
Aphasiology
IF0
Offline-Online Approximate Dynamic Programming for Dynamic Vehicle Routing with Stochastic Requests具有随机请求的动态车辆路径的离线在线近似动态规划

