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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Church RL and ReVelle C (1974). The maximal covering location problem. Papers of the Regional Science Association 32: 101–118.
Current J, Daskin M and Schilling D (2002). Discrete network location models. In: Drezner Z and Hamacher HW (eds). Facility Location: Applications and Theory. Springer, Berlin.
Daskin M (1995). Network and Discrete Location: Models, Algorithms and Applications. John Wiley: New York.
Drezner T (2004). Location of casualty collection points. Environ Planning C 22: 899–912.
Glover F, Taillard E and deWerra D (1993). A user's guide to tabu search. Ann Opns Res 41: 3–28.
Hakimi SL (1964). Optimal location of switching centers and the absolute centers and medians of a graph. Opns Res 12: 450–459.
Hakimi SL (1965). Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Opns Res 13: 462–475.
Hwang CL and Yoon KP (1981). Multiple Attribute Decision Making. Springer: Berlin.
Maimon O (1986). The variance equity measure in locational decision theory. Ann Opns Res 6: 147–160.
Romero C (1991). Handbook of Critical Issues in Goal Programming. Pergamon Press: Oxford.
Steuer RE (1986). Multiple Criteria Optimization: Theory, Computation and Application. Wiley: NY.
Taillard E (1991). Robust taboo search for the quadratic assignment problem. Parallel comput 17: 443–455.
Teitz MB and Bart P (1968). Heuristic methods for estimating the generalized vertex median of a weighted graph. Opns Res 16: 955–961.
Würker U (1993). The method of feasible directions for minimax problems in multicriteria optimization. In: Brosowski B et al. (eds). Multicriteria Decisions. Peter Lang Publishers, Frankfurt, Germany, pp 179–188.
Wendell RE and Hurter AP (1973). Location theory, dominance and convexity. Opns Res 21: 314–320.
Yoon KP and Hwang CL (1995). Multiple Attribute Decision Making: An Introduction. Sage University Paper Series on Quantitative Applications in the Social Sciences. Sage Publications: Thousand Oaks, CA, pp 97–104.
Zeleny M (1973). Compromise programming. In: Cochrane JL and Zeleny M (eds). Multiple Criteria Decision Making. University of South Carolina, Columbia, pp 262–301.
Zeleny M (1977). Adaptive displacement of references in decision making! In: Starr MK and Zeleny M (eds). Multiple Criteria Decision Making, Studies in the Management Sciences 6. North Holland Publishers, Amsterdam, pp 147–157.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Drezner, T., Drezner, Z. & Salhi, S. A multi-objective heuristic approach for the casualty collection points location problem. J Oper Res Soc 57, 727–734 (2006). https://doi.org/10.1057/palgrave.jors.2602047
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/palgrave.jors.2602047