Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems

References

• Adelman D. A price-directed approach to stochastic inventory/routing. Oper. Res. (2004) 52(4):499–514Link, Google Scholar
• Campbell A. M., Savelsbergh M. W. P. A decomposition approach for the inventory-routing problem. Transportation Sci. (2004) 38(4):488–502Link, Google Scholar
• Campbell A. M., Clarke L. W., Kleywegt A. J., Savelsbergh M. W. P., Crainic T. G., Laporte G. The inventory-routing problem. Fleet Management and Logistics (1998) (Kluwer, Boston) 95–113Crossref, 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
• Festa P., Resende M. G. C. An annotated bibliography of GRASP. (2004) . Technical Report TD-5WYSEW, AT&T Labs Research, Florham Park, NJGoogle Scholar
• Glover F., Laguna M., González-Velarde J. L. Multi-start and strategic oscillation methods—Principles to exploit adaptive memory. OR Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research (2000) (Kluwer, Boston) 1–24Crossref, Google Scholar
• Høyland K., Kaut M., Wallace S. W. A heuristic for moment-matching scenario generation. Comput. Optim. Appl. (2003) 24(2–3):169–185Crossref, Google Scholar
• Hvattum L. M., Løkketangen A., Glover F., Karlof J. New heuristics and adaptive memory procedures for Boolean optimization problems. Integer Programming: Theory and Practice (2005) (CRC Press, Boca Raton, FL) 1–18Google Scholar
• Kaut M., Wallace S. W. Evaluation of scenario-generation methods for stochastic programming. Pacific J. Optim. (2007) 3(2):257–271Google Scholar
• Kleywegt A. J., Nori V. S., Savelsbergh M. W. P. The stochastic inventory-routing problem with direct deliveries. Transportation Sci. (2002) 36(1):94–118Link, Google Scholar
• Kleywegt A. J., Nori V. S., Savelsbergh M. W. P. Dynamic programming approximations for a stochastic inventory-routing problem. Transportation Sci. (2004) 38(1):42–70Link, Google Scholar
• Løkketangen A., Glover F., Voß S., Martello S., Osman I. H., Roucairol C. Candidate list and exploration strategies for solving 0/1 MIP problems using a pivot neighborhod. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization (1999) (Kluwer, Dordrecht, The Netherlands) 141–154Crossref, Google Scholar
• Powell W. B.Approximate Dynamic Programming: Solving the Curses of Dimensionality (2007) (Wiley, Hoboken, NJ) Crossref, Google Scholar
• Prais M., Ribeiro C. C. Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment. INFORMS J. Comput. (2000) 12(3):164–176Link, Google Scholar
• Puterman M. L.Markov Decision Processes (1994) (John Wiley & Sons, New York) Crossref, Google Scholar
• Resende M. G. C., Ribeiro C. C., Glover F., Kochenberger G. A. Greedy randomized adaptive search procedures. Handbook of Metaheuristics (2003) (Kluwer, Boston) 219–249Crossref, Google Scholar