即时
运筹学
利润(经济学)
计算机科学
资源配置
无人机
服务(商务)
运营管理
业务
经济
营销
工程类
计算机网络
物理
生物
遗传学
微观经济学
量子力学
作者
Darshan Rajesh Chauhan,Avinash Unnikrishnan,Stephen D. Boyles
标识
DOI:10.1177/03611981221082574
摘要
Increasing e-commerce activity, competition for shorter delivery times, and innovations in transportation technologies have pushed the industry toward instant delivery logistics. This paper studies a facility location and online demand allocation problem applicable to a logistics company expanding to offer instant delivery service using unmanned aerial vehicles or drones. The problem is decomposed into two stages. During the planning stage, the facilities are located, and product and battery capacity are allocated. During the operational stage, customers place orders dynamically and real-time demand allocation decisions are made. The paper explores a multi-armed bandit framework for maximizing the cumulative reward realized by the logistics company subject to various capacity constraints and compares it with other strategies. The multi-armed bandit framework provides about 7% more rewards than the second-best strategy when tested on standard test instances. A case study based in Portland Metro Area showed that multi-armed bandits can outperform the second-best strategy by more than 20%.
科研通智能强力驱动
Strongly Powered by AbleSci AI