Route design for lean production systems

Transportation Science

Volumn 42, Issue 3, 2008, Pages 352-370

  Ohlmann, W Jeffrey ^a   Fry, J Michael ^b   Thomas, W Barrett ^a  

^a UNIVERSITY OF IOWA   (United States)

^b UNIVERSITY OF CINCINNATI   (United States)

Author keywords

Lean manufacturing; Tabu search; Vehicle routing

Indexed keywords

FLEET OPERATIONS; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; SCHEDULING; TABU SEARCH; VEHICLE ROUTING; VEHICLES; VIRTUAL REALITY;

COMPUTATIONAL TESTING; FLEET OF VEHICLES; LEAN PRODUCTION SYSTEM; PRODUCTION LEVELING; ROUTING AND SCHEDULING; TABU SEARCH HEURISTIC; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS; WORK IN PROCESS INVENTORIES;

LEAN PRODUCTION;

EID: 70449635859     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1070.0222     Document Type: Article

References (71)

1. Adelman, D. 2004. A price-directed approach to stochastic inventory/routing. Oper. Res. 52 499-514.
2. Angelelli, E., M. G. Speranza. 2002. The periodic vehicle routing problem with intermediate facilities. Eur. J. Oper. Res. 137 233-247.
3. Archetti, C., M. G. Speranza. 2006. An overview on the split delivery vehicle routing problem. K.-H. Waldmann, U. M. Stocker, eds. Operations Research Proceedings 2006, Vol. 2006. Springer, Berlin, 123-127.
4. Archetti, C., A. Hertz, M. G. Speranza. 2006a. A tabu search algorithm for the split delivery routing problem. Transportation Sci. 40(1)64-73.
5. Archetti, C., M. W. P. S. Savelsbergh, M. G. Speranza. 2006b. Worstcase analysis for split delivery vehicle routing problems. Transportation Sci. 40(2)226-234. (Pubitemid 43747025)
6. Archetti, C., M. W. P. Savelsbergh, M. G. Speranza. 2008a. An optimization-based heuristic for the split delivery vehicle routing problem. Transportation Sci. 42(1)22-31.
7. Archetti, C., M. W. P. Savelsbergh, M. G. Speranza. 2008b. To split or not to split: That is the question. Transportation Res. E. 44(1)114-123.
8. Archetti, C., L. Bertazzi, G. Laporte, M. G. Speranza. 2007a. A branch-and-cut algorithm for a vendor-managed inventoryrouting problem. Transportation Sci. 41 382-391.
9. Archetti, C., L. Bertazzi, G. Paletta, M. G. Speranza. 2007b. Optimization of an integrated production-distribution system. Technical Report 287, Department of Quantitative Methods, University of Brescia, Brescia, Italy.
10. Bard, J. F., L. Huang, P. Jaillet, M. Dror. 1998. A decomposition approach to the inventory routing problem with satellite facilities. Transportation Sci. 32 189-203.
11. Bazaraa, M. S., H. D. Sherali, C. M. Shetty. 2006. Nonlinear Programming: Theory and Algorithms. John Wiley & Sons, Hoboken, NJ.
12. Belenguer, J., M. Martinez, E. Mota. 2000. A lower bound for the split delivery vehicle routing problem. Oper. Res. 45 801-810.
13. Beltrami, E., L. Bodin. 1974. Networks and vehicle routing for municipal waste collection. Networks 4 65-94.
14. Bertazzi, L., M. G. Speranza. 1999. Models and algorithms for the minimization of inventory and transportation costs: A survey. M. G. Speranza, P. Stähly, eds. New Trends in Distribution Logistics: Lecture Notes in Economics and Mathematical Systems, Vol. 480. Springer, Berlin, 137-158.
15. Bertazzi, L., G. Paletta, M. G. Speranza. 2004. An improved heuristic for the period traveling salesman problem. Comput. Oper. Res. 31 1215-1222. (Pubitemid 38356029)
16. Bertazzi, L., M. W. P. Savelsbergh, M. G. Speranza. 2008. Inventory routing. B. Golden, S. Raghavan, E. Wasil, eds. The Vehicle Routing Problem: Latest Advances and New Challenges, Operations Research/Computer Science Interfaces Series, Vol. 43. Springer, Berlin, 49-72.
17. Braysy, O., M. Gendreau. 2005a. Vehicle routing problem with time windows, Part I: Route construction and local search algorithms. Transportation Sci. 39(1)104-118.
18. Braysy, O., M. Gendreau. 2005b. Vehicle routing problem with time windows, Part II: Metaheuristics. Transportation Sci. 39(1)119-139.
19. Campbell, A., M. Savelsbergh. 2004a. A decomposition approach for the inventory-routing problem. Transportation Sci. 38 488-502.
20. Campbell, A., M. Savelsbergh. 2004b. Efficient insertion heuristics for vehicle routing and scheduling problems. Transportation Sci. 38 369-378.
21. Campbell, A., M. Savelsbergh, L. Clarke, A. Kleywegt. 1998. The inventory routing problem. T. G. Crainic, G. Laporte, eds. Fleet Management and Logistics. Kluwer Academic Publishers, Norwell, MA, 95-112.
22. Chan, Y., S. F. Baker. 2005. The multiple depot, multiple traveling salesman facility-location problem: Vehicle range, service frequency, and heuristic implementations. Math. Comput. Model. 41 1035-1053.
23. Chen, S., B. Golden, E. Wasil. 2007. The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results. Networks 49 318-329. (Pubitemid 47324738)
24. Christofides, N., J. Beasley 1984. The period routing problem. Networks 14 237-256.
25. Chuah, K. H. 2004. Optimization and simulation of just-in-time supply pickup and delivery systems. Ph. D. thesis, College of Engineering, University of Kentucky, Lexington.
26. Chuah, K. H., J. C. Yingling. 2005. Routing for just-in-time supply pickup and delivery system. Transportation Sci. 39(3)328-339.
27. Clarke, G., W. J. Wright. 1964. Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12 568-581.
28. Cordeau, J.-F., M. Gendreau, G. Laporte. 1997. A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30 105-119. (Pubitemid 127360996)
29. Cordeau, J.-F., G. Laporte, A. Mercier. 2001. A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. 52 928-936.
30. Cordeau, J.-F., G. Laporte, M. W. P. Savelsbergh, D. Vigo. 2007. The vehicle routing problem. C. Barnhart, G. Laporte, eds. Transportation. Handbooks in Operations Research and Management Science. Elsevier, Amsterdam, 367-428.
31. Desrochers, M., J. Desrosiers, M. M. Solomon. 1992. A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40 342-354.
32. Dror, M., P. Trudeau. 1989. Savings by split delivery routing. Transportation Sci. 23 141-145.
33. Dror, M., P. Trudeau. 1990. Split delivery routing. Naval Res. Logist. 37 383-402.
34. Dror, M., G. Laporte, P. Trudeau. 1994. Vehicle routing with split deliveries. Discrete Appl. Math. 50 239-254.
35. Drummond, L. M. A., L. S. Ochi, D. S. Vianna. 2001. An asynchronous parallel metaheuristic for the period vehicle routing problem. Future Generation Comput. Systems 17 379-386.
36. Francis, P., K. Smilowitz. 2006. Modeling techniques for period vehicle routing problems. Transportation Res. Part B 40 872-884. (Pubitemid 44028706)
37. Francis, P., K. Smilowitz, M. Tzur. 2006. The period vehicle routing problem with service choice. Transportation Sci. 40 439-454.
38. Francis, P., K. Smilowitz, M. Tzur. 2007. Flexibility and complexity in periodic distribution problems. Naval Res. Logist. 54 136-150.
39. Frizzell, P. W., J. W. Griffin. 1992. The bounded split delivery vehicle routing problem with grid networks distances. Asia Pacific J. Oper. Res. 31 101-116.
40. Gaur, V., M. Fisher. 2004. A periodic inventory routing problem at a supermarket chain. Oper. Res. 52 813-822.
41. Glover, F., M. Laguna. 1997. Tabu Search. Kluwer Academic Publishers, Norwell, MA.
42. Hadley, G., T. Whitin. 1963. Analysis of Inventory Systems. Prentice-Hall, Englewood Cliffs, NJ.
43. Ho, S. C., D. Haugland. 2004. A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Comput. Oper. Res. 31 1947-1964.
44. Jaillet, P., J. F. Bard, L. Huang, M. Dror. 2002. Delivery cost approximations for inventory routing problems in a rolling horizon framework. Transportation Sci. 36 292-300.
45. Kleywegt, A. J., V. S. Nori, M. W. P. Savelsbergh. 2002. The stochastic inventory routing problem with direct deliveries. Transportation Sci. 36 94-118.
46. Kleywegt, A. J., V. S. Nori, M. W. P. Savelsbergh. 2004. Dynamic programming approximations for a stochastic inventory routing problem. Transportation Sci. 38(1)2-70.
47. Lau, H. C., Q. Liu, H. Ono. 2002. Integrating local search and network flow to solve the inventory routing problem. Amer. Assoc. Artificial Intelligence 2 9-14.
48. Lee, C.-G., M. A. Epelman, C. C. White, III, Y. A. Bozer. 2006. A shortest path approach to the multiple-vehicle routing problem with split pick-ups. Transportation Res. Part B 40 265-284.
49. Mota, E., V. Campos, A. Corberan. 2007. A new metaheuristic for the vehicle routing problem with split demands. C. Cotta, J. van Hemert, eds. Evolutionary Computation in Combinatorial Optimization. Lecture Notes in Computer Science, Vol. 4446. Springer, Berlin, 87-122.
50. Newman, A. M., C. A. Yano, P. M. Kaminsky. 2005. Third party logistics planning with routing and inventory costs. J. Geunes, P. M. Pardalos, eds. Supply Chain Optimization, Applied Optimization, Vol. 98. Springer, New York, 87-122.
51. Nowak, M., O. Ergun, C. C. White, III. 2008. Pickup and delivery with split loads. Transportation Sci. 42(1)32-43.
52. Oppen, J., A. Løkketangen. 2008. A tabu search approach to the livestock collection problem. Comput. Oper. Res. 35 3213-3229.
53. Paletta, G. 2002. The period traveling salesman problem: A new heuristic algorithm. Comput. Oper. Res. 29 1343-1352.
54. Parthanadee, P., R. Logendran. 2006. Periodic product distribution from multi-depots under limited supplies. IIE Trans. 38 1009-1026.
55. Polacek, M., K. F. Dorner, R. F. Hartl, G. Keichle, M. Reimann. 2007. Scheduling periodic customers visits for a traveling salesperson. Eur. J. Oper. Res. 179 823-837.
56. Qu, W. W., J. H. Bookbinder, P. Iyogun. 1999. An integrated inventory-transportation system with modified periodic policy for multiple products. Eur. J. Oper. Res. 115(2)254-269.
57. Rusdiansyah, A., D. Tsao. 2005. Coordinating deliveries and inventories for a supply chain under vendor managed inventory system. Japan Soc. Mech. Engineers Internat. J. Ser. A 48(2)85-90.
58. Russell, R., W. Igo. 1979. An assignment routing problem. Networks 9 1-17.
59. Savelsbergh, M. W. P. 1985. Local search in routing problems with time windows. Ann. Oper. Res. 4 285-305.
60. Savelsbergh, M. W. P., J.-H. Song. 2007a. Inventory routing with continuous moves. Comput. Oper. Res. 34 1744-1763.
61. Savelsbergh, M. W. P., J.-H. Song. 2007b. Performance measurement for inventory routing. Transportation Sci. 41(1)44-54.
62. Savelsbergh, M. W. P., J.-H. Song. 2007c. An optimization algorithm for the inventory routing with continuous moves. Comput. Oper. Res. 34(6)1744-1763.
63. Sierksma, G., G. A. Tijssen. 1998. Routing helicopters for crew exchanges on off-shore locations. Ann. Oper. Res. 76 261-286.
64. Solomon, M. M. 1987. Algorithms for the vehicle routing and scheduling problems with time windows. Oper. Res. 35 254-265.
65. Spearman, M. L., D. L. Woodruff, W. J. Hopp. 1990. CONWIP- A pull alternative to kanban. Internat. J. Production Res. 28(5)879-894.
66. Stacey, J., M. Natarajarathinam, C. Sox. 2007. The storage constrained, inbound inventory routing problem. Internat. J. Physical Distribution Logist. Management 37 (6)484-500.
67. Taillard, E. D., G. Laporte, M. Gendreau. 1996. Vehicle routing with multiple use of vehicles. J. Oper. Res. Soc. 47 1065-1070.
68. Toth, P., D. Vigo, eds. 2002. The Vehicle Routing Problem. Monographs, Discrete Mathematics and Applications, Society for Industrial and Applied Mathematics, Philadelphia.
69. Vaidyanathan, B. S., J. O. Matson, D. M. Miller, J. E. Matson. 1999. A capacitated vehicle routing problem for just-in-time delivery. IIE Trans. 31 1083-1092.
70. Womack, J. P. 2006. Why Toyota won. Wall Street Journal (February 13) A16.
71. Womack, J. P., D. T. Jones. 2003. Lean Thinking. Free Press, New York.