Real-Time Multivehicle Truckload Pickup and Delivery Problems
Published Online:1 May 2004https://doi.org/10.1287/trsc.1030.0068
References
- The stochastic vehicle routing problem revisited. Eur. J. Oper. Res. (1992) 56:407–412Crossref, Google Scholar
- Finding the optimal a priori tour and location of a traveling salesman with nonhomogeneous customers. Transportation Sci. (1988) 22:148–154Link, Google Scholar
- The traveling salesman location problem on stochastic networks. Transportation Sci. (1989) 23:54–57Link, Google Scholar
- Probabilistic combinatorial optimization problems. (1988) (Massachusetts Institute of Technology, Cambridge, MA) . Ph.D. thesisGoogle Scholar
- A vehicle routing problem with stochastic demand. Oper. Res. (1992) 40:574–585Link, Google Scholar
- Further results on the probabilistic traveling salesman problem. Eur. J. Oper. Res. (1993) 65:68–95Crossref, Google Scholar
- A new generation of vehicle routing research: Robust algorithms, addressing uncertainty. Oper. Res. (1996) 44:286–304Link, Google Scholar
- A stochastic and dynamic vehicle routing problem in the Euclidean plane. Oper. Res. (1991) 39:601–615Link, Google Scholar
- Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles. Oper. Res. (1993a) 41:60–76Link, Google Scholar
- Stochastic and dynamic vehicle routing with general demand and interarrival time distributions. Adv. Appl. Probab. (1993b) 25:947–978Crossref, Google Scholar
- A probabilistic analysis of tour partitioning heuristics for the capacitated vehicle routing problem with unsplit demands. Math. Oper. Res. (1993) 18:786–802Link, Google Scholar
- Routing and scheduling of vehicle and crews: The state of the art. Comput. Oper. Res. (1983) 10:69–211Google Scholar
- The dynamic transportation problem: A survey. Naval Res. Logist. (1980) 27:447–452Crossref, Google Scholar
- . Online Computation and Competitive Analysis (1998) (Cambridge University Press, Cambridge, U.K.) Google Scholar
- Probabilistic analyses and practical algorithms for the vehicle routing problem with time windows. Oper. Res. (1996) 44:505–509Link, Google Scholar
- On the effectiveness of the set covering formulations for the vehicle routing problem with time windows. Oper. Res. (1997) 45:295–301Link, Google Scholar
- Probabilistic analysis of the vehicle routing problem with time windows. Amer. J. Math. Management Sci. (1994) 13:267–322Google Scholar
- Probabilistic analysis of algorithms for the capacitated vehicle routing problem with unsplit demands. Oper. Res. (1992) 40:1095–1106Link, Google Scholar
- , 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
- A simulation and statistical analysis of stochastic vehicle routing with timing constraints. Decision Sci. (1978) 9:673–687Crossref, Google Scholar
- Models for empty freight vehicle transportation logistics. Transportation Sci. (1987) 21:227–247Link, Google Scholar
- , 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
- Stochastic vehicle routing with modified savings algorithm. Eur. J. Oper. Res. (1986) 23:228–235Crossref, Google Scholar
- Vehicle routing with stochastic demands: Properties and solution frameworks. Transportation Sci. (1989) 23:166–176Link, Google Scholar
- , 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
- A successive linear approximation procedure for stochastic, dynamic vehicle allocation problems. Transportation Res. (1990) 24:40–57Google Scholar
- , 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
- , Crainic T., Laporte G. Dynamic vehicle routing and dispatching. Fleet Management and Logistics (1998) (Kluwer, New York) 115–126Crossref, Google Scholar
- Parallel tabu search for real-time vehicle routing and dispatching. Transportation Sci. (1999) 33:381–390Link, Google Scholar
- Golden B. L., Assad A. A.Vehicle Routing: Methods and Studies (1988) (Elsevier (North-Holland), Amsterdam) Google Scholar
- , 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
- A framework for probabilistic routing. AIEE Trans. (1979) 11:109–112Crossref, Google Scholar
- Stochastic Models in Operations Research (1984) (McGraw-Hill, New York) Google Scholar
- Diversion issues in real-time vehicle dispatching. Transportation Sci. (2000) 34:426–438Link, Google Scholar
- Probabilistic traveling salesman problem. (1985) (Massachusetts Institute of Technology, Cambridge, MA) . Ph.D. thesisGoogle Scholar
- A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Oper. Res. (1988) 36:929–936Link, Google Scholar
- Probabilistic vehicle routing problems. (1985) (Massachusetts Institute of Technology, Cambridge, MA) . M.Sc. dissertationGoogle Scholar
- A priori optimization of the probabilistic traveling salesman problem. Oper. Res. (1994) 42:543–549Link, Google Scholar
- A stochastic model of the dynamic vehicle allocation problem. Transportation Sci. (1986) 20:117–129Link, Google Scholar
- An operational planning model for the dynamic vehicle allocation problem with uncertain demands. Transportation Res. (1987) 21B:217–232Crossref, Google Scholar
- , 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
- A stochastic formulation of the dynamic assignment problem, with an application to truckload motor carrier. Transportation Sci. (1996) 30:195–219Link, Google Scholar
- , 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
- The dynamic vehicle allocation problem with uncertain demands. Ninth Internat. Sympos. Transportation Traffic Theory (1984) (VNU Science Press, Utrecht) Google Scholar
- Adaptive labeling algorithms for the dynamic assignment problem. Transportation Sci. (2000a) 34:50–66Link, Google Scholar
- On the value of globally optimal solutions for dynamic routing and scheduling problems. Transportation Sci. (2000b) 34:67–85Link, Google Scholar
- , Golden B. L., Assad A. A. Dynamic vehicle routing problems. Vehicle Routing: Methods and Studies (1988) (Elsevier (North-Holland), Amsterdam) 223–248Google Scholar
- Dynamic vehicle routing: Status and prospects. Ann. Oper. Res. (1995) 61:143–164Crossref, Google Scholar
- Improving the efficiency of commercial vehicle operations using real-time information: Potential uses and assignment strategies. Transportation Res. Record (1995) 1493:188–198Google Scholar
- Dynamic decision making for commercial fleet operations using real-time information. Transportation Res. Record (1996a) 1537:91–97Crossref, Google Scholar
- , 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
- Evaluation of dynamic fleet management systems: Simulation framework. Transportation Res. Record (1998) 1645:176–184Crossref, Google Scholar
- , 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
- Algorithms for the vehicle routing and scheduling problem with time window constraints. Oper. Res. (1987) 35:254–265Link, Google Scholar
- New algorithms for deterministic and stochastic vehicle routing problems. (1981) (University of Maryland, College Park, MD) . Working Paper 81-009Google Scholar
- Stochastic vehicle routing: A comprehensive approach. Eur. J. Oper. Res. (1983) 14:371–385Crossref, Google Scholar
- The multiple terminal delivery problem with probabilistic demands. Transportation Sci. (1969) 3:192–204Link, Google Scholar
- On-line algorithms for truck fleet assignment and scheduling under real-time information. Transportation Res. Record (1998) 1667:107–113Crossref, Google Scholar
- A note on determining operating strategies for probabilistic vehicle routing. Naval Res. Logist. Quart. (1980) 27:159–163Crossref, Google Scholar

