A New Moth-Flame Optimization Algorithm for Discounted {0-1} Knapsack Problem
The discounted {0–1} knapsack problem may be a kind of backpack issue with gathering structure and rebate connections among things. A moth-flame optimization algorithm has shown good searchability combined with an effective solution presentation designed for the discounted {0-1} knapsack problem. A...
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
Hindawi Limited
2021
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/170fd293ed1946ae9428cf5cefe05fac |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| id |
oai:doaj.org-article:170fd293ed1946ae9428cf5cefe05fac |
|---|---|
| record_format |
dspace |
| spelling |
oai:doaj.org-article:170fd293ed1946ae9428cf5cefe05fac2021-11-15T01:20:05ZA New Moth-Flame Optimization Algorithm for Discounted {0-1} Knapsack Problem1563-514710.1155/2021/5092480https://doaj.org/article/170fd293ed1946ae9428cf5cefe05fac2021-01-01T00:00:00Zhttp://dx.doi.org/10.1155/2021/5092480https://doaj.org/toc/1563-5147The discounted {0–1} knapsack problem may be a kind of backpack issue with gathering structure and rebate connections among things. A moth-flame optimization algorithm has shown good searchability combined with an effective solution presentation designed for the discounted {0-1} knapsack problem. A new encoding scheme used a shorter length binary vector to help reduce the search domain and speed up the computing time. A greedy repair procedure is used to help the algorithm have fast convergence and reduce the gap between the best-found solution and the optimal solution. The experience results of 30 discounted {0-1} knapsack problem instances are used to evaluate the proposed algorithm. The results demonstrate that the proposed algorithm outperforms the two binary PSO algorithms and the genetic algorithm in solving 30 DKP01 instances. The Wilcoxon rank-sum test is used to support the proposed declarations.Tung Khac TruongHindawi LimitedarticleEngineering (General). Civil engineering (General)TA1-2040MathematicsQA1-939ENMathematical Problems in Engineering, Vol 2021 (2021) |
| institution |
DOAJ |
| collection |
DOAJ |
| language |
EN |
| topic |
Engineering (General). Civil engineering (General) TA1-2040 Mathematics QA1-939 |
| spellingShingle |
Engineering (General). Civil engineering (General) TA1-2040 Mathematics QA1-939 Tung Khac Truong A New Moth-Flame Optimization Algorithm for Discounted {0-1} Knapsack Problem |
| description |
The discounted {0–1} knapsack problem may be a kind of backpack issue with gathering structure and rebate connections among things. A moth-flame optimization algorithm has shown good searchability combined with an effective solution presentation designed for the discounted {0-1} knapsack problem. A new encoding scheme used a shorter length binary vector to help reduce the search domain and speed up the computing time. A greedy repair procedure is used to help the algorithm have fast convergence and reduce the gap between the best-found solution and the optimal solution. The experience results of 30 discounted {0-1} knapsack problem instances are used to evaluate the proposed algorithm. The results demonstrate that the proposed algorithm outperforms the two binary PSO algorithms and the genetic algorithm in solving 30 DKP01 instances. The Wilcoxon rank-sum test is used to support the proposed declarations. |
| format |
article |
| author |
Tung Khac Truong |
| author_facet |
Tung Khac Truong |
| author_sort |
Tung Khac Truong |
| title |
A New Moth-Flame Optimization Algorithm for Discounted {0-1} Knapsack Problem |
| title_short |
A New Moth-Flame Optimization Algorithm for Discounted {0-1} Knapsack Problem |
| title_full |
A New Moth-Flame Optimization Algorithm for Discounted {0-1} Knapsack Problem |
| title_fullStr |
A New Moth-Flame Optimization Algorithm for Discounted {0-1} Knapsack Problem |
| title_full_unstemmed |
A New Moth-Flame Optimization Algorithm for Discounted {0-1} Knapsack Problem |
| title_sort |
new moth-flame optimization algorithm for discounted {0-1} knapsack problem |
| publisher |
Hindawi Limited |
| publishDate |
2021 |
| url |
https://doaj.org/article/170fd293ed1946ae9428cf5cefe05fac |
| work_keys_str_mv |
AT tungkhactruong anewmothflameoptimizationalgorithmfordiscounted01knapsackproblem AT tungkhactruong newmothflameoptimizationalgorithmfordiscounted01knapsackproblem |
| _version_ |
1718428908449169408 |