Skip to main content

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

  • Conference paper
  • First Online:
Operations Research Proceedings 2012

Part of the book series: Operations Research Proceedings ((ORP))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Schaible, S., Shi, J.: Fractional programming: The sum-of-ratios case. Optim. Methods Softw. 18, 219–229 (2003)

    Article  Google Scholar 

  2. Kuno, T.: A branch-and-bound algorithm for maximizing the sum of several linear ratios. J. Glob. Optim. 22, 155–174 (2002)

    Article  Google Scholar 

  3. Benson, H.: A simplicial branch and bound duality-bounds algorithm for the linear sum of ratios problem. J. Optim. Theor. Appl. 112, 1–29 (2007)

    Article  Google Scholar 

  4. Costa, J.: A Branch & Cut technique to solve a weighted-sum of linear ratios. Pac. J. Optim. 6(1), 21–38 (2010)

    Google Scholar 

  5. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of the IEEE international joint conference on, neural networks, pp. 1942–1948 (1995)

    Google Scholar 

  6. Charnes, A., Cooper, W.: Programming with linear fractional functions. Naval Res. Logistics Q. 9, 181–186 (1962)

    Article  Google Scholar 

  7. Wu, W.-Y., Sheu, R.-L., Birbil, S.: Solving the sum-of-ratios problem by a stochastic search algorithm. J. Glob. Optim. 42, 91–109 (2008)

    Article  Google Scholar 

Download references

Acknowledgments

This work has been partially supported by FCT under project grant PEst-C/EEI/UI0308/2011 and by QREN, project EMSURE. We would also like to recognize the support of the “40th Anniversary of Faculty of Economics of University of Coimbra".

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to João Paulo Costa .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Costa, J.P., Alves, M.J. (2014). The Linear Sum-of-Ratios Optimization Problem: A PSO-Based Algorithm. In: Helber, S., et al. Operations Research Proceedings 2012. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-00795-3_7

Download citation

Publish with us

Policies and ethics