An integer L-shaped algorithm for time-constrained traveling salesman problem with stochastic travel and service times

Asia-Pacific Journal of Operational Research

Volumn 21, Issue 2, 2004, Pages 241-257

  Teng, S Y ^a   Ong, H L ^a   Huang, H C ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Benders' decomposition; Integer L shaped method; Stochastic program with recourse; Time constrained traveling salesman problem

Indexed keywords

BENDERS' DECOMPOSITION; INTEGER L-SHAPED METHOD; STOCHASTIC PROGRAM WITH RECOURSE; TIME-CONSTRAINED TRAVELING SALESMAN PROBLEMS;

ALGORITHMS; COMPUTATIONAL METHODS; DECISION MAKING; INTEGER PROGRAMMING; PROBLEM SOLVING; STOCHASTIC CONTROL SYSTEMS; VECTORS;

TRAVELING SALESMAN PROBLEM;

EID: 4444239435     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0217595904000229     Document Type: Article

References (25)

1. Aarts, E and JK Lenstra (1997). Local Search in Combinatorial Optimization. New York: Wiley.
2. Benders, JF (1962). Partitioning procedures for solving mixed variables programming problems. Numerische Mathematik, 4, 238-252.
3. Birge, JR and FV Louveaux (1988). A multicut algorithm for two-stage stochastic linear programs. European Journal of Operational Research, 34, 384-392.
4. Bland, RG and DF Shallcross (1989). Large traveling salesman problems arising from experiments in X-ray crystallography: a preliminary report on computation. Operations Research Letters, 8, 125-128.
5. Cloonan, J (1966). A heuristic approach to some sales territory problems. In Proceedings of the Fourth International Conference on Operations Research, JDC Little (ed.), pp. 81-84. Cambridge, Massachusetts: MIT Press.
6. Gendreau, M, G Laporte and F Semet (1998a). A branch-and-cut algorithm for the undirected selective traveling salesman problem. Networks, 32, 263-273.
7. Gendreau, M, G Laporte and F Semet (1998b). A tabu search heuristic for the undirected selective traveling salesman problem. European Journal of Operational Research, 106, 539-545.
8. Gendreau, M, G Laporte and R Seguin (1995). An exact algorithm for the vehicle routing problem with stochastic demands and customers. Transportation Science, 29, 143-155.
9. Gensch, DH (1978). An industrial application of the traveling salesman's sub-tour problem. AIIE Transactions, 10, 362-370.
10. Gilmore, PC and RE Gomory (1964). Sequencing a one-state variable machine: A solvable case of the traveling salesman problem. Operations Research, 9, 849-859.
11. Golden, BL, L Levy and R Dahl (1981). Two generalizations of the traveling salesman problem. Omega 9, 439-445.
12. Hjorring, C and J Holt (1999). New optimality cuts for a single-vehicle stochastic routing problem. Annals of Operations Research, 86, 569-584.
13. Jünger, M, G Reinelt and G Rinaldi (1994). The Traveling Salesman Problem. In Handbook on Operations Research and the Management Sciences, Ball, Magnanti, Monma, and Nemhauser (eds.), pp. 225-330, Amsterdam: North-Holland.
14. Korte, BH (1989). Applications of combinatorial optimization. In Mathematical Programming: Recent Developments and Applications, In M Iri and K Tanabe (eds.), pp. 1-55. Dordrecht: Kluwer.
15. Korte, BH and J Vygen (2000). Combinatorial Optimization: Theory and Algorithms. Berlin: Springer.
16. Laporte, G and FV Louveaux (1993). The integer L-shaped method for stochastic integer programs with complete recourse. Operations Research Letters, 13, 133-142.
17. Laporte, G, FV Louveaux and H Mercure (1992). The vehicle routing problem with stochastic travel times. Transportation Science, 26, 161-169.
18. Laporte, G, FV Louveaux and Luc Van Hamme (2002). An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands. Operations Research, 50, 415-423.
19. Laporte, G and S Martello (1990). The selective traveling salesman problem. Discrete Applied Mathematics, 26, 193-207.
20. Lawler, EL, JK Lenstra, AHG Kan Rinnooy and DB Shmoys (1985). The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Chichester, UK: John Wiley.
21. Ratliff, HD and AS Rosenthal (1981). Order-picking in a rectangular warehouse: a solvable case for the traveling salesman problem. PDRC Report Series No. 81-10, Georgia Institute of Technology, Atlanta, Georgia.
22. Reinelt, G (1994). The Traveling Salesman: Computational Solutions for TSP Applications. Berlin: Springer.
23. Tan, KC, LH Lee and K Ou (2001). Hybrid genetic algorithms in solving vehicle routing problems with time window constraints. Asia-Pacific Journal of Operational Research, 18, 121-130.
24. Teng, SY, HL Ong and HC Huang (2003). A comparative study of metaheuristics for vehicle routing problems with stochastic demands. Asia-Pacific Journal of Operational Research, 20, 1-17.
25. Van Slyke, RM and R Wet (1969) L-shaped linear programs with applications to optimal control and stochastic programming. SIAM Journal on Applied Mathematics, 17 638-663.