Optimal Minimax Path of a Single Service Unit on a Network to Nonservice Destinations

Oded Berman and Gabriel Y. Handler
Additional contact information
Oded Berman: College of Management, The University of Massachusetts, Boston, Massachusetts, and The University of Calgary, Calgary, Alberta, Canada
Gabriel Y. Handler: Tel-Aviv University, Ramat-Aviv, Tel-Aviv, Israel

Transportation Science, 1987, vol. 21, issue 2, 115-122

Abstract: In this paper we consider the problem of finding an optimal path of a single service unit that travels toward a “nonservice” destination. Two types of objective functions are examined. One objective function is the minimization of the maximum distance (or weighted distance) between the moving service unit and any demand (node) of the network. The second objective function is the minimization of the total time period that the distance (or weighted distance) between the moving service unit and any node exceeds a response time threshold (lambda). For these two objective functions, we present algorithms which can be calculated, respectively, in 0( n 3 ) and 0( n 3 log n ) elementary operations.

Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.21.2.115 (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:21:y:1987:i:2:p:115-122

Access Statistics for this article

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