Solving the sum-of-ratios problems by a harmony search algorithm
From MaRDI portal
Publication:966084
DOI10.1016/j.cam.2010.01.013zbMath1188.65080OpenAlexW2026108436MaRDI QIDQ966084
Esmaile Khorram, Majid Jaberipour
Publication date: 27 April 2010
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2010.01.013
Numerical mathematical programming methods (65K05) Fractional programming (90C32) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (11)
A practicable branch and bound algorithm for sum of linear ratios problem ⋮ Global optimization algorithm for sum of generalized polynomial ratios problem ⋮ Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm ⋮ GHS + LEM: Global-best harmony search using learnable evolution models ⋮ A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems ⋮ A new fuzzy harmony search algorithm using fuzzy logic for dynamic parameter adaptation ⋮ Range division and compression algorithm for quadratically constrained sum of quadratic ratios ⋮ Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem ⋮ An elite decision making harmony search algorithm for optimization problem ⋮ Optimization of chance constraint programming with sum-of-fractional objectives â an application to assembled printed circuit board problem ⋮ Improved parallel chaos optimization algorithm
Cites Work
- An improved harmony search algorithm for solving optimization problems
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- Using concave envelopes to globally solve the nonlinear sum of ratios problem
- Solving the sum-of-ratios problem by a stochastic search algorithm
- Solving sum of quadratic ratios fractional programs via monotonic function
- A unified monotonic approach to generalized linear fractional programming
- Minimization of the sum of three linear fractional functions
- Solving the sum-of-ratios problem by an interior-point method
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
- Solving fractional problems with dynamic multistart improving hit-and-run
- Global optimization for sum of generalized fractional functions
- A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice
- Solving sum-of-ratios fractional programs using efficient points
- Fractional programming: The sum-of-ratios case
- On Maximizing a Sum of Ratios
- Programming with linear fractional functionals
- Global optimization algorithm for the nonlinear sum of ratios problem
This page was built for publication: Solving the sum-of-ratios problems by a harmony search algorithm
