Depth-first solutions for the deliveryman problem on tree-like networks: An evaluation using a permutation model

Transportation Science

Volumn 30, Issue 2, 1996, Pages 134-147

  Webb, Ian R ^a,b  

^a UNIVERSITY OF CONNECTICUT   (United States)

^b AMERICAN EXPRESS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LAGRANGE MULTIPLIERS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; TREES (MATHEMATICS);

DELIVERYMAN PROBLEM; DEPTH FIRST SOLUTION; LAGRANGIAN RELAXATION; PERMUTATION MODEL; TREE LIKE NETWORKS;

TRANSPORTATION ROUTES;

EID: 0030149299     PISSN: 00411655     EISSN: None     Source Type: Journal    
DOI: 10.1287/trsc.30.2.134     Document Type: Review

References (15)

1. AFRATI, F., S. COSMADAKIS, C. PAPADIMITRIOU, G. PAPAGEORGIOU AND N. PAPAKONSTANTINOU, "The Complexity of the Travelling Repairman Problem," Theoretical Informatics and Applications 20(1), 79-87 (1986).
2. AVERBAKH, I. AND O. BERMAN, "Sales-Delivery Man Problems on Tree-Like Networks," to appear in Networks.
3. BODIN, L., B. GOLDEN, A. ASSAD AND M. O. BALL, "Routing and Scheduling of Vehicles and Crews-The State of the Art," Comput. & Opns. Res. 10, 63-212 (1983).
4. FISCHETTI, M., G. LAPORTE AND S. MARTELLO, "The Delivery Man Problem and Cumulative Matroids," Oper. Res. 41(6), 1055-1064 (1993).
5. FISHER, M., "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Mngt. Sci. 27(1), 1-18 (1981).
6. GAVISH, B. AND S. GRAVES, "The Travelling Salesman Problem and Related Problems," Working Paper, Graduate School of Management, University of Rochester, 1978.
7. HORN, W., "Single Machine Job Scheduling with Treelike Ordering and Linear Delay Penalties," SIAM J. Appl. Math. 23, 189-202 (1972).
8. LUCENA, A., Time-Dependent Travelling Salesman Problem-The Deliveryman Case," Networks 20, 753-763 (1990).
9. MINIEKA, E., The Delivery Man Problem on a Tree Network"; in L. Louveaux, M. Labbe, and J.-F. Thisse (eds.), Facility Location Analysis - Theory and Applications, Annals of Operations Research, Vol. 18, pp. 261-266, J. C. Baltzer, Basel, 1989.
10. SAHNI, S. AND T. GONZALES, "P-complete Approximation Problems," J. Assoc. Comput. Mach. 23, 555-565 (1976).
11. SALKIN, H., Integer Programming, Addison-Wesley, Reading, MA (1975).
12. SIDNEY, J., "Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs," Oper. Res. 23(2), 283-298 (1975).
13. SIMCHI-LEVI, D. AND O. BERMAN. "Minimizing the Total Flow Time of n Jobs on a Network," IIE Trans. 23, 236-244 (1990).
14. TSITSIKLIS, J., "Special Cases of Travelling Salesman and Repairman Problems with Time Windows," Networks 22(3), 263-282 (1992).
15. WEBB, I., "Sharp Lower Bounds for the Deliveryman Problem on Tree Networks: An Application of Permutation Decision Variables," Working Paper WP93-008, University of Connecticut School of Business Administration, 1993.