Transportation with Common Carrier and Private Fleets: System Assignment and Shipment Frequency Optimization
Progress in materials handling and logisticsPublished 1 January 1991
Randolph W. Hall, Michael Racer
Citations33
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
In this chapter, a shipment can either be served by a private carrier or a common carrier. The cost of using the private carrier declines as the space between stops decreases. Therefore, if more stops are assigned to private carriage, the cost of adding another stop will decline. The methodology presented in this chapter for assigning stops to private and common carriage accounts for this cost interaction through use of a square-root route length approximation. Techniques are presented for systems with (1) fixed shipping cycle for all stops with a variable fleet size, (2) fixed shipping cycle for all stops with a fixed fleet size, and (3) variable shipping cycles with a variable fleet size. In the last case, the optimal time between shipments accounts for both transportation and inventory costs.
Keywords
Engineering
Operations ResearchDistribution Strategies that Minimize Transportation and Inventory Costs
436 Citations1985Lawrence D. Burns, Randolph W. Hall +2 more
An analytic method for minimizing the cost of distributing freight by truck from a supplier to many customers is developed, derives formulas for transportation and inventory costs, and determines the optimal trade-off between these costs.
Management Science98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems
434 Citations1985R. Roundy
Transportation ScienceSavings by Split Delivery Routing
416 Citations1989Moshe Dror, Pierre Trudeau
This paper examines a relaxed version of the generic vehicle routing problem, in which a delivery to a demand point can be split between any number of vehicles, and demonstrates the potential for cost savings through split deliveries.
Transportation ScienceThe Distance Traveled to Visit <i>N</i> Points with a Maximum of <i>C</i> Stops per Vehicle: An Analytic Model and an Application
298 Citations1984Carlos F. Daganzo
A simple formula to predict the distance traveled by fleets of vehicles in physical distribution problems involving a depot and its area of influence is developed.
Transportation Research Part B MethodologicalAnalyzing trade-offs between transportation, inventory and production costs on freight networks
275 Citations1985Dennis E. Blumenfeld, Lawrence D. Burns +2 more
Transportation Research Part B MethodologicalThe length of tours in zones of different shapes
263 Citations1984Carlos F. Daganzo
A simple strategy that yields good traveling salesman tours is presented, and the resulting tours are suboptimal but appear to be close to those that can be obtained by hand.
Transportation Research Part B MethodologicalDetermining vehicle dispatch frequency when shipping frequency differs among suppliers
63 Citations1985Randolph W. Hall
A method that determines the optimal dispatch frequency when large suppliers are visited more frequently than are small suppliers is developed, which allows the combined inventory and transportation costs of collecting to be reduced.
Transportation ScienceFleet Size Planning when Outside Carrier Services Are Available
50 Citations1990John G. Klincewicz, Hanan Luss +1 more
The centerpiece of the solution approach consists of a single-source capacitated facility location formulation, in which each “customer’ (sector) is served by a single “facility” (private vehicle or outside carrier).
Transportation Research Part B MethodologicalSupplying a single location from heterogeneous sources
33 Citations1985Carlos F. Daganzo
NetworksUse of continuous approximations within discrete algorithms for routing vehicles: Experimental results and interpretation
17 Citations1994Randolph W. Hall, Yafeng Du +1 more
Results show that continuous space models can provide substantial improvements in the initial customer partition compared to single-annulus methods, and that Daganzo's model provides accurate predictions of average distance between stops, especially on large problems with identical shipment sizes.
Logistics and transportation reviewMSVS: AN EXTENDED COMPUTER MODEL FOR TRANSPORT MODE SELECTION
6 Citations1980Ronald H. Ballou, Mashrur Chowdhury
A heuristic computer model used to assist business firms and organizations in improving the utilization of their privately-owned truck fleets is described, which has extended scope to deal with deliveries and pickups on the same route, selection between two modes, and layovers en route.