Routing for a Just-in-Time Supply Pickup and Delivery System

References

• Bard J. F., Huang L., Jaillet P., Dror M. A decomposition approach to the inventory routing problem with satellite facilities. Transportation Sci. (1998) 32(2):189–203Link, Google Scholar
• Bramel J., Simchi-Levi D.The Logic of Logistics: Theory, Algorithms, and Applications for Logistics Management (1997) (Springer, New York) Crossref, Google Scholar
• Chien T. W., Balakrishnan A., Wong R. T. An integrated inventory allocation and vehicle routing problem. Transportation Sci. (1989) 23(2):67–76Link, Google Scholar
• Chuah K. H. Optimal common frequency routing for just-in-time supply delivery systems. (2000) . Unpublished master’s thesis, University of Kentucky, Lexington, KYGoogle Scholar
• Crainic T. G., Rousseau J. Multicomodity, multimode freight transportation: A general modeling and algorithmic framework of the service network design problem. Transportation Res. B (1986) 20:225–242Crossref, Google Scholar
• Desrochers M., Soumis F. A generalized permanent labelling algorithm for the shortest path problem with time window. INFOR (1988a) 26(3):191–212Google Scholar
• Desrochers M., Soumis F. A reoptimization algorithm for the shortest path problem with time windows. Eur. J. Oper. Res. (1988b) 35:242–254Crossref, Google Scholar
• Desrochers M., Desrosiers J., Solomon M. A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. (1992) 40(2):342–354Link, Google Scholar
• Desrosiers J., Dumas Y., Solomon M. M., Soumis F., Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Time constrained routing and scheduling. Network Routing, Handbooks in Operations Research and Management Science (1995) 8(North-Holland, Amsterdam)35–139Google Scholar
• Dror M., Trudeau P. Split delivery routing. Naval Res. Logistics (1990) 37:383–402Crossref, Google Scholar
• Frizzell P. W., Giffin J. W. The split delivery vehicle scheduling problem with time window and grid network distances. Comput. Oper. Res. (1995) 22(6):655–667Crossref, Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer Academic Publishers, Boston, MA) Crossref, Google Scholar
• Hertz A., Taillard E., de Werra D., Aarts E.H.L., Lenstra J.K. Tabu search. Local Search in Combinatorial Optimization (1997) (John Wiley & Sons Ltd., Chichester, UK) 121–136Google Scholar
• Ioachim I., Gelinas S., Soumis F., Desrosiers J. A dynamic programming algorithm for the shortest path problem with time windows and linear node costs. Networks (1998) 31:193–204Crossref, Google Scholar
• Kohl N., Desrosiers J., Madsen O. B. G., Solomon M. M., Soumis F. 2-path cuts for the vehicle routing problem with time windows. Transportation Sci. (1999) 33(1):101–116Link, Google Scholar
• Mohri H., Kubo M., Mori M., Yajima Y. A split delivery vehicle routing problem. J. Oper. Res. Soc. Japan (1996) 39(3):372–388Google Scholar
• Popken D. A. An algorithm for the multiattribute, multicommodity flow problem with freight consolidation and inventory costs. Oper. Res. (1994) 42(2):274–286Link, Google Scholar
• Solomon M. M. On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints. Networks (1986) 16:161–174Crossref, Google Scholar
• Taillard E., Badeau P. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Sci. (1997) 31(2):170–186Link, Google Scholar