{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T04:12:42Z","timestamp":1773979962800,"version":"3.50.1"},"reference-count":16,"publisher":"Institute for Operations Research and the Management Sciences (INFORMS)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Transportation Science"],"published-print":{"date-parts":[[2000,8]]},"abstract":"<jats:p> In this paper, a sanitation routing problem called the Rollon\u2013Rolloff Vehicle Routing Problem (RRVRP) is defined. In the RRVRP, tractors move large trailers between locations and a disposal facility. The trailers are so large that the tractor can only transport one trailer at a time. In this paper, the RRVRP is defined, a mathematical programming formulation is presented, and two lower bounds and four heuristic algorithms are developed and tested on 20 different problems. Conclusions are derived and recommendations for further research are presented. <\/jats:p>","DOI":"10.1287\/trsc.34.3.271.12301","type":"journal-article","created":{"date-parts":[[2003,4,10]],"date-time":"2003-04-10T09:32:49Z","timestamp":1049967169000},"page":"271-288","source":"Crossref","is-referenced-by-count":63,"title":["The Rollon\u2013Rolloff Vehicle Routing Problem"],"prefix":"10.1287","volume":"34","author":[{"given":"Lawrence","family":"Bodin","sequence":"first","affiliation":[{"name":"Robert H. Smith School of Business, University of Maryland, College Park, Maryland 20742"}]},{"given":"Aristide","family":"Mingozzi","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Bologna, Piazza di Porta S. Donato 5, 40127 Bologna, Bologna, Italy"}]},{"given":"Roberto","family":"Baldacci","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Bologna, Piazza di Porta S. Donato 5, 40127 Bologna, Bologna, Italy"}]},{"given":"Michael","family":"Ball","sequence":"additional","affiliation":[{"name":"Robert H. Smith School of Business, University of Maryland, College Park, Maryland 20742"}]}],"member":"109","reference":[{"key":"B1","first-page":"375","volume-title":"Network Routing, Handbook in Operations Research and Management Science","volume":"8","author":"Assad A.","year":"1995"},{"key":"B2","volume-title":"Network Routing, Handbook in Operations Research and Management Science","volume":"8","author":"Ball M.","year":"1995"},{"key":"B3","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90215-U"},{"key":"B4","doi-asserted-by":"publisher","DOI":"10.1287\/opre.38.4.571"},{"key":"B5","first-page":"69","volume":"10","author":"Bodin L.","year":"1983","journal-title":"Comput. Opns. Res."},{"key":"B6","first-page":"315","volume-title":"Combinatorial Optimization","author":"Christofides N.","year":"1979"},{"key":"B7","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.4.568"},{"key":"B10","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600325"},{"key":"B11","first-page":"35","volume-title":"Network Routing, Handbook in Operations Research and Management Science","volume":"8","author":"Desrosiers J.","year":"1995"},{"key":"B12","doi-asserted-by":"publisher","DOI":"10.1287\/opre.43.2.231"},{"key":"B13","doi-asserted-by":"publisher","DOI":"10.1287\/opre.43.3.399"},{"key":"B14","doi-asserted-by":"publisher","DOI":"10.1287\/opre.42.5.846"},{"key":"B15","first-page":"1","volume-title":"Network Routing, Handbook in Operations Research and Management Science","volume":"8","author":"Fisher M.","year":"1995"},{"key":"B16","volume-title":"Vehicle Routing, Methods and Studies","author":"Golden B.","year":"1988"},{"key":"B17","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230160104"},{"key":"B18","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello S.","year":"1990"}],"container-title":["Transportation Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/pubsonline.informs.org\/doi\/pdf\/10.1287\/trsc.34.3.271.12301","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T17:41:08Z","timestamp":1680457268000},"score":1,"resource":{"primary":{"URL":"https:\/\/pubsonline.informs.org\/doi\/10.1287\/trsc.34.3.271.12301"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,8]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,8]]}},"alternative-id":["10.1287\/trsc.34.3.271.12301"],"URL":"https:\/\/doi.org\/10.1287\/trsc.34.3.271.12301","relation":{},"ISSN":["0041-1655","1526-5447"],"issn-type":[{"value":"0041-1655","type":"print"},{"value":"1526-5447","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,8]]}}}