Solving an integrated logistics problem arising in grocery distribution

INFOR

Volumn 34, Issue 4, 1996, Pages 290-305

  Carter, Michael W ^a,f   Farvolden, Judith M ^a,b,c,g,h   Laporte, Gilbert ^c,d,i,j,k,l   Xu, Jiefeng ^a,e  

^a UNIVERSITY OF TORONTO   (Canada)

^b Algorithmics Inc   (Canada)

^c UNIVERSITÉ DE MONTRÉAL   (Canada)

^d HEC MONTRÉAL   (Canada)

^e UNIVERSITY OF COLORADO   (United States)

^f UNIVERSITY OF WATERLOO   (Canada)

^g PRINCETON UNIVERSITY   (United States)

^h Algorithmics Inc

ⁱ LONDON SCHOOL OF ECONOMICS   (United Kingdom)

^j Ecl des Hautes Etud Commerciales

^k UNIVERSITY OF ALBERTA   (Canada)

^l INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

more..

Author keywords

Demand allocation; Grocery distribution; Heuristics; Vehicle routing

Indexed keywords

EID: 0000914682     PISSN: 03155986     EISSN: None     Source Type: Journal    
DOI: 10.1080/03155986.1996.11732310     Document Type: Article

References (32)

1. Ball, M.O., "Allocation/Routing: Models and Algorithms". In B.L. Golden and A.A. Assad (eds.), Vehicle Routing: Methods and Studies, North-Holland, Amsterdam, 1988.
2. Ben-Kheder, N. and Yano, C., "The Multi-Supplier Delivery Scheduling Problem". Working Paper, Department of Industrial and Operations Research, University of Michigan, 1992.
3. Chao, L-M., Golden, B.L., and Wasil, E.A., "A New Heuristic for the Period Traveling Salesman Problem", Computers & Operations Research 22, 553-565, 1995.
4. Chen, W.H., and Thizy, J.-M., "Analysis of Relaxations for the Multi-Item Capacitated Lot-Sizing Problem", Annals of Operations Research 26, 29-72, 1990.
5. Christofides, N., and Beasley, J.E., "The Period Routing Problem", Networks 14, 237-256, 1984.
6. Cordeau, J.-F., Gendreau, M., and Laporte, G., "A Tabu Search Heuristic for Periodic and MultiDepot Vehicle Routing Problems", Publication CRT-95-76, Centre de recherche sur les transports, Université de Montréal, 1995.
7. Dantzig, G.B., Fulkerson, D.R., and Johnson, S.M., "Solution of a Large-Scale Traveling Salesman Problem", Operations Research 2, 393-410, 1954.
8. Dantzig, G.B., and Van Slyke, K.M., "Generalized Upper Bounding Techniques", Journal of Computer and Systems Science 1, 213-226, 1967.
9. Desrochers, M., Desrosiers, J., and Solomon, M.M., "A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows", Operations Research 40, 342-354, 1992.
10. Desrochers, M., and Laporte, G., "Improvements and Extensions to the Miller-Tucker-Zemlin Subtour Elimination Constraints", Operations Research Letters 10, 27-36, 1991.
11. Desrochers, M., Lenstra, J.K., Savelsbergh, M.W.P., and Soumis, F., "Vehicle Routing with Time Windows: Optimization and Approximation", in: B.L. Golden and A.A. Assad (eds.), Vehicle Routing: Methods and Studies, North-Holland, Amsterdam, 1988.
12. Desrosiers, J., Dumas, Y., Solomon, M.M., and Soumis, F., "Time Constrained Routing and Scheduling". Handbooks in Operations Research and Management Science, Volume 8, North-Holland, Amsterdam, 35-139, 1995.
13. Dror, M., and Ball, M.O., "Inventory/Routing: Reduction from an Annual to a Short-Term Problem", Naval Research Logistics Quarterly 34, 891-895, 1987.
14. Dzielinski, B.P., and Gomory, R.E., "Optimal Lot Sizes, Inventory and Labor Allocations", Management Science 11, 874-890, 1965.
15. Gaudioso, M. and Paletta, G., "A Heuristic for the Periodic Vehicle Routing Problem", Transportation Science 26, 86-92, 1992.
16. Golden, B.L., Assad, A.A., and Dahl, R., "Analysis of a Large-Scale Vehicle Routing Problem with an Inventory Component", Large Scale Systems Theory and Applications 7, 181-191, 1984.
17. Golden, B.L., Magnanti, T.L., and Nguyen, H.Q., "Implementing Vehicle Routing Algorithms", Networks 7, 113-148, 1977.
18. Golden, B.L., and Wasil, E.A., "Computerized Vehicle Routing in the Soft Drink Industry", Operations Research 35, 6-17, 1987.
19. Hax, A.C., and Candea, D., Production and Inventory Management, Prentice-Hall, Englewood Cliffs, NJ, 1984.
20. Kolen, A.W.J., Rinnooy Kan, A.H.G., and Trienekens, H.W.J.M., "Vehicle Routing with Time Windows", Operations Research 35, 266-273, 1987.
21. Koskosidis, Y.A., Powell, W.B. and Solomon, M.M., "An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints", Transportation Science 26, 69-85, 1992.
22. Laporte, G., Nobert, Y., and Desrochers, M., "Optimal Routing under Capacity and Distance Restrictions", Operations Research 33, 1050-1073, 1985.
23. Lasdon, L.S., and Terjung, R.C., "An Efficient Algorithm for Multi-Item Scheduling", Operations Research 19, 946-969, 1971.
24. Manne, A.A., "Programming of Economic Lot Sizes", Management Science 4, 115-135, 1958.
25. Potvin, J.-Y., Kervahut, T., and Rousseau, J.-M., "The Vehicle Routing Problem with Time Windows - Part I: Tabu Search", ORSA Journal on Computing, 1996. (Forthcoming).
26. Potvin, J.-Y., and Bengio, S., "The Vehicle Routing Problem with Time Windows - Part II: Genetic Search", ORSA Journal on Computing, 1996. (Forthcoming).
27. Savelsbergh, M.W.P., "Local Search for Routing Problems with Time Windows", Annals of Operations Research 4, 285-305, 1985.
28. Solomon, M.M., "Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints", Operations Research 35, 254-265, 1987.
29. Solomon, M.M., Baker, E., and Schaffer, J., "Vehicle Routing and Sheduling with Time Window Constraints: Efficient Implementation and Solution Improvement Procedures", in: B.L. Golden and A.A. Assad (eds.), Vehicle Routing: Methods and Studies, North-Holland, Amsterdam, 1988.
30. Tan, C.C.R., and Beasley, J.E., "A Heuristic for the Period Vehicle Routing Problem", Omega 12, 497-504, 1984.
31. Thangiah, S.R., "Vehicle Routing with Time Windows Using Genetic Algorithms", Technical Report SRU-Sp-Sc-TR-93-23, Slippery Rock University, Slippery Rock, PA, 1993.
32. Thizy, J.-M., "Analysis of Lagrangian Decomposition for the Multi-Item Capacitated Lot-Sizing Problem", INFOR 29, 271-283, 1991.