COMBINED VEHICLE ROUTING AND INVENTORY ALLOCATION PROBLEM.
Publication
, Journal Article
Federgruen, A; Zipkin, P
Published in: Operations Research
1984
The authors address the combined problem of allocating a scarce resource among several locations, and planning deliveries using a fleet of vehicles. Demands are random, and holding and shortage costs must be considered in the decision along with transportation costs. Also shown is how to extend some of the available methods for the deterministic vehicle routing problem to this case. Computational results using one such adaptation show that the algorithm is fast enough for practical work, and that substantial cost savings can be achieved with this approach.
Duke Scholars
Published In
Operations Research
Publication Date
1984
Volume
32
Issue
5
Start / End Page
1019 / 1037
Related Subject Headings
- Operations Research
- 1503 Business and Management
- 0802 Computation Theory and Mathematics
- 0102 Applied Mathematics
Citation
APA
Chicago
ICMJE
MLA
NLM
Federgruen, A., & Zipkin, P. (1984). COMBINED VEHICLE ROUTING AND INVENTORY ALLOCATION PROBLEM. Operations Research, 32(5), 1019–1037.
Federgruen, A., and P. Zipkin. “COMBINED VEHICLE ROUTING AND INVENTORY ALLOCATION PROBLEM.” Operations Research 32, no. 5 (1984): 1019–37.
Federgruen A, Zipkin P. COMBINED VEHICLE ROUTING AND INVENTORY ALLOCATION PROBLEM. Operations Research. 1984;32(5):1019–37.
Federgruen, A., and P. Zipkin. “COMBINED VEHICLE ROUTING AND INVENTORY ALLOCATION PROBLEM.” Operations Research, vol. 32, no. 5, 1984, pp. 1019–37.
Federgruen A, Zipkin P. COMBINED VEHICLE ROUTING AND INVENTORY ALLOCATION PROBLEM. Operations Research. 1984;32(5):1019–1037.
Published In
Operations Research
Publication Date
1984
Volume
32
Issue
5
Start / End Page
1019 / 1037
Related Subject Headings
- Operations Research
- 1503 Business and Management
- 0802 Computation Theory and Mathematics
- 0102 Applied Mathematics