Skip to main content
SpringerLink
Log in

Ant Colony System for Optimization of Sum of Ratios Problem

  • Conference paper
Soft Computing as Transdisciplinary Science and Technology

Part of the book series: Advances in Soft Computing ((AINSC,volume 29))

  • 893 Accesses

Summary

Many applications arising from areas of economics, finance and engineering are cast into the sum-of-ratios problem. Usually, the problems are on such a large scale that the existing algorithms are naive yet to obtain an optimal solution of the problems. In this study we develop a heuristic algorithm to obtain such a better solution of the sum-of-ratios problem by means of Ant Colony System. The proposed algorithm can be used for designing a globally optimal algorithm with the help of some certain strategy of global search as well. We report numerical experiments of the heuristic algorithm, which indicates that the best function value obtained from our heuristic algorithm is empirically near to the optimal value with a high probability.

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

Access this chapter

Log in via an institution
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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Almogy Y and Levin O (1971) A class of fractional programming problems, Operations Research 19:57–67

    MATH  MathSciNet  Google Scholar 

  2. Benson HP (2002) Global optimization algorithm for the nonlinear sum of ratios problem, Journal of Optimization Theory and Applications 112:1–29

    Article  MATH  MathSciNet  Google Scholar 

  3. Benson HP (2001) Global optimization of nonlinear sums of ratios, Journal of Mathematical Analysis and Applications 263:301–315

    Article  MATH  MathSciNet  Google Scholar 

  4. Benson HP (2002) Using concave envelopes to globally solve the nonlinear sum of ratios problem, Journal of Global Optimization 22:343–364

    Article  MATH  MathSciNet  Google Scholar 

  5. Bullnheimer B, Hartl RF and Strauss C (1999) An improved ant system algorithm for the vehicle routing problem, Annals of Operations Research 89:319–328

    Article  MATH  MathSciNet  Google Scholar 

  6. Costa D and Hertz A (1997) Ants can colour graphs, Journal of the Operational Research Society 48:295–305

    Article  MATH  Google Scholar 

  7. Dinkelbach W (1967) On nonlinear fractional programming, Management Science 13:492–498

    Article  MathSciNet  Google Scholar 

  8. Dorigo M and Gambardella LM (1997) Ant colonies for the traveling salesman problem, BioSystems 43:73–81

    Article  Google Scholar 

  9. Dorigo M, Maniezzo V and Cambini AC (1996) Ant system: optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man and Cybernetics, Part B 26:29–41

    Article  Google Scholar 

  10. Falk JE and Palocsay SW (1992) Optimizing the sum of linear fractional functions, in Floudas CA, Pardalos PM (eds), Recent Advances in Global Optimization 221–258, Kluwer Academic Publishers, Dordrecht

    Google Scholar 

  11. Freund RW and Jarre F (2001) Solving the sum-of-ratios problem by an interiorpoint method, Journal of Global Optimization 19:83–102

    Article  MATH  MathSciNet  Google Scholar 

  12. Gambardella LM and Dorigo M (1997) HAS-SOP: a hybrid ant system for the sequential ordering problem, Technical Report No. IDSIA 97-11 IDSIA, Lugano, Switzerland

    Google Scholar 

  13. Korošec P, Šilc J and Robič B (2003) A multilevel ant-colony optimization algorithm for mesh partitioning, International Journal of Pure and Applied Mathematics 5:143–159

    MathSciNet  MATH  Google Scholar 

  14. Kuno T (2002) A branch-and-bound algorithm for maximizing the sum of several linear ratios, Journal of Global Optimization 22:155–174

    Article  MATH  MathSciNet  Google Scholar 

  15. Kuno T (2002) On deterministic algorithms for the sum-of-ratios problem, Private communication

    Google Scholar 

  16. Maniezzo V and Colorni A (1999) The Ant System Applied to the Quadratic Assignment Problem, IEEE Transactions on Knowledge and Data Engineering 11:769–778

    Article  Google Scholar 

  17. Schaible S (1978) Analyse und Anwendungen von Quotientenprogrammen, Ein Beitrag zur Planung mit Hilfe der nichtlinearen Programmierung, Mathematical Systems in Economics 42 Hain-Verlag, Meisenheim

    MATH  Google Scholar 

  18. Schaible S (1995) Fractional programming, in Horst R, Pardalos PM (eds), Handbook of Global Optimization, Kluwer Academic Publishers, Dordrecht, 495–608

    Google Scholar 

  19. Schaible S and Shi J (2003) Fractional programming: the sum-of-ratios case, Optimization Methods and Software 18:219–229

    Article  MATH  MathSciNet  Google Scholar 

  20. Tkindt V, Monmarche N, Tercinet F and Laügt D (2002) An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem, European Journal of Operational Research 142:250–257

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Systems Engineering, Muroran Institute of Technology, 27-1 Mizumoto-Chou, Muroran, Hokkaido, 0508585, Japan

    Yasuhiro Takenaka, Takashi Noda & Jianming Shi

Authors
  1. Yasuhiro Takenaka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Takashi Noda
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jianming Shi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science, Oklahoma State University, North Greenwood Avenue 700, 74106, Tulsa, USA

    Ajith Abraham

  2. Dept. of Computer Science and Systems Engineering, Muroran Institute of Technology, Mizumoto-cho 27-1, 050-8585, Muroran, Hokkaido, Japan

    Yasuhiko Dote

  3. Dept. of Computational Science and Engineering, Nagoya University, Furo-cho, Chikusa-ku, 464-8601, Nagoya, Aichi-ken, Japan

    Takeshi Furuhashi

  4. Institut für Sicherheits-/Prüftechnik, Fraunhofer IPK Berlin, Pascalstr. 8-9, 10587, Berlin, Germany

    Mario Köppen

  5. Division of Complex Systems Technology Graduate School of Engineering, University of Hokkaido, N-13, W-8 060 KITA-KU, Sapporo, Japan

    Azuma Ohuchi

  6. PRESTO Japan Science & Technology Corp. GSSM, University of Tsukuba, 3-29-1 Otsuka, Bunkyo-ku, 12-0012, Tokyo, Japan

    Yukio Ohsawa

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Takenaka, Y., Noda, T., Shi, J. (2005). Ant Colony System for Optimization of Sum of Ratios Problem. In: Abraham, A., Dote, Y., Furuhashi, T., Köppen, M., Ohuchi, A., Ohsawa, Y. (eds) Soft Computing as Transdisciplinary Science and Technology. Advances in Soft Computing, vol 29. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32391-0_106

Download citation

  • DOI: https://doi.org/10.1007/3-540-32391-0_106

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25055-5

  • Online ISBN: 978-3-540-32391-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation