Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-25T17:23:33.906Z Has data issue: false hasContentIssue false
  • English
  • Français

A Modified Lockset Approach for Enhancing Routing Effectiveness

Published online by Cambridge University Press:  28 April 2015

Lynn W. Robbins
Lynn W. Robbins*
Affiliation:
University of Kentucky
Get access Rights & Permissions [Opens in a new window]

Extract

In a recent attempt to emulate by simulation and then to improve upon a farm supply cooperative's distribution system, a lockset algorithm that included a backhaul routing capacity was constructed. The author describes the problem that motivated that modification, the modification itself, and a possible methodological improvement for applying routing models to firm-level distribution problems. The modified lockset's simulation capability is discussed with respect to capacity control and “load size/loading time” trade-off. Finally, the potential for determining visit frequency within a distribution routing analysis rather than accepting it as a given is discussed.

Type
Research Article
Information
Journal of Agricultural and Applied Economics , Volume 10 , Issue 2 , December 1978 , pp. 113 - 119
Copyright
Copyright © Southern Agricultural Economics Association 1978

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Chan, Yupo. “Configuring a Transportation Route Network Via the Method of Successive Approximation,” Computers and Operations Research, Volume 1, 1974, 385–420.CrossRefGoogle Scholar
[2]Clarke, G. and Wright, J. W.. “Scheduling of Vehicles from a Central Depot to a Number of Delivery Points,” Operations Research, Volume 12, July-August 1964, pp. 568–581.CrossRefGoogle Scholar
[3]Dantzig, G. B. and Ramser, J. H.. “The Truck Dispatching Problem,” Management Science. October 1959, Volume 6, pp. 80–91.CrossRefGoogle Scholar
[4]Gillett, Billy E. and Miller, Leland R.. “A Heuristic Algorithm for the Vehicle-Dispatch Problem,” Operations Research Volume 22, March-April 1974, pp. 340–349.CrossRefGoogle Scholar
[5]Hadley, G.Nonlinear and Dynamic Programming. Reading, Massachusetts: Addison-Wesley, 1964.Google Scholar
[6]Hallberg, M. C. and Kriebel, W. R.. Designing Efficient Pickup and Delivery Route Systems by Computer, Pennsylvania State Agricultural Experiment Station Bulletin 728, June 1972.Google Scholar
[7]Robbins, Lynn W. “Warehousing Agricultural Inputs in Michigan: An Economies of Size and Location Analysis,” unpublished Ph.D. dissertation, Michigan State University, 1975.Google Scholar
[8]Schruben, Leonard W. and Clifton, Ruth E.. “The Lockset Method of Sequential Programming Applied to Routing, Delivery and Pickup Trucks,” American Journal of Agricultural Economics, Volume 50, November 1968, pp. 854–867.CrossRefGoogle Scholar