Dynamic Route Optimization and Automation of Industrial Routes at WM

References

• Assad A, Golden B (1995) Arc routing methods and applications. Ball MO, Magnanti TL, Monma CL, Nemhauser GL, eds. Handbooks in Operations Research and Management Science (Elsevier, Amsterdam), 375–483.Google Scholar
• Baldacci R, Bodin L, Mingozzi A (2006) The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem. Comput. Oper. Res. 33(9):2667–2702.Google Scholar
• Bodin L, Mingozzi A, Baldacci R, Ball M (2000) The rollon-rolloff vehicle routing problem. Transportation Sci. 34(3):271–288.Link, Google Scholar
• Bonomo F, Durán G, Larumbe F, Marenco J (2012) A method for optimizing waste collection using mathematical programming: A Buenos Aires case study. Waste Management Res. 30(3):311–324.Google Scholar
• Chiussi A, Felix G, Iori M, Santos AG (2022) Industrial waste collection optimization: A real-world case study in northern Italy. De Armas J, Ramalhinho H, Voß S, eds. Proc. Comput. Logist. 13th Internat. Conf. (Springer-Verlag, Berlin), 147–161.Google Scholar
• De Meulemeester L, Laporte G, Louveaux FV, Semet F (1997) Optimal sequencing of skip collections and deliveries. J. Oper. Res. Soc. 48(1):57–64.Google Scholar
• Kim B, Kim S, Sahoo S (2006) Waste collection vehicle routing problem with time windows. Comput. Oper. Res. 33(12):3624–3642.Google Scholar
• Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8):2403–2435.Google Scholar
• Rabbani M, Tabrizi H, Farrokhi-Asl H (2016) A hybrid metaheuristic algorithm for solving a roll-on roll-off waste collection vehicle routing problem considering waste separation and recycling center. Internat. J. Appl. Oper. Res. 6(2):19–31.Google Scholar
• Ramamoorthy M, Syrotiuk VR (2024) Learning heuristics for arc routing problems. Intelligent Systems Appl. 21(March):200300.Google Scholar
• Raucq J, Sörensen K, Cattrysse D (2019) Solving a real-life roll-on-roll-off waste collection problem with column generation. J. Vehicle Routing Algorithms 2(1):41–54.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
• Seeking Alpha (2024a) Waste Management, Inc. (WM) Q1 2024 earnings call transcript. Accessed August 9, 2025, https://seekingalpha.com/article/4686256-waste-management-inc-wm-q1-2024-earnings-call-transcript.Google Scholar
• Seeking Alpha (2024b) Waste Management, Inc. (WM) Q3 2024 earnings call transcript. Accessed August 9, 2025, https://seekingalpha.com/article/4730577-waste-management-inc-wm-q3-2024-earnings-call-transcript.Google Scholar
• Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. Accessed July 1, 2025, https://neo.lcc.uma.es/radi-aeb/WebVRP/data/articles/CP4VRPshaw98.pdf.Google Scholar
• Taylor S, Letham B (2018) Forecasting at scale. Amer. Statistician 72(1):37–45.Google Scholar
• Wy J, Kim B (2013) A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem. Comput. Oper. Res. 40(8):1947–1952.Google Scholar