IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v46y1998i1p155-156.html
   My bibliography  Save this article

A Note on the Optimal Positioning of Service Units

Author

Listed:
  • E. Carrizosa

    (Universidad de Sevilla, Sevilla, Spain)

  • M. Muñoz-Márquez

    (Universidad de Cádit, Cádit, Spain)

  • J. Puerto

    (Universidad de Sevilla, Sevilla, Spain)

Abstract

In this paper we address the problem of locating p mobile service units in an n -dimensional space minimizing the expected response time. It is shown that an optimal solution to the problem is a degenerate distribution for the service, concluding that it is optimal to park the p units. This extends previous results in the literature for location on a segment.

Suggested Citation

  • E. Carrizosa & M. Muñoz-Márquez & J. Puerto, 1998. "A Note on the Optimal Positioning of Service Units," Operations Research, INFORMS, vol. 46(1), pages 155-156, February.
    • Handle: RePEc:inm:oropre:v:46:y:1998:i:1:p:155-156
    DOI: 10.1287/opre.46.1.155
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.46.1.155
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.46.1.155?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
    ---><---

    References listed on IDEAS

    as
    1. Rosing, K. E., 1992. "An optimal method for solving the (generalized) multi-Weber problem," European Journal of Operational Research, Elsevier, vol. 58(3), pages 414-426, May.
    2. Larry R. Anderson & Robert A. Fontenot, 1992. "Optimal Positioning of Service Units Along a Coordinate Line," Transportation Science, INFORMS, vol. 26(4), pages 346-351, November.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Yılmaz, Seren Bilge & Yücel, Eda, 2021. "Optimizing onboard catering loading locations and plans for airlines," Omega, Elsevier, vol. 99(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Carrizosa, Emilio & Rodriguez-Chia, Antonio M., 1997. "Weber problems with alternative transportation systems," European Journal of Operational Research, Elsevier, vol. 97(1), pages 87-93, February.
    2. Zvi Drezner & Said Salhi, 2017. "Incorporating neighborhood reduction for the solution of the planar p-median problem," Annals of Operations Research, Springer, vol. 258(2), pages 639-654, November.
    3. Azcuy, Irecis & Agatz, Niels & Giesen, Ricardo, 2021. "Designing integrated urban delivery systems using public transport," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 156(C).
    4. Blanco, Víctor & Gázquez, Ricardo & Ponce, Diego & Puerto, Justo, 2023. "A branch-and-price approach for the continuous multifacility monotone ordered median problem," European Journal of Operational Research, Elsevier, vol. 306(1), pages 105-126.
    5. Bischoff, Martin & Dächert, Kerstin, 2009. "Allocation search methods for a generalized class of location-allocation problems," European Journal of Operational Research, Elsevier, vol. 192(3), pages 793-807, February.
    6. Brimberg, Jack & Drezner, Zvi & Mladenović, Nenad & Salhi, Said, 2014. "A new local search for continuous location problems," European Journal of Operational Research, Elsevier, vol. 232(2), pages 256-265.
    7. Yao, Zhishuang & Lee, Loo Hay & Jaruphongsa, Wikrom & Tan, Vicky & Hui, Chen Fei, 2010. "Multi-source facility location-allocation and inventory problem," European Journal of Operational Research, Elsevier, vol. 207(2), pages 750-762, December.
    8. Pey-Chun Chen & Pierre Hansen & Brigitte Jaumard & Hoang Tuy, 1998. "Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming," Operations Research, INFORMS, vol. 46(4), pages 548-562, August.
    9. Liu, Yanchao, 2023. "An elliptical cover problem in drone delivery network design and its solution algorithms," European Journal of Operational Research, Elsevier, vol. 304(3), pages 912-925.
    10. Vickson, R. G. & Lu, Xinjian, 1998. "Optimal product and server locations in one-dimensional storage racks," European Journal of Operational Research, Elsevier, vol. 105(1), pages 18-28, February.
    11. N Aras & K C Özkısacık & İ K Altınel, 2006. "Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(1), pages 82-93, January.
    12. Hall, Randolph W., 2002. "Incident dispatching, clearance and delay," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(1), pages 1-16, January.
    13. Venkateshan, Prahalad & Ballou, Ronald H. & Mathur, Kamlesh & Maruthasalam, Arulanantha P.P., 2017. "A Two-echelon joint continuous-discrete location model," European Journal of Operational Research, Elsevier, vol. 262(3), pages 1028-1039.
    14. Jack Brimberg & Pierre Hansen & Nenad Mladenović & Eric D. Taillard, 2000. "Improvements and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem," Operations Research, INFORMS, vol. 48(3), pages 444-460, June.
    15. Zvi Drezner & Jack Brimberg & Nenad Mladenović & Said Salhi, 2016. "New local searches for solving the multi-source Weber problem," Annals of Operations Research, Springer, vol. 246(1), pages 181-203, November.
    16. Parlar, Mahmut & Sharafali, Moosa & Ou, Jihong, 2006. "Optimal parking of idle elevators under myopic and state-dependent policies," European Journal of Operational Research, Elsevier, vol. 170(3), pages 863-886, May.
    17. ReVelle, C. S. & Eiselt, H. A., 2005. "Location analysis: A synthesis and survey," European Journal of Operational Research, Elsevier, vol. 165(1), pages 1-19, August.
    18. Prahalad Venkateshan & Kamlesh Mathur, 2015. "A Heuristic for the Multisource Weber Problem with Service Level Constraints," Transportation Science, INFORMS, vol. 49(3), pages 472-483, August.
    19. Abdolsalam Ghaderi & Mohammad Jabalameli & Farnaz Barzinpour & Ragheb Rahmaniani, 2012. "An Efficient Hybrid Particle Swarm Optimization Algorithm for Solving the Uncapacitated Continuous Location-Allocation Problem," Networks and Spatial Economics, Springer, vol. 12(3), pages 421-439, September.
    20. Jiang, Jian-Lin & Yuan, Xiao-Ming, 2008. "A heuristic algorithm for constrained multi-source Weber problem - The variational inequality approach," European Journal of Operational Research, Elsevier, vol. 187(2), pages 357-370, June.

    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:oropre:v:46:y:1998:i:1:p:155-156. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.