Real-Time Multivehicle Truckload Pickup and Delivery Problems

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

References

  • Bastian C., Rinnooy Kan A. H. G. The stochastic vehicle routing problem revisited. Eur. J. Oper. Res. (1992) 56:407–412CrossrefGoogle Scholar
  • Berman O., Simchi-Levi D. Finding the optimal a priori tour and location of a traveling salesman with nonhomogeneous customers. Transportation Sci. (1988) 22:148–154LinkGoogle Scholar
  • Berman O., Simchi-Levi D. The traveling salesman location problem on stochastic networks. Transportation Sci. (1989) 23:54–57LinkGoogle Scholar
  • Bertsimas D. J. Probabilistic combinatorial optimization problems. (1988) (Massachusetts Institute of Technology, Cambridge, MA) . Ph.D. thesisGoogle Scholar
  • Bertsimas D. J. A vehicle routing problem with stochastic demand. Oper. Res. (1992) 40:574–585LinkGoogle Scholar
  • Bertsimas D. J., Howell L. H. Further results on the probabilistic traveling salesman problem. Eur. J. Oper. Res. (1993) 65:68–95CrossrefGoogle Scholar
  • Bertsimas D. J., Simchi-Levi D. A new generation of vehicle routing research: Robust algorithms, addressing uncertainty. Oper. Res. (1996) 44:286–304LinkGoogle Scholar
  • Bertsimas D. J., van Ryzin G. A stochastic and dynamic vehicle routing problem in the Euclidean plane. Oper. Res. (1991) 39:601–615LinkGoogle Scholar
  • Bertsimas D. J., van Ryzin G. Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles. Oper. Res. (1993a) 41:60–76LinkGoogle Scholar
  • Bertsimas D. J., van Ryzin G. Stochastic and dynamic vehicle routing with general demand and interarrival time distributions. Adv. Appl. Probab. (1993b) 25:947–978CrossrefGoogle Scholar
  • Bienstock D., Bramel J., Simchi-Levi D. A probabilistic analysis of tour partitioning heuristics for the capacitated vehicle routing problem with unsplit demands. Math. Oper. Res. (1993) 18:786–802LinkGoogle Scholar
  • Bodin L. D., Golden B. L., Assad A. A., Ball M. Routing and scheduling of vehicle and crews: The state of the art. Comput. Oper. Res. (1983) 10:69–211Google Scholar
  • Bookbinder J. H., Sethi S. P. The dynamic transportation problem: A survey. Naval Res. Logist. (1980) 27:447–452CrossrefGoogle Scholar
  • Borodin A., El-Yaniv Ran. Online Computation and Competitive Analysis (1998) (Cambridge University Press, Cambridge, U.K.) Google Scholar
  • Bramel J., Simchi-Levi D. Probabilistic analyses and practical algorithms for the vehicle routing problem with time windows. Oper. Res. (1996) 44:505–509LinkGoogle Scholar
  • Bramel J., Simchi-Levi D. On the effectiveness of the set covering formulations for the vehicle routing problem with time windows. Oper. Res. (1997) 45:295–301LinkGoogle Scholar
  • Bramel J., Li C. L., Simchi-Levi D. Probabilistic analysis of the vehicle routing problem with time windows. Amer. J. Math. Management Sci. (1994) 13:267–322Google Scholar
  • Bramel J., Coffman Jr E. G., Shor P., Simchi-Levi D. Probabilistic analysis of algorithms for the capacitated vehicle routing problem with unsplit demands. Oper. Res. (1992) 40:1095–1106LinkGoogle Scholar
  • Christofides N., Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G., Shmoys D. Vehicle routing. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (1985) (John Wiley and Sons, New York) 431–448Google Scholar
  • Cook T. M., Russell R. A. A simulation and statistical analysis of stochastic vehicle routing with timing constraints. Decision Sci. (1978) 9:673–687CrossrefGoogle Scholar
  • Dejax P. J., Crainic T. G. Models for empty freight vehicle transportation logistics. Transportation Sci. (1987) 21:227–247LinkGoogle Scholar
  • Desrochers M., Lenstra J. K., Savelsbergh M. W. P., Soumis F., Golden B. L., Assad A. A. Vehicle routing with time windows: Optimization and approximation. Vehicle Routing: Methods and Studies (1988) (Elsevier (North-Holland), Amsterdam) 65–84Google Scholar
  • Dror M., Trudeau P. Stochastic vehicle routing with modified savings algorithm. Eur. J. Oper. Res. (1986) 23:228–235CrossrefGoogle Scholar
  • Dror M., Laporte G., Trudeau P. Vehicle routing with stochastic demands: Properties and solution frameworks. Transportation Sci. (1989) 23:166–176LinkGoogle Scholar
  • Fisher M. L., Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Vehicle routing. Handbooks in Operations Research and Management Science, Network Routing (1995) 8(Elsevier (North-Holland), Amsterdam) 1–33Google Scholar
  • Frantzekakis L. F., Powell W. B. A successive linear approximation procedure for stochastic, dynamic vehicle allocation problems. Transportation Res. (1990) 24:40–57Google Scholar
  • Garfinkel R. S., Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G., Shmoys D. B. Motivation and modeling. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (1985) (Wiley, New York) 17–36Google Scholar
  • Gendreau M., Potvin J.-Y., Crainic T., Laporte G. Dynamic vehicle routing and dispatching. Fleet Management and Logistics (1998) (Kluwer, New York) 115–126CrossrefGoogle Scholar
  • Gendreau M., Guertin F., Potvin J.-Y., Taillard E. Parallel tabu search for real-time vehicle routing and dispatching. Transportation Sci. (1999) 33:381–390LinkGoogle Scholar
  • Golden B. L., Assad A. A.Vehicle Routing: Methods and Studies (1988) (Elsevier (North-Holland), Amsterdam) Google Scholar
  • Golden B. L., Stewart W. R., Hogben D., Fife D. Vehicle routing with probabilistic demands. Computer Science and Statistics: Tenth Annual Symposium on the Interface (1978) (NBS Special Publication, National Book Service, Toronto, Canada) 252–259Google Scholar
  • Golden B. L., Yee J. R. A framework for probabilistic routing. AIEE Trans. (1979) 11:109–112CrossrefGoogle Scholar
  • Heyman D., Sobel M.Stochastic Models in Operations Research (1984) (McGraw-Hill, New York) Google Scholar
  • Ichoua S., Gendreau M., Potvin J.-Y. Diversion issues in real-time vehicle dispatching. Transportation Sci. (2000) 34:426–438LinkGoogle Scholar
  • Jaillet P. Probabilistic traveling salesman problem. (1985) (Massachusetts Institute of Technology, Cambridge, MA) . Ph.D. thesisGoogle Scholar
  • Jaillet P. A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Oper. Res. (1988) 36:929–936LinkGoogle Scholar
  • Jezequel A. Probabilistic vehicle routing problems. (1985) (Massachusetts Institute of Technology, Cambridge, MA) . M.Sc. dissertationGoogle Scholar
  • Laporte G., Louveaux F. V., Mercure H. A priori optimization of the probabilistic traveling salesman problem. Oper. Res. (1994) 42:543–549LinkGoogle Scholar
  • Powell W. B. A stochastic model of the dynamic vehicle allocation problem. Transportation Sci. (1986) 20:117–129LinkGoogle Scholar
  • Powell W. B. An operational planning model for the dynamic vehicle allocation problem with uncertain demands. Transportation Res. (1987) 21B:217–232CrossrefGoogle Scholar
  • Powell W. B., Golden B. I., Assad A. A. A comparative review of alternative algorithms for the dynamic vehicle allocation problem. Vehicle Routing: Methods and Studies (1988) (Elsevier (North-Holland), Amsterdam) 249–291Google Scholar
  • Powell W. B. A stochastic formulation of the dynamic assignment problem, with an application to truckload motor carrier. Transportation Sci. (1996) 30:195–219LinkGoogle Scholar
  • Powell W. B., Jaillet P., Odoni A., Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Stochastic and dynamic networks and routing. Handbooks in Operations Research and Management Science, Network Routing (1995) 8(Elsevier (North-Holland), Amsterdam) 141–296Google Scholar
  • Powell W. B., Sheffi Y., Thiriez S. The dynamic vehicle allocation problem with uncertain demands. Ninth Internat. Sympos. Transportation Traffic Theory (1984) (VNU Science Press, Utrecht) Google Scholar
  • Powell W. B., Snow W., Cheung R. K. Adaptive labeling algorithms for the dynamic assignment problem. Transportation Sci. (2000a) 34:50–66LinkGoogle Scholar
  • Powell W. B., Towns M. T., Marar A. On the value of globally optimal solutions for dynamic routing and scheduling problems. Transportation Sci. (2000b) 34:67–85LinkGoogle Scholar
  • Psaraftis H. N., Golden B. L., Assad A. A. Dynamic vehicle routing problems. Vehicle Routing: Methods and Studies (1988) (Elsevier (North-Holland), Amsterdam) 223–248Google Scholar
  • Psaraftis H. N. Dynamic vehicle routing: Status and prospects. Ann. Oper. Res. (1995) 61:143–164CrossrefGoogle Scholar
  • Regan A. C., Mahmassani H. S., Jaillet P. Improving the efficiency of commercial vehicle operations using real-time information: Potential uses and assignment strategies. Transportation Res. Record (1995) 1493:188–198Google Scholar
  • Regan A. C., Mahmassani H. S., Jaillet P. Dynamic decision making for commercial fleet operations using real-time information. Transportation Res. Record (1996a) 1537:91–97CrossrefGoogle Scholar
  • Regan A. C., Mahmassani H. S., Jaillet P., Lesort J. B. Dynamic dispatching strategies under real-time information for carrier fleet management. Transportation and Traffic Theory (1996b) (Pergamon, U.K.) 737–756Google Scholar
  • Regan A. C., Mahmassani H. S., Jaillet P. Evaluation of dynamic fleet management systems: Simulation framework. Transportation Res. Record (1998) 1645:176–184CrossrefGoogle Scholar
  • Rossi F. A., Gavioli I., Andreatta G., Mason F., Serafini P. Aspects of heuristic methods in the probabilistic traveling salesman problem. Advanced School on Stochastics in Combinatorial Optimization (1987) (World Scientific, Singapore) 214–227Google Scholar
  • Solomon M. M. Algorithms for the vehicle routing and scheduling problem with time window constraints. Oper. Res. (1987) 35:254–265LinkGoogle Scholar
  • Stewart W. R. New algorithms for deterministic and stochastic vehicle routing problems. (1981) (University of Maryland, College Park, MD) . Working Paper 81-009Google Scholar
  • Stewart W. R., Golden B. L. Stochastic vehicle routing: A comprehensive approach. Eur. J. Oper. Res. (1983) 14:371–385CrossrefGoogle Scholar
  • Tillman F. A. The multiple terminal delivery problem with probabilistic demands. Transportation Sci. (1969) 3:192–204LinkGoogle Scholar
  • Yang J., Jaillet P., Mahmassani H. S. On-line algorithms for truck fleet assignment and scheduling under real-time information. Transportation Res. Record (1998) 1667:107–113CrossrefGoogle Scholar
  • Yee J. R., Golden B. L. A note on determining operating strategies for probabilistic vehicle routing. Naval Res. Logist. Quart. (1980) 27:159–163CrossrefGoogle 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.