Alibaba Vehicle Routing Algorithms Enable Rapid Pick and Delivery

References

• Alibaba Group (2020) Alibaba group anounces September quarter 2020 results. Retrieved https://www.alibabagroup.com/en/news/press_pdf/p201105.pdf.Google Scholar
• Bello I, Pham H, Le QV, Norouzi M, Bengio S (2016) Neural combinatorial optimization with reinforcement learning. Preprint, submitted November 29, https://arxiv.org/abs/1611.09940.Google Scholar
• Bertsimas D, Jaillet P, Sebastien M (2019) Online vehicle routing: The edge of optimization in large-scale applications. Oper. Res. 67(1):143–162.Link, Google Scholar
• Bertsimas D, Delarue A, Eger W, Hanlon J, Martin S (2020) Bus routing optimization helps Boston public schools design better policies. INFORMS J. Appl. Anal. 50(1):37–49.Link, Google Scholar
• Duan L, Zhan Y, Hu H, Gong Y, Wei J, Zhang X, Xu Y (2020) Efficiently solving the practical vehicle routing problem: A novel joint learning approach. Proc. 26th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (Association for Computing Machinery, New York), 3054–3063.Google Scholar
• Francois V, Arda Y, Crama Y (2019) Adaptive large neighborhood search for multi-trip vehicle routing with time windows. Transportation Sci. 53(6):1706–1720.Link, Google Scholar
• Holland C, Levis J, Nuggehalli R, Santilli B, Winters J (2017) UPS optimizes delivery routes. Interfaces 47(1):8–23.Link, Google Scholar
• Hollis BL, Green PJ (2012) Real-life vehicle routing with time windows for visual attractiveness and operational robustness. Asia-Pacific J. Oper. Res. 29(4):1250017.Google Scholar
• James JQ, Yu W, Gu J (2019) Online vehicle routing with neural combinatorial optimization and deep reinforcement learning. IEEE Trans. Intelligent Transportation Systems 20(10):3806–3817.Google Scholar
• Kant G, Jacks M, Aantjes C (2008) Coca-Cola enterprises optimizes vehicle routes for efficient product delivery. Interfaces 38(1):40–50.Link, Google Scholar
• Kool W, Van Hoof H, Welling M (2018) Attention, learn to solve routing problems! Preprint, submitted March 22, https://arxiv.org/abs/1803.08475.Google Scholar
• Laporte G, Musmanno R, Vocaturo F (2010) An adaptive large neighborhood search heuristic for the capacitated vehicle arc-routing problem with stochastic demands. Transportation Sci. 44(1):125–135.Link, Google Scholar
• Nazari M, Oroojlooy A, Takáč M, Snyder L (2018) Reinforcement learning for solving the vehicle routing problem. Bengio S, Wallach HM, Larochelle H, Grauman K, Cesa-Bianchi N, eds. Proc. 32nd Conf. Neural Inform. Processing Systems (Curran Associates, Red Hook, NY), 9861–9871.Google Scholar
• NEO Research Group (2013) Capacitated VRP instances. Accessed July 7, 2020, https://neo.lcc.uma.es/vrp/vrp-instances/capacitated-vrp-instances/.Google Scholar
• Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8):2403–2435.Google Scholar
• Pisinger D, Ropke S (2010) Large neighborhood search. Gendreau M, Potvin J-Y, eds. Handbook of Metaheuristics, International Series in Operations Research and Management Science, Vol. 146 (Springer, Boston), 399–419.Google Scholar
• Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Sci. 40(4):455–472.Link, Google Scholar
• Rossit DG, Vigo D, Tohme F, Frutos M (2019) Visual attractiveness in routing problems: A review. Comput. Oper. Res. 103(March):13–34.Google Scholar
• Sahoo S, Kim S, Kim BI, Kraas B, Popov A Jr (2005) Routing optimization for waste management. Interfaces 35(1):24–36.Link, Google Scholar
• Stol KJ, Fitzgerald B (2015) Inner source—Adopting open source development practices in organizations: A tutorial. IEEE Software 32(4):60–67.Google Scholar
• Ulmer MW, Thomas BW, Campbell AM, Woyak N (2021) The restaurant meal delivery problem: Dynamic pickup and delivery with deadlines and random ready time. Transportation Sci. 55(1):75–100.Link, Google Scholar
• Zhang D (2021) 2021 Edelman finalist: Alibaba. INFORMS, April 13, 2021. YouTube video, 39:12, https://www.youtube.com/watch?v=dOBvgzHoQb8.Google Scholar
• Zhang Y, Zhang D, Wang L, He Z, Hu H (2020) Balancing exploration and exploitation in the memetic algorithm via a switching mechanism for the large-scale VRPTW. Nah Y, Cui B, Lee SW, Yu JX, Moon YS, Whang SE, eds. Database Systems for Advanced Applications, Lecture Notes in Computer Science, Vol. 12112 (Springer, Cham, Switzerland), 324–331.Google Scholar