Name
Abstract | ||
|---|---|---|
Graphical abstractDisplay Omitted HighlightsThe idea based on region partition of items for solving 0-1 knapsack problem.Greedy degree algorithm for putting some items into knapsack early.Dynamic expectation efficiency model for obtaining the candidate objective function value.Static expectation efficiency model for updating the objective function value.The proposed algorithm in this paper has correctness, feasibility, effectiveness, and stability. It is well known that 0-1 knapsack problem (KP01) plays an important role in both computing theory and real life application. Due to its NP-hardness, lots of impressive research work has been performed on many variants of the problem. Inspired by region partition of items, an effective hybrid algorithm based on greedy degree and expectation efficiency (GDEE) is presented in this paper. In the proposed algorithm, initially determinate items region, candidate items region and unknown items region are generated to direct the selection of items. A greedy degree model inspired by greedy strategy is devised to select some items as initially determinate region. Dynamic expectation efficiency strategy is designed and used to select some other items as candidate region, and the remaining items are regarded as unknown region. To obtain the final items to which the best profit corresponds, static expectation efficiency strategy is proposed whilst the parallel computing method is adopted to update the objective function value. Extensive numerical investigations based on a large number of instances are conducted. The proposed GDEE algorithm is evaluated against chemical reaction optimization algorithm and modified discrete shuffled frog leaping algorithm. The comparative results show that GDEE is much more effective in solving KP01 than other algorithms and that it is a promising tool for solving combinatorial optimization problems such as resource allocation and production scheduling. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.asoc.2015.11.045 | Applied Soft Computing |
Keywords | Field | DocType |
Economics,Region partition,Greedy degree,Expectation efficiency,Parallel computing | Mathematical optimization,Hybrid algorithm,Correctness,Scheduling (production processes),Continuous knapsack problem,Resource allocation,Artificial intelligence,Optimization algorithm,Knapsack problem,Partition (number theory),Machine learning,Mathematics | Journal |
Volume | Issue | ISSN |
41 | C | 1568-4946 |
Citations | PageRank | References |
10 | 0.52 | 20 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jianhui Lv | 1 | 45 | 7.63 |
| Xingwei Wang | 2 | 1025 | 154.16 |
| Min Huang | 3 | 423 | 71.49 |
| Hui Cheng | 4 | 105 | 6.37 |
| Fuliang Li | 5 | 18 | 7.12 |