OPTIMAL MINIMAX PATH OF A SINGLE SERVICE UNIT ON A NETWORK TO NONSERVICE DESTINATIONS.

Oded Berman*, Gabriel Y. Handler

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

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**3log n) elementary operations.

Original languageEnglish
Pages (from-to)115-122
Number of pages8
JournalTransportation Science
Volume21
Issue number2
DOIs
StatePublished - 1987
Externally publishedYes

Fingerprint

Dive into the research topics of 'OPTIMAL MINIMAX PATH OF A SINGLE SERVICE UNIT ON A NETWORK TO NONSERVICE DESTINATIONS.'. Together they form a unique fingerprint.

Cite this