Probabilistic Traveling Salesman Problem with Deadlines

References

• Baker E. An exact algorithm for the time constrained traveling salesman problem. Oper. Res. (1983) 31:938–945Link, Google Scholar
• Bartholdi J. J., Platzman L. K., Collins R. L., Warden W. H. A minimal technology routing system for Meals on Wheels. Interfaces (1983) 13:1–8Link, Google Scholar
• Bastian C., Rinnooy Kan A. H. G. The stochastic vehicle routing problem revisited. Eur. J. Oper. Res. (1992) 56:407–412Crossref, Google Scholar
• Bertsimas D. J. Probabilistic combinatorial optimizations problems. (1988) . Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
• Bertsimas D. J. A vehicle routing problem with stochastic demand. Oper. Res. (1992) 40:574–585Link, Google Scholar
• Bertsimas D. J., Howell L. H. Further results on the probabilistic traveling salesman problem. Eur. J. Oper. Res. (1993) 65:68–95Crossref, Google Scholar
• Bertsimas D. J., Simchi-Levi D. A new generation of vehicle routing research: Robust algorithms, addressing uncertainty. Oper. Res. (1996) 44:286–303Link, Google Scholar
• Bertsimas D. J., Chervi P., Peterson M. Computational approaches to stochastic vehicle routing problems. Transportation Sci. (1995) 29:342–352Link, Google Scholar
• Bertsimas D. J., Jaillet P., Odoni A. R. A priori optimization. Oper. Res. (1990) 38:1019–1033Link, Google Scholar
• Bianchi L., Campbell A. M. Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem. Eur. J. Oper. Res. (2007) 176:131–144Crossref, Google Scholar
• Bianchi L., Knowles J., Bowler N. Local search for the probabilistic traveling salesman problem: Correction to the 2-p-opt and 1-shift algorithms. Eur. J. Oper. Res. (2005) 162:206–219Crossref, Google Scholar
• Birge J. R., Louveaux F.Introduction to Stochastic Programming (1997) (Springer-Verlag, New York) Google Scholar
• Bramel J., Coffman E. G., Shor P. W., Simchi-Levi D. Probabilistic analysis of the capacitated vehicle routing problem with unsplit demands. Oper. Res. (1992) 340:1095–1106Link, Google Scholar
• Campbell A. Aggregation for the probabilistic traveling salesman problem. Comput. Oper. Res. (2006) 33:2703–2724Crossref, Google Scholar
• Campbell A. M., Thomas B. W. Runtime reduction techniques for the probalistic traveling salesman problem with deadlines. (2007) . Submitted for publicationGoogle Scholar
• Carlton W. B., Barnes J. W. Solving the traveling-salesman problem with time windows using tabu search. IIE Trans. (1996) 28:617–629Crossref, Google Scholar
• Charnes A., Cooper W. W. Chance-constrained programming. Management Sci. (1959) 6:73–79Link, Google Scholar
• Charnes A., Cooper W. W. Deterministic equivalents for optimizing and satisficing under chance constraints. Oper. Res. (1963) 11:18–39Link, Google Scholar
• Charnsirisakskul K., Griffin P. M., Keskinocak P. Order selection and scheduling with leadtime flexibility. IEE Trans. (2004) 36:697–707Crossref, Google Scholar
• Cheh K., Goldberg J., Askin R. A note on the effect of neighborhood structure in simulated annealing. Comput. Oper. Res. (1991) 18:537–547Crossref, Google Scholar
• Chervi P. A computational approach to probabilistic vehicle routing problems. (1988) . Master's thesis, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
• Christofides N., Mingozzi A., Toth P. State space relaxation procedures for the computation of bounds to routing problems. Networks (1981) 11:145–164Crossref, Google Scholar
• Dror M. Modeling vehicle routing with uncertain demands as stochastic programs: Properties of the corresponding solution. Eur. J. Oper. Res. (1993) 64:432–441Crossref, Google Scholar
• Dror M., Trudeau P. Stochastic vehicle routing with modified savings algorithm. Eur. J. Oper. Res. (1986) 23:228–235Crossref, Google Scholar
• Dror M., Laporte G., Trudeau P. Vehicle routing with stochastic demands: Properties and solution frameworks. Transportation Sci. (1989) 23:166–176Link, Google Scholar
• Dumas Y., Desrosiers J., Gelinas E., Solomon M. M. An optimal algorithm for the traveling salesman problem with time windows. Oper. Res. (1995) 43:367–371Link, Google Scholar
• FedEx Rules/accessorial tariff via all motor routes naming rules, regulations and claims procedures applying on surface expedited services between points in North America (except Mexico). (2003) . FedEx Custom Critical. http://customcritical.fedex.com/us/serviceinfo/documents/pdf/tarifffdcc101g.pdf?link=4. Accessed April 11, 2005Google Scholar
• FedEx Service info: Money back guarantee. (2004) . http://www.fedex.com/us/services/express/. Accessed August 9, 2004Google Scholar
• Feo T. A., Resende M. G. C. Greedy randomized adpative search procedures. J. Global Optim. (1995) 6:109–134Crossref, Google Scholar
• Focacci F., Lodi A., Milano M. A hybrid exact algorithm for the TSPTW. INFORMS J. Comput. (2002) 14:403–417Link, Google Scholar
• Foster T. A. Expedited explodes. Logist. Management Distribution Rep. (1999) 38:69–73Google Scholar
• Gendreau M., Hertz A., Laporte G. New insertion and postoptimization procedures for the traveling salesman problem. Oper. Res. (1992) 40:1086–1094Link, Google Scholar
• Gendreau M., Laporte G., Séguin R. An exact algorithm for the vehicle routing problem with stochastic demands and customers. Transportation Sci. (1995a) 29:143–155Link, Google Scholar
• Gendreau M., Laporte G., Séguin R. Stochastic vehicle routing. Eur. J. Oper. Res. (1996) 88:3–12Crossref, Google Scholar
• Gendreau M., Laporte G., Solomon M. M. Single-vehicle routing and scheduling to minimize the number of delays. Transportation Sci. (1995b) 29:56–62Link, Google Scholar
• Gendreau M., Hertz A., Laporte G., Stan M. A generalized insertion heuristic for the traveling salesman problem with time windows. Oper. Res. (1998) 46:330–335Link, Google Scholar
• Gutin G., Punnen A. P. The traveling salesman problem and its variations. Combinatorial Optimization (2002) 12(Kluwer Academic Publishers, Dordrecht, The Netherlands) Google Scholar
• Hopp W. J., Spearman M. L.Factory Physics: Foundations of Manufacturing Management (2000) 2nd ed.(Irwin/McGraw-Hill, Boston) Google Scholar
• Jaillet P. Probabilistic traveling salesman problems. (1985) . Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
• Jaillet P. A priori solution of the traveling salesman problem in which a random subset of customers are visited. Oper. Res. (1988) 36:929–936Link, Google Scholar
• Langevin A., Desrochers M., Desrosiers J., Gélinas S., Soumis F. A two-commodity flow formulation for the traveling salesman and makespan problems with time windows. Networks (1993) 23:631–640Crossref, 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., Louveaux F. V., Mercure H. A priori optimization of the probabilistic traveling salesman problem. Oper. Res. (1994) 42:543–549Link, Google Scholar
• Nahmias S.Production and Operations Analysis (2001) 4th ed.(Irwin/McGraw-Hill, Boston) Google Scholar
• Ohlmann J. W., Thomas B. W. A compressed annealing approach to the traveling salesman problem with time windows. INFORMS J. Comput. (2007) 19(1):80–90Link, Google Scholar
• Pesant G., Gendreau M., Potvin J.-Y., Rousseau J.-M. An exact constraint logic programming algorithm for the traveling salesman problem with time windows. Transportation Sci. (1998) 32:12–29Link, Google Scholar
• Pesant G., Gendreau M., Potvin J.-Y., Rousseau J.-M. On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem. Eur. J. Oper. Res. (1999) 117:253–263Crossref, Google 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. Network Routing. Handbooks in Operations Research and Management Science (1995) 8(North-Holland, Amsterdam) 141–295Google Scholar
• Savelsbergh M. W. P. Local search in routing problems with time windows. Ann. Oper. Res. (1985) 4:285–305Crossref, Google Scholar
• Savelsbergh M. W. P., Goetschalckx M. A comparison of the efficiency of fixed versus variable vehicle routes. J. Bus. Logist. (1995) 46:474–490Google Scholar
• Scherck T. R. A view of the future for the U.S. expedited transportation industry. (2003) . http://www.colography.com/press/2003/futureview.html. Accessed December 26, 2003Google Scholar
• Schulz J. D. Next day, unionized. Traffic World (2003) 267:26–27Google Scholar
• Shanahan J. The need for speed. Logist. Management (2003) 42:49–52Google Scholar
• Slotnick S. A., Sobel M. J. Manufacturing lead-time rules: Customer retention versus tardiness costs. Eur. J. Oper. Res. (2005) 163:825–856Crossref, Google Scholar
• Stewart W. R., Golden B. L. Stochastic vehicle routing: A comprehensive approach. Eur. J. Oper. Res. (1983) 14:371–385Crossref, Google Scholar
• Tang H., Miller-Hooks E. Approximate procedures for the probabilistic traveling salesman problem. Transportation Res. Record (2004) 1882:27–36Crossref, Google Scholar
• Teng S. Y., Ong H. L., Huang H. C. An integer L-shaped algorithm for the time-constrained traveling salesman problem with stochastic travel times and service times. Asia-Pacific J. Oper. Res. (2004) 21:241–257Crossref, Google Scholar
• Tillman F. The multiple terminal delivery problem with probabilistic demands. Transportation Sci. (1969) 3:192–204Link, Google Scholar
• United Parcel Service Calculating time and cost FAQ. (2004) . http://www.ups.com/content/us/en/resources/service/. Accessed August 9, 2004Google Scholar
• U.S. Department of Transportation Federal Highway Administration Freight transportation: Improvements and the economy. (2004) . http://www.ops.fhwa.dot.gov/freight/documents/improve_econ.pdf. Accessed July 12, 2004Google Scholar
• Wolfler Calvo R. A new heuristic for the traveling salesman problem with time windows. Transportation Sci. (2000) 34:113–124Link, Google Scholar
• Wong J. C. F., Leung J. M. Y., Cheng C. H. On a vehicle routing problem with time windows and stochastic travel times: Models, algorithms, and heuristics. (2003) . Technical Report SEEM2003-03, Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, Hong KongGoogle Scholar
• Yang W.-H., Mather K., Ballou R. H. Stochastic vehicle routing problem with restocking. Transportation Sci. (2000) 34:99–112Link, Google Scholar