Technical Note—Routing and Location-Routing p-Delivery Men Problems on a Path

Igor Averbakh and Oded Berman
Additional contact information
Igor Averbakh: University of Toronto, Division of Management and Economics at Scarborough College, Scarborough, Ontario M1C 1A4, Canada
Oded Berman: University of Toronto, Division of Management and Economics at Scarborough and Faculty of Management, Toronto, Ontario M5S 1V4, Canada

Transportation Science, 1994, vol. 28, issue 2, 162-166

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 ( n 2 ) 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.

Date: 1994
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.28.2.162 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:28:y:1994:i:2:p:162-166

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().