Territory Planning and Vehicle Dispatching with Driver Learning

References

• Beasley J. E. Fixed routes. J. Oper. Res. Soc. (1984) 35:49–55Crossref, Google Scholar
• Beasley J. E., Christofides N. Vehicle routing with a sparse feasibility graph. Eur. J. Oper. Res. (1997) 98:499–511Crossref, Google Scholar
• Benton W. C., Rossetti M. D. The vehicle scheduling problem with intermittent customer demands. Comput. Oper. Res. (1992) 19:521–531Crossref, Google Scholar
• Bertsimas D. A vehicle routing problem with stochastic demand. Oper. Res. (1992) 40:574–585Link, Google Scholar
• Branke J., Middendorf M., Noeth G., Dessouky M. M. Waiting strategies for dynamic vehicle control. Transportation Sci. (2005) 39:298–312Link, Google Scholar
• Campbell L. Clarke, Savelsbergh M. W. P., Toth P., Viego D. Inventory routing in practice: The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications (2002) (Society for Industrial and Applied Mathematics, Philadelphia, PA) 309–330Google Scholar
• Christofides N. Fixed routes and areas for delivery operations. Internat. J. Physical Distribution (1971) 1:87–93Crossref, Google Scholar
• Clarke G., Wright J. 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 analytical model and an application. Transportation Sci. (1984) 18:331–350Link, Google Scholar
• Elmaghraby S. E. Economic manufacturing quantities under conditions of learning and forgetting (EMQ/LaF). Production Planning Control (1990) 1:196–208Crossref, Google Scholar
• Erera A. Design of large-scale logistics systems for uncertain environments. (2000) . Ph.D. dissertation, University of California, Berkeley, CAGoogle Scholar
• Fisher M. L., Jaikumar R. A generalized assignment heuristic for vehicle routing. Networks (1981) 11:109–124Crossref, Google Scholar
• Gendreau M., Laporte G., Seguin R. Stochastic vehicle routing. Eur. J. Oper. Res. (1996) 88:3–12Crossref, Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer Academic Publishers, The Netherlands) Crossref, Google Scholar
• Hall R. W. Pickup and delivery systems for overnight carriers. Transportation Res. Part A (1996) 30:173–187Google Scholar
• Hall R. W., Du Y., Lin J. Use of continuous approximations within discrete algorithms for routing vehicles: Experimental results and interpretation. Networks (1994) 24:43–56Crossref, Google Scholar
• Hancock W., Bayha F., Salvendy G. The learning curve. Handbook of Industrial Engineering (1992) 2nd ed.(John Wiley, New York) Google Scholar
• Haughton M. The performance of route modification and demand stabilization strategies in stochastic vehicle routing. Transportation Res. Part B (1998) 32:551–566Crossref, Google Scholar
• Haughton M. Quantifying the benefits of route reoptimization under stochastic customer demands. J. Oper. Res. Soc. (2000) 51:320–322Crossref, Google Scholar
• Haughton M. An analysis of the assignment of delivery routes to vehicle drivers in stochastic demand. Second World Conf. Production Oper. Management (2004) Cancun, MexicoGoogle Scholar
• Haughton M., Stenger A. Modeling the customer service performance of fixed-rotes delivery systems under stochastic demands. J. Bus. Logist. (1998) 9:155–172Google Scholar
• Horowitz E., Sahni S., Rajasekaran S.Computer Algorithms (1997) (Computer Science Press, New York) Google Scholar
• Jula H., Dessouky M. M., Ioannou P. Truck route planning in non-stationary stochastic networks with time-windows at customer locations. IEEE Trans. Intelligent Transportation Systems (2006) 37:51–63Crossref, Google Scholar
• Kuhn H. W. The Hungarian method for the assignment problem. Naval Res. Logist. Quart. (1955) 2:83–97Crossref, Google Scholar
• Laguna M., Kelly J. P., González-Velarde J. L., Glover F. Tabu search for the multilevel generalized assignment problem. Eur. J. Oper. Res. (1995) 82:176–189Crossref, Google Scholar
• Laporte G. The vehicle routing problem: An overview of exact and approximate algorithms. Eur. J. Oper. Res. (1992) 59:345–358Crossref, Google Scholar
• Lin S. Computer solutions of the traveling salesman problem. Bell System Tech. J. (1966) 44:2245–2269Crossref, Google Scholar
• Marar A., Powell W. B., Kulkarni S. Combining cost-based and rule-based knowledge in complex resource allocation problems. IIE Trans. (2006) 38:159–172Crossref, Google Scholar
• Newell G. F., Daganzo C. F. Design of multiple vehicle delivery vehicle routes—I.A Ring Radial Network. Transportation Res. Part B (1986) 20:345–364Crossref, Google Scholar
• Potvin J. Y., Rousseau J. M. A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. Eur. J. Oper. Res. (1993) 66:331–340Crossref, Google Scholar
• Savelsbergh M. W. P., Goetschalckx M. A comparison of the efficiency of fixed versus variable vehicle routes. J. Bus. Logist. (1995) 16:163–187Google Scholar
• Solomon M. Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. (1987) 35:254–265Link, Google Scholar
• Stewart W. R., Golden B. L. Stochastic vehicle routing: A comprehensive approach. Eur. J. Oper. Res. (1983) 14:371–385Crossref, Google Scholar
• Waters D. J. Vehicle-scheduling problems with uncertainty and omitted customers. J. Oper. Res. Soc. (1989) 40:1099–1108Crossref, Google Scholar
• Wong K. F., Beasley J. E. Vehicle routing using fixed delivery areas. OMEGA Internat. J. Management Sci. (1984) 12:591–600Crossref, Google Scholar
• Wright T. Factors affecting the cost of airplanes. J. Aeronautical Sci. (1936) 3:122–128Crossref, Google Scholar
• Zaret D. Vehicle routing algorithm for DPS. (1999) . UPS Corporate IE Technical Report, MDGoogle Scholar
• Zhong H. Territory planning and vehicle dispatching with stochastic customers and demand. (2001) . Ph.D. dissertation, University of Southern California, Los Angeles, CAGoogle Scholar