This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

The most representative composite rank ordering of multi-attribute objects by the particle swarm optimization

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Mishra, SK

Additional information is available for the following registered author(s):

Abstract

Rank-ordering of individuals or objects on multiple criteria has many important practical applications. A reasonably representative composite rank ordering of multi-attribute objects/individuals or multi-dimensional points is often obtained by the Principal Component Analysis, although much inferior but computationally convenient methods also are frequently used. However, such rank ordering – even the one based on the Principal Component Analysis – may not be optimal. This has been demonstrated by several numerical examples. To solve this problem, the Ordinal Principal Component Analysis was suggested some time back. However, this approach cannot deal with various types of alternative schemes of rank ordering, mainly due to its dependence on the method of solution by the constrained integer programming. In this paper we propose an alternative method of solution, namely by the Particle Swarm Optimization. A computer program in FORTRAN to solve the problem has also been provided. The suggested method is notably versatile and can take care of various schemes of rank ordering, norms and types or measures of correlation. The versatility of the method and its capability to obtain the most representative composite rank ordering of multi-attribute objects or multi-dimensional points have been demonstrated by several numerical examples. It has also been found that rank ordering based on maximization of the sum of absolute values of the correlation coefficients of composite rank scores with its constituent variables has robustness, but it may have multiple optimal solutions. Thus, while it solves the one problem, it gives rise to the other problem. The overall ranking of objects by maximin correlation principle performs better if the composite rank scores are obtained by direct optimization with respect to the individual ranking scores.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://mpra.ub.uni-muenchen.de/12723/
File Format:
File Function:
Download Restriction: no

Publisher Info
Paper provided by University Library of Munich, Germany in its series MPRA Paper with number 12723.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: 12 Jan 2009
Date of revision:
Handle: RePEc:pra:mprapa:12723

Contact details of provider:
Postal: Schackstr. 4, D-80539 Munich, Germany
Phone: +49-(0)89-2180-2219
Fax: +49-(0)89-2180-3900
Web page: http://mpra.ub.uni-muenchen.de
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Ekkehart Schlicht).

Related research
Keywords: Rank ordering; standard; modified; competition; fractional; dense; ordinal; principal component; integer programming; repulsive particle swarm; maximin; absolute; correlation; FORTRAN; program;

Find related papers by JEL classification:
C13 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: General - - - Estimation
C43 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Index Numbers and Aggregation
C63 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - Computational Techniques
C14 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: General - - - Semiparametric and Nonparametric Methods
C87 - Mathematical and Quantitative Methods - - Data Collection and Data Estimation Methodology; Computer Programs - - - Econometric Software
C45 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Neural Networks and Related Topics
C61 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - Optimization Techniques; Programming Models; Dynamic Analysis

This paper has been announced in the following NEP Reports:

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
  1. Korhonen, Pekka & Siljamaki, Aapo, 1998. "Ordinal principal component analysis theory and an application," Computational Statistics & Data Analysis, Elsevier, vol. 26(4), pages 411-424, February. [Downloadable!] (restricted)
Full references

Statistics
Access and download statistics

Did you know? IDEAS uses the data collected within the RePEc project, the largest online bibliographic database in Economics.

This page was last updated on 2009-11-26.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.