Many optimization problems in various fields have been solved using diverse optimization al gorithms. Traditional optimization techniques such as linear programming (LP), non-linear programming (NLP), and dynamic program ming (DP) have had major roles in solving these problems. However, their drawbacks generate demand for other types of algorithms, such as heuristic optimization approaches (simulated annealing, tabu search, and evolutionary algo rithms). However, there are still some possibili ties of devising new heuristic algorithms based on analogies with natural or artificial phenom ena. A new heuristic algorithm, mimicking the improvisation of music players, has been devel oped and named Harmony Search (HS). The performance of the algorithm is illustrated with a traveling salesman problem (TSP), a specific academic optimization problem, and a least-cost pipe network design problem.

A newly developed heuristic algorithm, Harmony Search, is applied to the parameter estimation problem of the nonlinear Muskingum model. Harmony Search found better values of parameters in the nonlinear Muskingum model than five other methods including another heuristic method, genetic algorithm, in terms of SSQ (the sum of the square of the deviations between the observed and routed outflows), SAD (the sum of the absolute value of the deviations between the observed and routed outflows), DPO (deviations of peak of routed and actual flows), and DPOT (deviations of peak time of routed and actual outflow). Harmony Search also has the advantage that it does not require the process of assuming the initial values of design parameters. The sensitivity analysis of Harmony Memory Considering Rate showed that relatively large values of Harmony Memory Considering Rate makes the Harmony Search converge to a better solution.

No abstract

No abstract

No abstract

No abstract

No abstract

No abstract