Studies On The Improved Harmony Search Algorithm

This thesis proposed an Improved Harmony Search Algorithm (IHSA) andvalidated its effectiveness through experimental verification. Furthermore, the IntegerProgramming Problem and the Multi-Objective0-1Programming Problem weresolved with the IHSA.The whole thesis was divided into six chapters.Chapter I introduced the background and significance of this study and proposedthe intelligent optimization algorithms regarding the limitations of traditionaloptimization algorithms. Several intelligent optimization algorithms were alsointroduced in this chapter.Chapter II introduced the classic Harmony Search Algorithm (HSA). Theprinciple, method and procedure of the HSA were presented in the first section. Thesecond section included the application of HSA (such as the Transmission NetworkExpansion Planning, the School Bus Routing Problem and the Civil Engineering, etc)and the improved methods of classic HSA proposed by researchers worldwide.The third section summarized this chapter.Chapter III proposed the Improved Harmony Search Algorithm (IHSA). The firstsection introduced the strategies to improve the classic HSA’s performance andprovided the procedure and the flow charts of the IHSA. The second sectionintroduced the Function Optimization Problem and its mathematical formulations. Inthe third section, the five test functions (Sphere, Rosenbrock, Schaffer, Achkley andGriewank) were presented. The fourth section drew a conclusion that the IHSA wasfeasible and valid by solving the five test functions and comparing it with that of otherintelligent optimization algorithms. The fifth section summarized this chapter.Chapter IV proposed an Improved Harmony Search Algorithm to solve theInteger Programming Problem (IPP). The first section gave a brief introduction to theIPP. In the second section, the IHSA and its procedure were proposed. The thirdsection gave the flow charts of this algorithm. The fourth section solved five testfunctions in different kinds and drew the conclusion that the IHSA could get a betterperformance compared with other intelligent optimization algorithms. A briefsummary was made in the fifth section.Chapter V proposed an Improved Harmony Search Algorithm to solve theMulti-Objective0-1Programming Problem. The first section gave a brief introductionto the Multi-Objective0-1Programming Problem and its Mathematical Model. In the second section, the IHSA was proposed to solve the Multi-Objective0-1Programming Problem. In the third section, the flow charts of this algorithm werepresented. The fourth section employed test examples to compare IHSA and otherintelligent optimization algorithms. The results indicated that the Improved HarmonySearch Algorithm was valid and effective since it can get more Pareto solutions.Thefifth section summarized this chapter.Chapter VI provided summaries for the whole thesis and discussed thedevelopment prospects of the IHSA based on this study.