Probabilistic traveling salesman problem with deadlines

Transportation Science

Volumn 42, Issue 1, 2008, Pages 1-21

  Campbell, Ann M ^a   Thomas, Barrett W ^a  

^a UNIVERSITY OF IOWA   (United States)

Author keywords

Deadlines; Probabilistic; Traveling salesman problem; Vehicle routing

Indexed keywords

STOCHASTIC MODELS; STOCHASTIC SYSTEMS; VEHICLE ROUTING;

CHANCE-CONSTRAINED MODEL; COMPUTATIONAL EXPERIMENT; DEADLINES; DETERMINISTIC MODELS; PROBABILISTIC; PROBABILISTIC TRAVELING SALESMAN PROBLEM; TIME CONSTRAINTS;

TRAVELING SALESMAN PROBLEM;

EID: 70349850435     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1070.0203     Document Type: Article

References (63)

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