IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v21y1987i2p115-122.html
   My bibliography  Save this article

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

Author

Listed:
  • 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)

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.

Suggested Citation

  • Oded Berman & Gabriel Y. Handler, 1987. "Optimal Minimax Path of a Single Service Unit on a Network to Nonservice Destinations," Transportation Science, INFORMS, vol. 21(2), pages 115-122, May.
    • Handle: RePEc:inm:ortrsc:v:21:y:1987:i:2:p:115-122
    DOI: 10.1287/trsc.21.2.115
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.21.2.115
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.21.2.115?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Tayyebi, Javad & Mitra, Ankan & Sefair, Jorge A., 2023. "The continuous maximum capacity path interdiction problem," European Journal of Operational Research, Elsevier, vol. 305(1), pages 38-52.
    2. Elena Fernandez & Robert Garfinkel & Roman Arbiol, 1998. "Mosaicking of Aerial Photographic Maps Via Seams Defined by Bottleneck Shortest Paths," Operations Research, INFORMS, vol. 46(3), pages 293-304, June.
    3. Mesa, Juan A. & Brian Boffey, T., 1996. "A review of extensive facility location in networks," European Journal of Operational Research, Elsevier, vol. 95(3), pages 592-603, December.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:21:y:1987:i:2:p:115-122. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.