The Stochastic Multiperiod Location Transportation Problem

References

• Albareda-Sambola M., Fernandez E., Laporte G. Heuristic and lower bound for a stochastic location-routing problem. Eur. J. Oper. Res. (2007) 179:940–955Crossref, Google Scholar
• Ambrosino D., Scutella M. G. Distribution network design: New problems and related models. Eur. J. Oper. Res. (2005) 165:610–624Crossref, Google Scholar
• Ballou R. H.Business Logistics Management (1992) 3rd ed.(Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Barreto S., Ferreira C., Paixao J., Santos B. S. Using clustering analysis in a capacitated location-routing problem. Eur. J. Oper. Res. (2007) 179:968–977Crossref, Google Scholar
• Berger R. T., Coullard C. R., Daskin M. S. Location-routing problems with distance constraints. Transportation Sci. (2007) 41(1):29–43Link, Google Scholar
• Berman O., Krass D., Xu C. W. Location discretionary service facilities based on probabilistic customer flows. Transportation Sci. (1995) 29(3):276–290Link, Google Scholar
• Birge J. R., Louveaux F.Introduction to Stochastic Programming (1997) (Springer, New York) Google Scholar
• Chien T. W. Heuristic procedures for practical-sized uncapacitated location-capacitated routing problems. Decision Sci. (1993) 24(5):995–1021Crossref, Google Scholar
• Clarke G., Wright J. W. Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. (1964) 12:568–581Link, Google Scholar
• Daganzo C. F. The distance traveled to visit N points with a maximum of C stops per vehicle: An analytic model and an application. Transportation Sci. (1984) 18(4):331–350Link, Google Scholar
• Girard S., Renaud J., Boctor F. F. Heuristiques rapides pour le problème de tournées de véhicules. Administrative Sci. Assoc. Canada 2006 Proc. (2006) (Banff, Alberta, Canada) Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer Academic Publishers, Boston) Crossref, Google Scholar
• Klose A., Drexl A. Facility location models for distribution system design. Eur. J. Oper. Res. (2005) 162:4–29Crossref, Google Scholar
• Kouvelis P., Yu G.Robust Discrete Optimization and Its Applications (1997) (Kluwer Academic Publishers, Dordrecht, The Netherlands) Crossref, Google Scholar
• Kuehn A. A., Hamburger M. J. A heuristic program for locating warehouses. Management Sci. (1963) 9:643–666Link, Google Scholar
• Laporte G., Golden B. L., Assad A. A. Location-routing problems. Vehicle Routing: Methods and Studies (1988) (North-Holland, Amsterdam) 163–198Google Scholar
• Laporte G., Dejax P. J. Dynamic location routing problems. J. Oper. Res. Soc. (1989) 40(5):471–482Crossref, Google Scholar
• Laporte G., Louveaux F. V., Crainic T. G., Laporte G. Solving stochastic routing problems. Fleet Management and Logistics (1998) (Kluwer Academic Publishers, Boston) Crossref, Google Scholar
• Laporte G., Osman I. H. Routing problems: A bibliography. Ann. Oper. Res. (1995) 61:227–262Crossref, Google Scholar
• Laporte G., Louveaux F. V., Mercure H. Models and exact solutions for a class of stochastic location-routing problems. Eur. J. Oper. Res. (1989) 39:71–78Crossref, Google Scholar
• Laporte G., Gendreau M., Potvin J.-Y., Semet F. Classical and modern heuristics for the vehicle routing problem. Internat. Trans. Oper. Res. (2000) 7:285–300Crossref, Google Scholar
• Min H., Jayaraman V., Srivastava R. Combined location-routing problems: A synthesis and future research directions. Eur. J. Oper. Res. (1998) 108:1–15Crossref, Google Scholar
• Nagy G., Salhi S. Nested heuristic methods for the location-routing problem. J. Oper. Res. Soc. (1996a) 47(9):1166–1174Crossref, Google Scholar
• Nagy G., Salhi S. A nested location-routing heuristic using route length estimation. Stud. Locational Anal. (1996b) 10:109–127Google Scholar
• Nagy G., Salhi S. Location-routing: Issues, models and methods. Eur. J. Oper. Res. (2007) 177:649–672Crossref, Google Scholar
• Owen S. H., Daskin M. S. Strategic facility location: A review. Eur. J. Oper. Res. (1998) 111:423–447Crossref, Google Scholar
• Prins C., Prodhon P., Ruiz A., Soriano P., Calvo R. W. Solving the capacitated location-routing problem by a cooperative Lagrangian relaxation-granular tabu search heuristic. Transportation Sci. (2007) 41(4):470–483Link, Google Scholar
• Rei W., Gendreau M., Soriano P. A hybrid Monte Carlo local branching algorithm for the single vehicle routing problem with stochastic demands. (2007) . CIRRELT Research Document 2007–24, CIRRELT, MontrealGoogle Scholar
• Ruszczynski A., Shapiro A.Stochastic Programming (2003) 10(Elsevier, Amsterdam) Handbooks in Operations Research and Management ScienceCrossref, Google Scholar
• Salhi S., Nagy G. Consistency and robustness in location-routing. Stud. Locational Anal. (1999) 13:3–19Google Scholar
• Salhi S., Nagy G. Local improvement in planar facility location using vehicle routing. Ann. Oper. Res. (2009) 167(1):287–296Crossref, Google Scholar
• Santoso T., Ahmed S., Goetschalckx M., Shapiro A. A stochastic programming approach for supply chain network design under uncertainty. Eur. J. Oper. Res. (2005) 167:96–115Crossref, Google Scholar
• Sariklis D., Powell S. A heuristic method for the open vehicle routing problem. J. Oper. Res. Soc. (2000) 51:564–573Crossref, Google Scholar
• Shapiro A., Ruszczynski A., Shapiro A. Monte Carlo sampling methods. Stochastic Programming (2003) 10(Elsevier, Amsterdam) Handbooks in Operations Research and Management ScienceCrossref, Google Scholar
• Shen Z.-J. Integrated supply chain design models: A survey and future research directions. J. Indust. Management Optim. (2007) 3(1):1–27Crossref, Google Scholar
• Snyder L. V., Daskin M. S. Reliability models for facility location: The expected failure cost case. Transportation Sci. (2005) 39:400–416Link, Google Scholar
• Talbi E. G. A taxonomy of hybrid metaheuristics. J. Heuristics (2002) 8:541–564Crossref, Google Scholar
• Toth P., Vigo D., Crainic T. G., Laporte G. Exact solution of the vehicle routing problem. Fleet Management and Logistics (1998) (Springer, Berlin) Crossref, Google Scholar
• Tuzun D., Burke L. I. A two-phase tabu search approach to the location routing problem. Eur. J. Oper. Res. (1999) 116:87–99Crossref, Google Scholar
• Verweij B., Ahmed S., Kleywegt A. J., Nemhauser G., Shapiro A. The sample average approximation method applied to stochastic routing problems: A computational study. Computational Optim. Appl. (2003) 24:289–333Crossref, Google Scholar
• Vila D., Martel A., Beauregard R. Taking market forces into account in the design of production-distribution networks: A positioning by anticipation approach. J. Indust. Management Optim. (2007) 3(1):29–50Crossref, Google Scholar
• Zainuddin Z. M., Salhi S. A perturbation-based heuristic for the capacitated multisource Weber problem. Eur. J. Oper. Res. (2007) 179:1194–1207Crossref, Google Scholar