A Discrete Cyber Swarm Algorithm with Intensification and Diversification Strategies
| Autor: | Shun-Chieh Yang, 楊順傑 |
|---|---|
| Rok vydání: | 2013 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 101 Metaheuristic technique is one of the important methods for solving optimization problems. Many related researches were proposed. Among them, hybrid algorithms combining advantageous features of multiple algorithms appear to be more significant for solving complex problems. Cyber Swarm Algorithm (CSA) is a hybrid algorithm and has been shown to be more effective than several state-of-the-art algorithms for the continuous optimization problem, such as PSO, SS, and GRASP. This paper proposes a discrete version of CSA (to be referred to as DCSA) by considering the distance definition, multistart, intensification and diversity strategies. The experimental results show that DCSA has good performance in solving the well-known quadratic assignment problem. The experimental results also showed that DCSA outperforms several existing methods for important benchmark single row facility layout problem instances. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|