IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v73y2022i4p779-793.html
   My bibliography  Save this article

Ranking ranges in cross-efficiency evaluations: A metaheuristic approach

Author

Listed:
  • J. Alcaraz
  • J. F. Monge
  • N. Ramón

Abstract

In the cross-efficiency evaluation, the existence of alternative optima for weights represents an inconvenience because the ranking obtained depends on the weights used. Alcaraz et al. (2013) design an algorithm that provides a range of positions for each unit, taking into account the entire spectrum of feasible weights that configure the optimal alternative solutions in DEA evaluation. This procedure involves nonlinear models that are solved using parametric mixed-integer non-linear programming problems that can become very complex and laborious and often makes it difficult to obtain the optimum. In this paper, ranking range is approached using metaheuristic techniques which, when well designed, are able to achieve good approximations and they are the preferred alternative when exact techniques require excessive computational effort or they are not able to provide an optimal solution. Some examples widely used in the context of cross-evaluation are used to verify the suitability of the proposed method.

Suggested Citation

  • J. Alcaraz & J. F. Monge & N. Ramón, 2022. "Ranking ranges in cross-efficiency evaluations: A metaheuristic approach," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 73(4), pages 779-793, March.
  • Handle: RePEc:taf:tjorxx:v:73:y:2022:i:4:p:779-793
    DOI: 10.1080/01605682.2020.1860662
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2020.1860662
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/01605682.2020.1860662?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    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:taf:tjorxx:v:73:y:2022:i:4:p:779-793. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.