摘要
Online e-commerce giants are continuously investigating innovative ways to improve their practices in last-mile deliveries. Inspired by the current practices at JD.com (the largest online retailer by revenue in China), we investigate a delivery problem that we call the traveling salesman problem with bike and robot (TSPBR), where a cargo bike is aided by a self-driving robot to deliver parcels to customers in urban areas. We present two mixedinteger linear programming models and describe a set of valid inequalities to strengthen their linear relaxation. We show that these models can yield optimal solutions of TSPBR instances with up to 60 nodes. To efficiently find heuristic solutions, we also present a genetic algorithm based on a dynamic programming recursion that efficiently explores large neighborhoods. We computationally assess this genetic algorithm on instances provided by JD.com and show that high-quality solutions can be found in a few minutes of computing time. Finally, we provide some managerial insights to assess the impact of deploying the bike-and-robot tandem to deliver parcels in the TSPBR setting.
学科与关键词
- A traveling salesman problem with time windows for the last mile delivery in online shoppingLi Jiang; Mohamed Dhiaf; Junfeng Dong; Changyong Liang; Shuping ZhaoInternational Journal of Production Research, 2020, 58(16): 5077-5088.
- Coordinated home and locker deliveries: An exact approach for the urban delivery problem with conflicting time windowsZang, Xiaoning; Jiang, Li*; Liang, Changyong; Fang, XiangTRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2023, 177: 103228.
- A covering traveling salesman problem with profit in the last mile deliveryJiang, Li; Zang, Xiaoning*; Dong, Junfeng; Liang, ChangyongOptimization Letters, 2022, 16(1): 375-393.被引 6
