Decision Support for Consumer Direct Grocery Initiatives

Published Online:https://doi.org/10.1287/trsc.1040.0105

References

  • Bagchi P. K., Nag B. N. Dynamic vehicle scheduling: An expert systems approach. Internat. J. Physical Distribution Logistics Management (1991) 21(2):10–18CrossrefGoogle Scholar
  • Bertsimas D. A vehicle-routing problem with stochastic demand. Oper. Res. (1992) 40(3):574–585LinkGoogle Scholar
  • Bertsimas D., Simchi-Levi D. A new generation of vehicle routing research: Robust algorithms, addressing uncertainty. Oper. Res. (1996) 44(2):286–303LinkGoogle Scholar
  • Bertsimas D., Jaillet P., Odoni A. A priori optimization. Oper. Res. (1990) 38(6):1019–1033LinkGoogle Scholar
  • Cheung R. K., Powell W. An algorithm for multistage dynamic networks with random arc capacities with an application to dynamic fleet management. Oper. Res. (1996) 44(6):951–963LinkGoogle Scholar
  • Cox B. Internet grocer seeks an angel. InternetNews (2001) April 16). www.internetnews.comGoogle Scholar
  • Farmer M., Sandoval G. Webvan delivers its last word: Bankruptcy. News.com (2001) July 9). www.news.comGoogle Scholar
  • Fendelman A. First time, first market: Peapod achieves profitability in Chicago. Eprairie.com (2001) April 24). www.eprairie.comGoogle Scholar
  • Frantzekakis L. F., Powell W. B. A successive linear approximation procedure for stochastic, dynamic vehicle allocation problems. Transportaion Sci. (1990) 24:40–57LinkGoogle Scholar
  • Gendreau M., Laporte G., Seguin R. An exact algorithm for the vehicle routing problem with stochastic demands and customers. Transportation Sci. (1995) 29(2):143–155LinkGoogle Scholar
  • Gendreau M., Laporte G., Seguin R. Stochastic vehicle routing. Eur. J. Oper. Res. (1996) 88:3–12CrossrefGoogle Scholar
  • Jardine Logistics The challenge of e-logistics. (2001) . Report, Jardine LogisticsGoogle Scholar
  • Kontoravdis G., Bard J. A grasp for the vehicle routing problem with time windows. ORSA J. Comput. (1995) 7:10–23LinkGoogle Scholar
  • Littlewood K. Forecasting and control of passengers. 12th AGIFORS Sympos. Proc. (1972) New York:95–117Google Scholar
  • Powell W. A stochastic formulation of the dynamic assignment problem with an application to truckload motor carriers. Transportation Sci. (1996) 30:195–219LinkGoogle Scholar
  • Prosser P., Kilby P., Shaw P. Dynamic VRPs: A study of scenarios. (1998) . Technical Report APES-06-1998, University of StrathclydeGoogle Scholar
  • Psaraftis H., Golden B. L., Assad A. A. Dynamic vehicle routing problems. Vehicle Routing: Methods and Studies (1988) (Elsevier Science Publishers, Amsterdam, The Netherlands) 223–249Google Scholar
  • Psaraftis H. Dynamic vehicle routing: Status and prospects. Ann. Oper. Res. (1995) 61:143–164CrossrefGoogle Scholar
  • Punakivi M. The value added of route optimisation in home delivery. (2000) . Working paper, The ECOMLOG Research Program, Department of Industrial Engineering and Management, Helsinki University of Technology, Helsinki, FinlandGoogle Scholar
  • Regan A., Mahmassani H., Jaillet P. Dynamic decision making for commercial fleet operations using real-time operations. Transportation Res. Record (1998a) 1537:91–97CrossrefGoogle Scholar
  • Regan A., Mahmassani H., Jaillet P. Evaulation of dynamic fleet management systems. Transportation Res. Record (1998b) 1645:176–184CrossrefGoogle Scholar
  • Rego C., Roucairol C. Using tabu search for solving a dynamic multi-terminal truck dispatching problem. Eur. J. Oper. Res. (1995) 83:411–429CrossrefGoogle Scholar
  • Saranen J., Småros J. An analytical model for home delivery in the new economy. (2001) . Working paper, The ECOMLOG Research Program, Department of Industrial Engineering and Management, Helsinki University of Technology, Helsinki, FinlandGoogle Scholar
  • Savelsbergh M. Local search for routing problems with time windows. Ann. Oper. Res. (1986) 4:285–305CrossrefGoogle Scholar
  • Savelsbergh M., Sol M. Drive: Dynamic routing of independent vehicles. Oper. Res. (1998) 46:474–490LinkGoogle Scholar
  • Talluri K., van Ryzin G. An analysis of bid-price controls for network revenue management. Management Sci. (1998) 44:1577–1593LinkGoogle Scholar
  • Talluri K., van Ryzin G. A randomized linear programming method for computing network bid prices. Transportation Sci. (1999) 33(2):207–216LinkGoogle Scholar
  • Yrjölä H. Physical distribution considerations for electronic grocery shopping. Internat. J. Physical Distribution Logistics Management (2001) 31(10):746–761CrossrefGoogle Scholar
  • Zhu K., Ong K.-L. A reactive method for real time dynamic vehicle routing problems. 12th IEEE Internat. Conf. Tools Artificial Intelligence (2000) November(Vancouver, BC, Canada) Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.