Solving randomized time-varying knapsack problems by a novel global firefly algorithm
Authors:
- 25 November 2017
- journal article
- research article
- Published by Springer Nature in Engineering with Computers
- Vol. 34 (3) , 621-635
Abstract
No abstract availableKeywords
This publication has 34 references indexed in Scilit:
- Multi-strategy monarch butterfly optimization algorithm for discounted {0-1} knapsack problemNeural Computing and Applications, 2017
- Solving 0–1 knapsack problem by a novel binary monarch butterfly optimizationNeural Computing and Applications, 2015
- Monarch butterfly optimizationNeural Computing and Applications, 2015
- An improved firefly algorithm for solving dynamic multidimensional knapsack problemsExpert Systems with Applications, 2014
- Algorithms for randomized time-varying knapsack problemsJournal of Combinatorial Optimization, 2014
- Incorporating mutation scheme into krill herd algorithm for global numerical optimizationNeural Computing and Applications, 2012
- Bat algorithm for constrained optimization tasksNeural Computing and Applications, 2012
- Mixed variable structural optimization using Firefly AlgorithmComputers & Structures, 2011
- Solving 0–1 knapsack problem by a novel global harmony search algorithmApplied Soft Computing, 2011
- A new population based adaptive domination change mechanism for diploid genetic algorithms in dynamic environmentsSoft Computing, 2005