IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v57y2006i6d10.1057_palgrave.jors.2602047.html
   My bibliography  Save this article

A multi-objective heuristic approach for the casualty collection points location problem

Author

Listed:
  • T Drezner

    (California State University-Fullerton)

  • Z Drezner

    (California State University-Fullerton)

  • S Salhi

    (The University of Kent)

Abstract

In this paper, we formulate the casualty collection points (CCPs) location problem as a multi-objective model. We propose a minimax regret multi-objective (MRMO) formulation that follows the idea of the minimax regret concept in decision analysis. The proposed multi-objective model is to minimize the maximum per cent deviation of individual objectives from their best possible objective function value. This new multi-objective formulation can be used in other multi-objective models as well. Our specific CCP model consists of five objectives. A descent heuristic and a tabu search procedure are proposed for its solution. The procedure is illustrated on Orange County, California.

Suggested Citation

  • T Drezner & Z Drezner & S Salhi, 2006. "A multi-objective heuristic approach for the casualty collection points location problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(6), pages 727-734, June.
    • Handle: RePEc:pal:jorsoc:v:57:y:2006:i:6:d:10.1057_palgrave.jors.2602047
    DOI: 10.1057/palgrave.jors.2602047
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2602047
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2602047?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Tammy Drezner, 2004. "Location of Casualty Collection Points," Environment and Planning C, , vol. 22(6), pages 899-912, December.
    2. S. L. Hakimi, 1965. "Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems," Operations Research, INFORMS, vol. 13(3), pages 462-475, June.
    3. Richard E. Wendell & Arthur P. Hurter, 1973. "Location Theory, Dominance, and Convexity," Operations Research, INFORMS, vol. 21(1), pages 314-320, February.
    4. Michael B. Teitz & Polly Bart, 1968. "Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph," Operations Research, INFORMS, vol. 16(5), pages 955-961, October.
    5. S. L. Hakimi, 1964. "Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph," Operations Research, INFORMS, vol. 12(3), pages 450-459, June.
    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. Alizadeh, Morteza & Amiri-Aref, Mehdi & Mustafee, Navonil & Matilal, Sumohon, 2019. "A robust stochastic Casualty Collection Points location problem," European Journal of Operational Research, Elsevier, vol. 279(3), pages 965-983.
    2. Tammy Drezner & Zvi Drezner & Pawel Kalczynski, 2021. "Directional approach to gradual cover: the continuous case," Computational Management Science, Springer, vol. 18(1), pages 25-47, January.
    3. Aakil M. Caunhye & Xiaofeng Nie, 2018. "A Stochastic Programming Model for Casualty Response Planning During Catastrophic Health Events," Transportation Science, INFORMS, vol. 52(2), pages 437-453, March.
    4. Chang, Kuo-Hao & Chen, Tzu-Li & Yang, Fu-Hao & Chang, Tzu-Yin, 2023. "Simulation optimization for stochastic casualty collection point location and resource allocation problem in a mass casualty incident," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1237-1262.
    5. Chandra Ade Irawan & Martino Luis & Said Salhi & Arif Imran, 2019. "The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem," Annals of Operations Research, Springer, vol. 275(2), pages 367-392, April.
    6. Barbati, Maria & Greco, Salvatore & Kadziński, Miłosz & Słowiński, Roman, 2018. "Optimization of multiple satisfaction levels in portfolio decision analysis," Omega, Elsevier, vol. 78(C), pages 192-204.
    7. Maria Barbati & Giuseppe Bruno & Alfredo Marín, 2016. "Balancing the arrival times of users in a two-stage location problem," Annals of Operations Research, Springer, vol. 246(1), pages 273-288, November.
    8. Caunhye, Aakil M. & Li, Mingzhe & Nie, Xiaofeng, 2015. "A location-allocation model for casualty response planning during catastrophic radiological incidents," Socio-Economic Planning Sciences, Elsevier, vol. 50(C), pages 32-44.
    9. Liu, Yang & Cui, Na & Zhang, Jianghua, 2019. "Integrated temporary facility location and casualty allocation planning for post-disaster humanitarian medical service," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 128(C), pages 1-16.
    10. Groetzner, Patrick & Werner, Ralf, 2022. "Multiobjective optimization under uncertainty: A multiobjective robust (relative) regret approach," European Journal of Operational Research, Elsevier, vol. 296(1), pages 101-115.
    11. Tammy Drezner & Zvi Drezner & Pawel Kalczynski, 2019. "A directional approach to gradual cover," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(1), pages 70-93, April.
    12. Barbati, Maria & Corrente, Salvatore & Greco, Salvatore, 2020. "A general space-time model for combinatorial optimization problems (and not only)," Omega, Elsevier, vol. 96(C).
    13. Tammy Drezner & Zvi Drezner & Pawel Kalczynski, 2020. "Directional approach to gradual cover: a maximin objective," Computational Management Science, Springer, vol. 17(1), pages 121-139, January.

    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. Rolland, Erik & Schilling, David A. & Current, John R., 1997. "An efficient tabu search procedure for the p-Median Problem," European Journal of Operational Research, Elsevier, vol. 96(2), pages 329-342, January.
    2. Canos, M. J. & Ivorra, C. & Liern, V., 1999. "An exact algorithm for the fuzzy p-median problem," European Journal of Operational Research, Elsevier, vol. 116(1), pages 80-86, July.
    3. Vladimir Marianov & Daniel Serra, 2009. "Median problems in networks," Economics Working Papers 1151, Department of Economics and Business, Universitat Pompeu Fabra.
    4. Mark S. Daskin, 2008. "What you should know about location modeling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(4), pages 283-294, June.
    5. K.E. Rosing & C.S. ReVelle, 1997. "Heuristic Concentration and Tabu Search: A Nose to Nose Comparison," Tinbergen Institute Discussion Papers 97-058/3, Tinbergen Institute.
    6. Bell, Michael G.H. & Fonzone, Achille & Polyzoni, Chrisanthi, 2014. "Depot location in degradable transport networks," Transportation Research Part B: Methodological, Elsevier, vol. 66(C), pages 148-161.
    7. Ningchuan Xiao, 2012. "A Parallel Cooperative Hybridization Approach to the p-Median Problem," Environment and Planning B, , vol. 39(4), pages 755-774, August.
    8. Michael Brusco & J Dennis Cradit & Douglas Steinley, 2021. "A comparison of 71 binary similarity coefficients: The effect of base rates," PLOS ONE, Public Library of Science, vol. 16(4), pages 1-19, April.
    9. Schilling, D. A. & Rosing, K. E. & ReVelle, C. S., 2000. "Network distance characteristics that affect computational effort in p-median location problems," European Journal of Operational Research, Elsevier, vol. 127(3), pages 525-536, December.
    10. 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.
    11. Rosing, K. E. & ReVelle, C. S. & Rolland, E. & Schilling, D. A. & Current, J. R., 1998. "Heuristic concentration and Tabu search: A head to head comparison," European Journal of Operational Research, Elsevier, vol. 104(1), pages 93-99, January.
    12. H K Smith & G Laporte & P R Harper, 2009. "Locational analysis: highlights of growth to maturity," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 140-148, May.
    13. Hribar, Michelle & Daskin, Mark S., 1997. "A dynamic programming heuristic for the P-median problem," European Journal of Operational Research, Elsevier, vol. 101(3), pages 499-508, September.
    14. Daniel Serra & Vladimir Marianov, 1996. "The P-median problem in a changing network: The case of Barcelona," Economics Working Papers 180, Department of Economics and Business, Universitat Pompeu Fabra.
    15. ReVelle, C.S. & Eiselt, H.A. & Daskin, M.S., 2008. "A bibliography for some fundamental problem categories in discrete location science," European Journal of Operational Research, Elsevier, vol. 184(3), pages 817-848, February.
    16. Drezner, Tammy & Drezner, Zvi, 2007. "The gravity p-median model," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1239-1251, June.
    17. Rosing, K. E. & ReVelle, C. S., 1997. "Heuristic concentration: Two stage solution construction," European Journal of Operational Research, Elsevier, vol. 97(1), pages 75-86, February.
    18. Antiopi Panteli & Basilis Boutsinas & Ioannis Giannikos, 2021. "On solving the multiple p-median problem based on biclustering," Operational Research, Springer, vol. 21(1), pages 775-799, March.
    19. Daoqin Tong & Alan T. Murray, 2009. "Maximising coverage of spatial demand for service," Papers in Regional Science, Wiley Blackwell, vol. 88(1), pages 85-97, March.
    20. Zhizhu Lai & Qun Yue & Zheng Wang & Dongmei Ge & Yulong Chen & Zhihong Zhou, 2022. "The min-p robust optimization approach for facility location problem under uncertainty," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1134-1160, September.

    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:pal:jorsoc:v:57:y:2006:i:6:d:10.1057_palgrave.jors.2602047. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.