IDEAS home Printed from https://ideas.repec.org/p/urb/wpaper/07_05.html
   My bibliography  Save this paper

Differential Evolution Methods for the Fuzzy Extension of Functions

Author

Listed:
  • Luciano Stefanini

    (Department of Economics, Università di Urbino "Carlo Bo")

Abstract

The paper illustrates a differential evolution (DE) algorithm to calculate the level-cuts of the fuzzy extension of a multidimensional real valued function to fuzzy numbers. The method decomposes the fuzzy extension engine into a set of "nested" min and max box-constrained op- timization problems and uses a form of the DE algorithm, based on multi populations which cooperate during the search phase and specialize, a part of the populations to find the the global min (corresponding to lower branch of the fuzzy extension) and a part of the populations to find the global max (corresponding to the upper branch), both gaining efficiency from the work done for a level-cut to the subsequent ones. A special ver- sion of the algorithm is designed to the case of differentiable functions, for which a representation of the fuzzy numbers is used to improve ef- ficiency and quality of calculations. The included computational results indicate that the DE method is a promising tool as its computational complexity grows on average superlinearly (of degree less than 1.5) in the number of variables of the function to be extended.

Suggested Citation

  • Luciano Stefanini, 2007. "Differential Evolution Methods for the Fuzzy Extension of Functions," Working Papers 0705, University of Urbino Carlo Bo, Department of Economics, Society & Politics - Scientific Committee - L. Stefanini & G. Travaglini, revised 2007.
    • Handle: RePEc:urb:wpaper:07_05
    as

    Download full text from publisher

    File URL: http://www.econ.uniurb.it/RePEc/urb/wpaper/WP_07_05.pdf
    File Function: First version, 2007
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    Fuzzy Sets; Differential Evolution Method; Fuzzy Extension of Functions;
    All these keywords.

    JEL classification:

    • C00 - Mathematical and Quantitative Methods - - General - - - General
    • C60 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - General
    • C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:urb:wpaper:07_05. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Carmela Nicoletti (email available below). General contact details of provider: https://edirc.repec.org/data/feurbit.html .

    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.