Probabilistic a priori routing‐location problems

Igor Averbakh, Oded Berman and David Simchi‐Levi

Naval Research Logistics (NRL), 1994, vol. 41, issue 7, 973-989

Abstract: In many routing‐location models customers located at nodes of a network generate calls for service with known probabilities. The customers that request service in a particular day are served by a single server that performs a service tour visiting these customers. The order of providing service to customers for each potential list of calls is uniquely defined by some a priori fixed basic sequence of all the customers (a priori tour). The problems addressed in this article are to find an optimal home location or an optimal basic sequence for the server so as to minimize the expectation of a criterion. The following criteria are considered: the total waiting time of all the customers, the total length of the tour, the maximal waiting time of a customer, the average traveled length per customer, and the average waiting time per customer. We present polynomial‐time algorithms for the location problems. For the routing problems we present lower bounds that can be calculated efficiently (in polynomial time) and used in a branch‐and‐bound scheme. © 1994 John Wiley & Sons, Inc.

Date: 1994
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199412)41:73.0.CO;2-H

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:wly:navres:v:41:y:1994:i:7:p:973-989

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().