IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-00795-3_7.html
   My bibliography  Save this book chapter

The Linear Sum-of-Ratios Optimization Problem: A PSO-Based Algorithm

In: Operations Research Proceedings 2012

Author

Listed:
  • João Paulo Costa

    (Faculty of Economics University of Coimbra—INESC Coimbra)

  • Maria João Alves

    (Faculty of Economics University of Coimbra—INESC Coimbra)

Abstract

Problems modeled as a sum-of-ratios arise naturally when several rates (objectives) have to be optimized simultaneously. The linear sum-of-ratios problem is also used for computing nondominated solutions in multiobjective linear fractional programming problems when the weighted-sum is applied to the objective functions. We previously developed a Branch & Cut algorithm for computing solutions, considering a pre-defined error, for this kind of problems. The algorithm has a good performance for problems of medium dimensions (less than roughly ten ratios), even considering a very small pre-defined error. In this text we propose a combination of particle swarm optimization (PSO) techniques with the Branch & Cut algorithm in order to improve the performance of the computations for problems of higher dimensions. We present computational results for problems with up to twenty five ratios.

Suggested Citation

  • João Paulo Costa & Maria João Alves, 2014. "The Linear Sum-of-Ratios Optimization Problem: A PSO-Based Algorithm," Operations Research Proceedings, in: Stefan Helber & Michael Breitner & Daniel Rösch & Cornelia Schön & Johann-Matthias Graf von der Schu (ed.), Operations Research Proceedings 2012, edition 127, pages 43-48, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-00795-3_7
    DOI: 10.1007/978-3-319-00795-3_7
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:oprchp:978-3-319-00795-3_7. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.