Vehicle Routing and Scheduling with Full Truckloads

Sundararajan Arunapuram (), Kamlesh Mathur () and Daniel Solow ()
Additional contact information
Sundararajan Arunapuram: Manugistics Inc., Wayne, Pennsylvania 19087
Kamlesh Mathur: Department of Operations, Weatherhead School of Management, Case Western Reserve University, Cleveland, Ohio 44106
Daniel Solow: Department of Operations, Weatherhead School of Management, Case Western Reserve University, Cleveland, Ohio 44106

Transportation Science, 2003, vol. 37, issue 2, 170-182

Abstract: Truckload carriers are constantly faced with the problem of shipping full truckloads of goods at minimum cost between pairs of cities or customers, using a fleet of trucks located at one or more depots. In this paper, a new branch-and-bound algorithm for solving an integer-programming formulation of this vehicle-routing problem (VRP) with full truckloads is developed. The algorithm also takes into consideration the time-window constraints and waiting costs. The resulting efficiency, validated by computational tests on random problems, is due to a column-generation scheme that exploits the special structure of the problem to solve the linear-programming relaxation problems that arise at the nodes.

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

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.37.2.170.15248 (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:37:y:2003:i:2:p:170-182

Access Statistics for this article

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