Harmony search tries to find a vector which optimizes (minimizes or maximizes) a certain objective function. The algorithm has the following steps: Step 1: Generate random vectors () as many as (harmony memory size), then store them in harmony memory (HM). Step 2: Generate a new vector . For each c