Solving the sum-of-ratios problems by a harmony search algorithm

摘要

The sum-of-ratios problems have numerous applications in economy and engineering. The sum-of-ratios problems are considered to be difficult, as these functions are highly nonconvex and multimodal. In this study, we propose a harmony search algorithm for solving a sum-of-ratios problem. Numerical examples are also presented to demonstrate the effectiveness and robustness of the proposed method. In all cases, the solutions obtained using this method are superior to those obtained from other methods.