A novel harmony search algorithm based on teaching-learning strategies for 0-1 knapsack problems.
To enhance the performance of harmony search (HS) algorithm on solving the discrete optimization problems, this paper proposes a novel harmony search algorithm based on teaching-learning (HSTL) strategies to solve 0-1 knapsack problems. In the HSTL algorithm, firstly, a method is presented to adjust...
| Publicado en: | Scientific World Journal pp. 637412 - 637413 |
|---|---|
| Autores principales: | , , |
| Formato: | research Journal Article |
| Publicado: |
Wiley-Blackwell
2014
|
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=ccm&AN=104032685&site=ehost-live header: @attributes: shortDbName: ccm uiTerm: 104032685 longDbName: CINAHL Complete uiTag: AN controlInfo: bkinfo: dissinfo: jinfo: jid: 1537744X 1BX5 jtl: Scientific World Journal issn: 1537744X maglogo: N pubinfo: dt: 2014 pid: 480 pub: Wiley-Blackwell place: Malden, Massachusetts artinfo: ui: 104032685 104032685 NLM24574905 2012490130 10.1155/2014/637412 NLM24574905 PMC3910364 104032685 ppf: 637412 ppct: 1 formats: tig: atl: A novel harmony search algorithm based on teaching-learning strategies for 0-1 knapsack problems. aug: au: Tuo, Shouheng Yong, Longquan Deng, Fang'an affil: School of Mathematics and Computer Science, Shaanxi University of Technology, Hanzhong 723001, China. sug: subj: Algorithms Artificial Intelligence Web Search Engines Methods Computer Simulation ab: To enhance the performance of harmony search (HS) algorithm on solving the discrete optimization problems, this paper proposes a novel harmony search algorithm based on teaching-learning (HSTL) strategies to solve 0-1 knapsack problems. In the HSTL algorithm, firstly, a method is presented to adjust dimension dynamically for selected harmony vector in optimization procedure. In addition, four strategies (harmony memory consideration, teaching-learning strategy, local pitch adjusting, and random mutation) are employed to improve the performance of HS algorithm. Another improvement in HSTL method is that the dynamic strategies are adopted to change the parameters, which maintains the proper balance effectively between global exploration power and local exploitation power. Finally, simulation experiments with 13 knapsack problems show that the HSTL algorithm can be an efficient alternative for solving 0-1 knapsack problems. pubtype: Academic Journal doctype: research Journal Article ougenre: Article language: English refInfo: holdings: @attributes: islocal: N |
|---|