A Hybrid Heuristic for an Inventory Routing Problem

References

• Archetti C., Bertazzi L., Laporte G., Speranza M. G. A branch-and-cut algorithm for a vendor-managed inventory routing problem. Transportation Sci. (2007) 41(3):382–391Link, Google Scholar
• Bell W. J., Dalberto L. M., Fisher M. L., Greenfield A. J., Jaikumar R. G., Kedia P., Mack R. G., Prutzman P. J. Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. Interfaces (1983) 13(6):4–23Link, Google Scholar
• Bertazzi L., Paletta G., Speranza M. G. Deterministic order-up-to level policies in an inventory routing problem. Transportation Sci. (2002) 36(1):119–132Link, Google Scholar
• Bertazzi L., Speranza M. G., Savelsbergh M. W. P., Golden B., Raghavan R., Wasil E. Inventory routing. The Vehicle Routing Problem: Latest Advances and New Challenges (2008) (Springer, New York) 49–72Crossref, Google Scholar
• Blumenfeld D. E., Burns L. D., Diltz J. D., Daganzo C. F. Analyzing trade-offs between transportation, inventory and production costs on freight networks. Transportation Res. B (1985) 19(5):361–380Crossref, Google Scholar
• Campbell A. M., Clarke L., Kleywegt A., Savelsbergh M. W. P., Crainic T. G., Laporte G. The inventory routing problem. Fleet Management and Logistics (1998) (Kluwer Academic Publishers, Boston) 95–113Crossref, Google Scholar
• Cordeau J.-F., Laporte G., Savelsbergh M. W. P., Vigo D., Barnhart C., Laporte G. Vehicle routing. Handbooks in Operations Research and Management Science: Transportation (2009) 14(North-Holland, Amsterdam) 367–428Google Scholar
• Dror M., Ball M., Golden B. A computational comparison of algorithms for the inventory routing problem. Ann. Oper. Res. (1985) 4(1):1–23Crossref, Google Scholar
• Federgruen A., Simchi-Levi D., Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Analysis of vehicle routing and inventory-routing problems. Handbooks in Operations Research and Management Science: Network Routing (1995) 8(North-Holland, Amsterdam) 297–373Crossref, Google Scholar
• Federgruen A., Zipkin P. A combined vehicle routing and inventory allocation problem. Oper. Res. (1984) 32(5):1019–1032Link, Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman & Company, New York) Google Scholar
• Gendreau M., Hertz A., Laporte G. A tabu search heuristic for the vehicle routing problem. Management Sci. (1994) 40(10):1276–1290Link, Google Scholar
• Glover F. Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. (1986) 13(5):533–549Crossref, Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer Academic Publishers, Dordrecht, The Netherlands) Crossref, Google Scholar
• Golden B., Assad A., Dahl R. Analysis of a large scale vehicle routing problem with an inventory component. Large Scale Systems (1984) 7(2–3):181–190Google Scholar
• Kellerer H., Pferschy U., Pisinger D.Knapsack Problems (2004) (Springer-Verlag, Berlin) Crossref, Google Scholar
• Lin S., Kernighan B. W. An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. (1973) 21(2):498–516Link, Google Scholar
• Martello S., Toth P.Knapsack Problems: Algorithms and Computer Implementations (1990) (John Wiley & Sons, New York) Google Scholar
• Taillard E. Robust taboo search for the QAP. Parallel Comput. (1991) 17(4–5):443–455Crossref, Google Scholar