An evolutionary approach to preference disaggregation in a MURAME-based credit scoring problem
In this paper we use an evolutionary approach in order to infer the values of the parameters (weights of criteria, preference, indifference and veto thresholds) for developing the multicriteria method MURAME. According to the logic of preference disaggregation, the problem consists in finding the parameters that minimize the inconsistency between the model obtained with those parameters and that one connected with a given reference set of decisions revealed by the decision maker; in particular, two kinds of functions are considered in this analysis, representing a measure of the model inconsistency compared to the actual preferential system. In order to find a numerical solution of the mathematical programming problem involved, we adopt an evolutionary algorithm based on the Particle Swarm Optimization (PSO) method, which is an iterative heuristics grounded on swarm intelligence. The proposed approach is finally applied to a creditworthiness evaluation problem in order to test the methodology on a real data set provided by an Italian bank.
|Date of creation:||Apr 2012|
|Date of revision:|
|Contact details of provider:|| Postal: San Giobbe, Cannaregio 873, 30121 Venezia|
Phone: +39 0412348721
Fax: +39 0412348701
Web page: http://www.unive.it/dip.management
More information through EDIRC
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.:
- Nikos Thomaidis & Timotheos Angelidis & Vassilios Vassiliadis & Georgios Dounias, 2008.
"Active Portfolio Management With Cardinality Constraints: An Application Of Particle Swarm Optimization,"
0016, University of Peloponnese, Department of Economics.
- Nikos S. Thomaidis & Timotheos Angelidis & Vassilios Vassiliadis & Georgios Dounias, 2009. "Active Portfolio Management With Cardinality Constraints: An Application Of Particle Swarm Optimization," New Mathematics and Natural Computation (NMNC), World Scientific Publishing Co. Pte. Ltd., vol. 5(03), pages 535-555.
- Jacquet-Lagreze, Eric & Siskos, Yannis, 2001. "Preference disaggregation: 20 years of MCDA experience," European Journal of Operational Research, Elsevier, vol. 130(2), pages 233-245, April.
- Willard I. Zangwill, 1967. "Non-Linear Programming Via Penalty Functions," Management Science, INFORMS, vol. 13(5), pages 344-358, January.
- Marco Corazza & Stefania Funari & Federico Siviero, 2008. "An MCDA-based Approach for Creditworthiness Assessment," Working Papers 177, Department of Applied Mathematics, Università Ca' Foscari Venezia.
- Doumpos, Michael & Zopounidis, Constantin, 2011. "Preference disaggregation and statistical learning for multicriteria decision support: A review," European Journal of Operational Research, Elsevier, vol. 209(3), pages 203-214, March.
When requesting a correction, please mention this item's handle: RePEc:vnm:wpdman:18. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Marco LiCalzi)
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.