Skip to main content
Log in

A dynamic clustering method to improve the coherency of an ANP Supermatrix

  • Original Paper
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

When making decisions with the Analytic Network Process, coherency testing is an important step in the decision making process. Once an incoherent priority vector is identified it can either be costly or in some cases next to impossible to elicit new pairwise comparisons. Remarkably, there is useful information in the linking estimates that one may have already calculated and used in one of the approaches to measure the coherency of the Supermatrix. A dynamic clustering method is used to automatically identify a cluster of coherent linking estimates from which a new coherent priority vector can be calculated and used to replace the most incoherent priority vector. The decision maker can then accept or revise the proposed new and coherent priority vector. This process is repeated until the entire Supermatrix is coherent. This method can save decision makers valuable time and effort by using the information and relationships that already exist in a weighted Supermatrix that is sufficiently coherent. The method is initially motivated and demonstrated through a simple straightforward example. A group of conceptual charts and a figure provide a visual motivation and explanation of the method. A high level summary of the method is provided in a table before the method is presented in detail. Simulations demonstrate both the application and the robustness of the proposed method. Code is provided, as supplementary material, in the programming language R so the method can be easily applied by the decision maker.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

References

  • Aguarón, J., Escobar, M. T., & Moreno-Jiménez, J. M. (2016). The precise consistency consensus matrix in a local AHP-group decision making context. Annals of Operations Research, 245(1–2), 245–259.

  • Brunelli, M., Canal, L., & Fedrizzi, M. (2013). Inconsistency indices for pairwise comparison matrices: A numerical study. Annals of Operations Research, 211(1), 493–509.

    Article  Google Scholar 

  • Chen, K., Kou, G., Tarn, J. M., & Song, Y. (2015). Bridging the gap between missing and inconsistent values in eliciting preference from pairwise comparison matrices. Annals of Operations Research, 235(1), 155–175.

  • Cooper, O., & Yavuz, I. (2016). Linking validation: A search for coherency within the supermatrix. European Journal of Operational Research, 252(1), 232–245.

    Article  Google Scholar 

  • Hastings, A., & Gross, L. J. (2012). Encyclopedia of theoretical ecology (4th ed.). California: University of California Press.

    Google Scholar 

  • Ho, H. F., & Hung, C. C. (2008). Marketing mix formulation for higher education: An integrated analysis employing analytic hierarchy process, cluster analysis and correspondence analysis. International Journal of Educational Management, 22(4), 328–340.

    Google Scholar 

  • Jain, A. K. (2010). Data clustering: 50 years beyond k-means. Pattern Recognition Letters, 31(8), 651–666.

    Article  Google Scholar 

  • Kou, G., & Lou, C. (2012). Multiple factor hierarchical clustering algorithm for large scale web page and search engine clickstream data. Annals of Operations Research, 197(1), 123–134.

    Article  Google Scholar 

  • Kwiesielewicz, M., & Van Uden, E. (2004). Inconsistent and contradictory judgements in pairwise comparison method in the ahp. Computers & Operations Research, 31(5), 713–719.

    Article  Google Scholar 

  • Lee, H., Shi, Y., & Nazem, S. M. (1996). Supporting rural telecommunications: A compromise solutions approach. Annals of Operations Research, 68(1), 33–45.

    Article  Google Scholar 

  • Lin, C., Kou, G., & Ergu, D. (2013). An improved statistical approach for consistency test in ahp. Annals of Operations Research, 211(1), 289–299.

    Article  Google Scholar 

  • Liu, D. R., & Shih, Y. Y. (2005). Integrating ahp and data mining for product recommendation based on customer lifetime value. Information & Management, 42(3), 387–400.

    Article  Google Scholar 

  • López-Ortega, O., & Rosales, M. A. (2011). An agent-oriented decision support system combining fuzzy clustering and the ahp. Expert Systems with Applications, 38(7), 8275–8284.

    Article  Google Scholar 

  • Pereira, V., & Costa, H. G. (2014). Nonlinear programming applied to the reduction of inconsistency in the ahp method. Annals of Operations Research, 229(1), 635–655.

    Article  Google Scholar 

  • Popat, S. K., & Emmanuel, M. (2014). Review and comparative study of clustering techniques. International Journal of Computer Science and Information Technologies, 5(1), 805–812.

    Google Scholar 

  • Saaty, T. L. (1977). A scaling method for priorities in hierarchical structures. Journal of Mathematical Psychology, 15(3), 234–281.

    Article  Google Scholar 

  • Saaty, T. L. (1980). The analytic hierarchy process: Planning, priority setting, resources allocation. New York: McGraw-Hill.

    Google Scholar 

  • Saaty, T. L. (1994). How to make a decision: The analytic hierarchy process. Interfaces, 24(6), 19–43.

    Article  Google Scholar 

  • Saaty, T. L. (2005). Theory and applications of the analytic network process: Decision making with benefits, opportunities, costs, and risks. Pittsburgh: RWS Publications.

    Google Scholar 

  • Schoner, B., Wedley, W. C., & Choo, E. U. (1993). A unified approach to AHP with linking pins. European Journal of Operational Research, 64(3), 384–392.

    Article  Google Scholar 

  • Vargas, L. G. (1982). Reciprocal matrices with random coefficients. Mathematical Modelling, 3(1), 69–81.

    Article  Google Scholar 

  • Vim, I. (2004). International vocabulary of basic and general terms in metrology (VIM). International Organization, 2004, 09–14.

    Google Scholar 

  • Wedley, W. C., & Choo, E. U. (2001). A unit interpretation of multi-criteria ratios. In Proceedings of the sixth international symposium on the analytic hierarchy process, Berne, Switzerland (pp. 561–569).

  • Xia, M., Chen, J., & Zhang, J. (2015). Multi-criteria decision making based on relative measures. Annals of Operations Research, 229(1), 791–811.

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported in full or in part by a grant from the Fogelman College of Business and Economics at the University of Memphis. This research support does not imply endorsement of the research results by either the Fogelman College or the University of Memphis.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Idil Yavuz.

Electronic supplementary material

Below is the link to the electronic supplementary material.

Supplementary material 1 (zip 9 KB)

Appendix

Appendix

1.1 Calculating the linking estimates (LE)

Let the initial estimated Supermatrix be:

(12)

Every column of the Supermatrix should be converted to a new ratio by dividing the components of each vector by any common element within the priority vectors; the first element in each priority vector will be used herein. The resulting matrix will now have the form:

(13)

If the entries from one column in the lower hand side of the estimated Supermatrix in (13) are used as the links to convert the entries in the upper right hand side of the Supermatrix into quantities of a single unit, the converted upper right hand side will have the form:

(14)

With each entry in each column now represented in units of a particular, yet same, ratio as in (14) they can be aggregated and combined obtain a new estimate of S which we call a linking estimate. This new Supermatrix will be notated by \(S^L_{C_{1.1}}\) since the criterion \(C_{1.1}\) was used as the link. This estimate can be obtained by performing the following calculations:

(15)

where \(T_{i.j,.}=\sum _{n=1}^3 T_{i.j,n} \) and \(T_{..,n}=\sum _{i=1}^2 \sum _{j=1}^3 T_{i.j,n}\).

The same process can be repeated \(n+m\) times where n is the number of alternatives and m is the number of criteria; a different criterion or alternative is chosen as the link each time, resulting in \(n+m\) linking estimates. For detailed explanations about this concept please refer to Cooper and Yavuz (2016).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yavuz, I., Cooper, O. A dynamic clustering method to improve the coherency of an ANP Supermatrix. Ann Oper Res 254, 507–531 (2017). https://doi.org/10.1007/s10479-017-2403-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-017-2403-9

Keywords

Navigation