The Rollon–Rolloff Vehicle Routing Problem

Lawrence Bodin, Aristide Mingozzi, Roberto Baldacci and Michael Ball
Additional contact information
Lawrence Bodin: Robert H. Smith School of Business, University of Maryland, College Park, Maryland 20742
Aristide Mingozzi: Department of Mathematics, University of Bologna, Piazza di Porta S. Donato 5, 40127 Bologna, Bologna, Italy
Roberto Baldacci: Department of Mathematics, University of Bologna, Piazza di Porta S. Donato 5, 40127 Bologna, Bologna, Italy
Michael Ball: Robert H. Smith School of Business, University of Maryland, College Park, Maryland 20742

Transportation Science, 2000, vol. 34, issue 3, 271-288

Abstract: In this paper, a sanitation routing problem called the Rollon–Rolloff 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.

Date: 2000
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.34.3.271.12301 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:34:y:2000:i:3:p:271-288

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().