Ant colony system for optimization of sum of ratios problem

Yasuhiro Takenaka, Takashi Noda, Jianming Shi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationSoft Computing as Transdisciplinary Science and Technology - Proceedings of the 4th IEEE International Workshop, WSTST 2005
Pages1030-1039
Number of pages10
EditionAISC
Publication statusPublished - 1 Dec 2005
Event4th IEEE International Workshop on Soft Computing as Transdisciplinary Science and Technology, WSTST 2005 - Muroran, Japan
Duration: 25 May 200527 May 2005

Publication series

NameAdvances in Soft Computing
NumberAISC
ISSN (Print)1615-3871
ISSN (Electronic)1860-0794

Conference

Conference4th IEEE International Workshop on Soft Computing as Transdisciplinary Science and Technology, WSTST 2005
CountryJapan
CityMuroran
Period25/05/0527/05/05

    Fingerprint

Cite this

Takenaka, Y., Noda, T., & Shi, J. (2005). Ant colony system for optimization of sum of ratios problem. In Soft Computing as Transdisciplinary Science and Technology - Proceedings of the 4th IEEE International Workshop, WSTST 2005 (AISC ed., pp. 1030-1039). (Advances in Soft Computing; No. AISC).