C.H. Robinson Uses Heuristics to Solve Rich Vehicle Routing Problems

References

• Alvarenga GB, Mateus GR, De Tomi G (2007) A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows. Comput. Oper. Res. 34(6):1561–1584.Google Scholar
• Amorim P, Parragh SN, Sperandio F, Almada-Lobo B (2014) A rich vehicle routing problem dealing with perishable food: A case study. TOP 22(2):489–508.Google Scholar
• Baldacci R, Mingozzi A (2009) A unified exact method for solving different classes of vehicle routing problems. Math. Programming 120(2):347–380.Google Scholar
• Baldacci R, Christofides N, Mingozzi A (2008) An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Programming 115(2):351–385.Google Scholar
• Baldacci R, Mingozzi A, Roberti R (2011) New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59(5):1269–1283.Link, Google Scholar
• Balinski ML, Quandt RE (1964) On an integer program for a delivery problem. Oper. Res. 12(2):300–304.Link, Google Scholar
• Caceres-Cruz J, Arias P, Guimarans D, Riera D, Juan AA (2015) Rich vehicle routing problem: Survey. ACM Comput. Surveys 47(2):Article 32.Google Scholar
• Carnes TA, Henderson SG, Shmoys DB, Ahghari M, MacDonald RD (2013) Mathematical programming guides air-ambulance routing at ornge. Interfaces 43(3):232–239.Link, Google Scholar
• C.H. Robinson (2020) Q4 2020 earnings presentation. Accessed January 31, 2021, https://s21.q4cdn.com/950981335/files/doc_financials/2020/q4/Q4-2020-Earnings-Deck.pdf.Google Scholar
• C.H. Robinson (2021) About us. Accessed February 18, 2021, https://www.chrobinson.com/en-us/about-us/.Google Scholar
• de Armas J, Melián-Batista B (2015) Variable neighborhood search for a dynamic rich vehicle routing problem with time windows. Comput. Indust. Engrg. 85(July):120–131.Google Scholar
• de Armas J, Melián-Batista B, Moreno-Pérez JA, Brito J (2015) GVNS for a real-world rich vehicle routing problem with time windows. Engrg. Appl. Artificial Intelligence 42(June):45–56.Google Scholar
• Federal Motor Carrier Safety Administration (2019) Hours of service of drivers. Accessed May 28, 2019, https://www.fmcsa.dot.gov/regulations/hours-service/summary-hours-service-regulations.Google Scholar
• Gifford T, Opicka T, Sinha A, Vanden Brink D, Gifford A, Randall R (2018) Dispatch optimization in bulk tanker transport operations. Interfaces 48(5):403–421.Link, Google Scholar
• Ileri Y, Bazaraa M, Gifford T, Nemhauser G, Sokol J, Wikum E (2006) An optimization approach for planning daily drayage operations. Central Eur. J. Oper. Res. 14(2):141–156.Google Scholar
• Johnson DS (1973) Near-optimal bin packing algorithms. Unpublished PhD thesis, Massachusetts Institute of Technology, Cambridge, MA.Google Scholar
• Lahyani R, Khemakhem M, Semet F (2015a) Rich vehicle routing problems: From a taxonomy to a definition. Eur. J. Oper. Res. 241(1):1–14.Google Scholar
• Lahyani R, Coelho LC, Khemakhem M, Laporte G, Semet F (2015b) A multi-compartment vehicle routing problem arising in the collection of olive oil in tunisia. Omega 51(March):1–10.Google Scholar
• Mendoza JE, Villegas JG (2013) A multi-space sampling heuristic for the vehicle routing problem with stochastic demands. Optim. Lett. 7(7):1503–1516.Google Scholar
• Novoa C, Berger R, Linderoth J, Storer R (2006) A set-partitioning-based model for the stochastic vehicle routing problem. Technical Report 06T-008, Lehigh University, Bethlehem, PA.Google Scholar
• Osaba E, Yang XS, Diaz F, Onieva E, Masegosa AD, Perallos A (2017) A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy. Soft Comput. 21(18):5295–5308.Google Scholar
• Pellegrini P, Favaretto D, Moretti E (2007) Multiple ant colony optimization for a rich vehicle routing problem: A case study. Apolloni B, Howlett RJ, Jain L, eds. 11th Internat. Conf. Knowledge-Based Intelligent Inform. Engrg. Systems Proc., Part 2 (Springer, Berlin), 627–634.Google Scholar
• Ropke S, Cordeau J-F (2009) Branch and cut and price for the pickup and delivery problem with time windows. Transportation Sci. 43(3):267–286.Link, Google Scholar
• Sicilia JA, Quemada C, Royo B, Escuín D (2016) An optimization algorithm for solving the rich vehicle routing problem based on variable neighborhood search and tabu search metaheuristics. J. Comput. Appl. Math. 291(January):468–477.Google Scholar
• Subramanian A, Uchoa E, Ochi LS (2013) A hybrid algorithm for a class of vehicle routing problems. Comput. Oper. Res. 40(10):2519–2531.Google Scholar
• Toth P, Vigo D (2002) The Vehicle Routing Problem (Society for Industrial and Applied Mathematics, Philadelphia).Google Scholar
• Vidal T, Crainic TG, Gendreau M, Prins C (2013) Heuristics for multi-attribute vehicle routing problems: A survey and synthesis. Eur. J. Oper. Res. 231(1):1–21.Google Scholar
• Vidal T, Crainic TG, Gendreau M, Prins C (2014) A unified solution framework for multi-attribute vehicle routing problems. Eur. J. Oper. Res. 234(3):658–673.Google Scholar