Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/informs/technical-note-routing-and-location-routing-p-delivery-men-problems-on-PU0ex4tYRj
References (8)
-
D. Simchi-Levi, O. Berman (1991)
Minimizing the Total Flow Time of n Jobs on a NetworkIie Transactions, 23
-
J. Tsitsiklis (1992)
Special cases of traveling salesman and repairman problems with time windowsNetworks, 22
-
S. Sahni, T. Gonzalez (1976)
P-Complete Approximation ProblemsJournal of the ACM (JACM), 23
-
A. Lucena (1990)
Time-dependent traveling salesman problem-the deliveryman caseNetworks, 20
-
E. Minieka (1990)
The delivery man problem on a tree networkAnnals of Operations Research, 18
-
M. Fischetti, G. Laporte, S. Martello (1993)
The Delivery Man Problem and Cumulative MatroidsOper. Res., 41
-
F. Afrati, S. Cosmadakis, C. Papadimitriou, G. Papageorgiou, Nadia Papakostantinou (1986)
The Complexity of the Travelling Repairman ProblemRAIRO Theor. Informatics Appl., 20
-
E. Erkut (1990)
Facility location analysis: Theory and applications: J.C. Baltzer AG, Basle, 1989. 372 pagesEuropean Journal of Operational Research, 45
- Publisher
- INFORMS
- Copyright
- Copyright © INFORMS
- Subject
- Technical Note
- ISSN
- 0041-1655
- eISSN
- 1526-5447
- DOI
- 10.1287/trsc.28.2.162
- Publisher site
- See Article on Publisher Site
Abstract
In this note, we discuss routing and location-routing delivery men problems on a path. The objective of the delivery men problem is to find service tours so as to minimize the total waiting time of all customers. We present an O(n2) time algorithm for the location-routing problem with a single server. This algorithm is further used in polynomial time algorithms that are developed for routing and location-routing problems with p servers. Also considered is the sales-delivery men problem for which in addition to the delivery men criterion, also the traveling salesman criterion (which is of primary importance) is used.
Journal
Transportation Science – INFORMS
Published: May 1, 1994