Influence of Randomized Data Code in Harmony Search Method for Steel Structure Arrangement

Harmony search (HS) method is widely used for solving engineering optimization problems and gives global solution of the problems. But the Pitch Adjustment strategy shows a little weakness inside HS. In this paper HS’s performance for solving engineering problem will be discussed between in sorted and randomized candidate solution code. Three steel structure models are arranged with HS using sorted and randomized data code. HS needs 1.32 until 9.92 times iteration with randomized data code compared with sorted data code. HS solves the problems easier with Pitch Adjusting Rate (PAR) 0.2 than 0.8. It is concluded that HS is powerful for solving steel structure arrangement in sorted data code and in small PAR.