An Algorithm for Combining Truck Trips
- 1 February 1974
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 8 (1) , 13-23
- https://doi.org/10.1287/trsc.8.1.13
Abstract
This paper presents a method for serial combination of truck trips to minimize the total cost of deadheading, subject to constraints on the allowed combinations. The problem is initially formulated as an integer transportation problem with extra compatibility constraints, and then reduced to a classical transportation problem. Modifications of the classical algorithm led to a fifty-fold reduction in computer time, and permit solution of a 1000 × 1000 problem in less than two minutes of computer time. Implementation of the method led to considerable cost savings over the older manual procedure.Keywords
This publication has 0 references indexed in Scilit: