TY - JOUR

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

AU - Berman, Oded

AU - Handler, Gabriel Y.

PY - 1987

Y1 - 1987

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0023346629&partnerID=8YFLogxK

U2 - 10.1287/trsc.21.2.115

DO - 10.1287/trsc.21.2.115

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0023346629

SN - 0041-1655

VL - 21

SP - 115

EP - 122

JO - Transportation Science

JF - Transportation Science

IS - 2

ER -