{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T09:16:26Z","timestamp":1721898986557},"reference-count":24,"publisher":"Institute for Operations Research and the Management Sciences (INFORMS)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["INFORMS Journal on Applied Analytics"],"published-print":{"date-parts":[[2022,3]]},"abstract":" We consider a broad family of vehicle routing problem variants with many complex and practical constraints, known as rich vehicle routing problems, which are faced on a daily basis by C.H. Robinson (CHR). Because CHR has many customers, each with distinct requirements, various routing problems with different objectives and constraints must be solved. We propose a novel framework for solving rich vehicle routing problems, which we demonstrate is effective in solving a variety of different problems. This framework, along with a simple user interface, has been wrapped into a new module and integrated into the company\u2019s transportation planning and execution technology platform. Since its implementation, this new module has outperformed the previously used third-party technologies at CHR, significantly reduced setup times, and improved users\u2019 productivity as well as customer outcomes. <\/jats:p>","DOI":"10.1287\/inte.2021.1090","type":"journal-article","created":{"date-parts":[[2021,9,20]],"date-time":"2021-09-20T19:46:52Z","timestamp":1632167212000},"page":"173-188","source":"Crossref","is-referenced-by-count":2,"title":["C.H. Robinson Uses Heuristics to Solve Rich Vehicle Routing Problems"],"prefix":"10.1287","volume":"52","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-2278-4179","authenticated-orcid":false,"given":"Ehsan","family":"Khodabandeh","sequence":"first","affiliation":[{"name":"Coupa Software, Chicago, Illinois 60654;"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-2227-7030","authenticated-orcid":false,"given":"Lawrence V.","family":"Snyder","sequence":"additional","affiliation":[{"name":"Industrial and Systems Engineering, Lehigh University, Bethlehem, Pennsylvania 18015;"}]},{"given":"John","family":"Dennis","sequence":"additional","affiliation":[{"name":"C.H. Robinson, Eden Prairie, Minnesota 55347"}]},{"given":"Joshua","family":"Hammond","sequence":"additional","affiliation":[{"name":"C.H. Robinson, Eden Prairie, Minnesota 55347"}]},{"given":"Cody","family":"Wanless","sequence":"additional","affiliation":[{"name":"C.H. Robinson, Eden Prairie, Minnesota 55347"}]}],"member":"109","reference":[{"issue":"6","key":"B1","doi-asserted-by":"crossref","first-page":"1561","DOI":"10.1016\/j.cor.2005.07.025","volume":"34","author":"Alvarenga GB","year":"2007","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"B2","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/s11750-012-0266-4","volume":"22","author":"Amorim P","year":"2014","journal-title":"TOP"},{"issue":"2","key":"B3","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10107-008-0218-9","volume":"120","author":"Baldacci R","year":"2009","journal-title":"Math. Programming"},{"issue":"2","key":"B4","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10107-007-0178-5","volume":"115","author":"Baldacci R","year":"2008","journal-title":"Math. Programming"},{"key":"B5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1110.0975"},{"key":"B6","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.2.300"},{"issue":"2","key":"B7","doi-asserted-by":"crossref","DOI":"10.1145\/2666003","volume":"47","author":"Caceres-Cruz J","year":"2015","journal-title":"ACM Comput. Surveys"},{"key":"B8","doi-asserted-by":"publisher","DOI":"10.1287\/inte.2013.0683"},{"key":"B11","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.cie.2015.03.006","volume":"85","author":"de Armas J","year":"2015","journal-title":"Comput. Indust. Engrg."},{"key":"B12","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.engappai.2015.03.009","volume":"42","author":"de Armas J","year":"2015","journal-title":"Engrg. Appl. Artificial Intelligence"},{"key":"B14","doi-asserted-by":"publisher","DOI":"10.1287\/inte.2018.0956"},{"issue":"2","key":"B15","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10100-006-0165-6","volume":"14","author":"Ileri Y","year":"2006","journal-title":"Central Eur. J. Oper. Res."},{"key":"B16","unstructured":"Johnson DS (1973) Near-optimal bin packing algorithms. Unpublished PhD thesis, Massachusetts Institute of Technology, Cambridge, MA."},{"issue":"1","key":"B17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2014.07.048","volume":"241","author":"Lahyani R","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"B18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.omega.2014.08.007","volume":"51","author":"Lahyani R","year":"2015","journal-title":"Omega"},{"issue":"7","key":"B19","doi-asserted-by":"crossref","first-page":"1503","DOI":"10.1007\/s11590-012-0555-8","volume":"7","author":"Mendoza JE","year":"2013","journal-title":"Optim. Lett."},{"key":"B20","unstructured":"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."},{"issue":"18","key":"B21","doi-asserted-by":"crossref","first-page":"5295","DOI":"10.1007\/s00500-016-2114-1","volume":"21","author":"Osaba E","year":"2017","journal-title":"Soft Comput."},{"key":"B23","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1090.0272"},{"key":"B24","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1016\/j.cam.2015.03.050","volume":"291","author":"Sicilia JA","year":"2016","journal-title":"J. Comput. Appl. Math."},{"issue":"10","key":"B25","doi-asserted-by":"crossref","first-page":"2519","DOI":"10.1016\/j.cor.2013.01.013","volume":"40","author":"Subramanian A","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"B26","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718515","volume-title":"The Vehicle Routing Problem","author":"Toth P","year":"2002"},{"issue":"1","key":"B27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2013.02.053","volume":"231","author":"Vidal T","year":"2013","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"B28","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1016\/j.ejor.2013.09.045","volume":"234","author":"Vidal T","year":"2014","journal-title":"Eur. J. Oper. Res."}],"container-title":["INFORMS Journal on Applied Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/pubsonline.informs.org\/doi\/pdf\/10.1287\/inte.2021.1090","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T16:47:36Z","timestamp":1680454056000},"score":1,"resource":{"primary":{"URL":"https:\/\/pubsonline.informs.org\/doi\/10.1287\/inte.2021.1090"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["10.1287\/inte.2021.1090"],"URL":"https:\/\/doi.org\/10.1287\/inte.2021.1090","relation":{},"ISSN":["2644-0865","2644-0873"],"issn-type":[{"value":"2644-0865","type":"print"},{"value":"2644-0873","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3]]}}}